US5479407A - Channel utilization method and system for ISDN - Google Patents
Channel utilization method and system for ISDN Download PDFInfo
- Publication number
- US5479407A US5479407A US08/094,115 US9411594A US5479407A US 5479407 A US5479407 A US 5479407A US 9411594 A US9411594 A US 9411594A US 5479407 A US5479407 A US 5479407A
- Authority
- US
- United States
- Prior art keywords
- data
- channels
- destination
- packet
- channel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
- 238000000034 method Methods 0.000 title claims description 22
- 230000007774 longterm Effects 0.000 claims abstract description 23
- 230000004044 response Effects 0.000 claims abstract description 21
- 230000005540 biological transmission Effects 0.000 claims description 29
- 238000004891 communication Methods 0.000 claims description 15
- 208000003035 Pierre Robin syndrome Diseases 0.000 claims description 3
- 238000009825 accumulation Methods 0.000 claims description 2
- 238000007906 compression Methods 0.000 abstract description 16
- 230000006835 compression Effects 0.000 abstract description 16
- 230000001052 transient effect Effects 0.000 abstract description 8
- 238000013144 data compression Methods 0.000 abstract description 6
- 238000012544 monitoring process Methods 0.000 abstract description 6
- 238000004806 packaging method and process Methods 0.000 abstract description 5
- 239000000872 buffer Substances 0.000 description 40
- 239000010410 layer Substances 0.000 description 24
- 238000010586 diagram Methods 0.000 description 20
- 230000008569 process Effects 0.000 description 13
- 230000009471 action Effects 0.000 description 11
- 230000006870 function Effects 0.000 description 10
- 238000012545 processing Methods 0.000 description 7
- 238000012546 transfer Methods 0.000 description 7
- 238000007726 management method Methods 0.000 description 5
- 238000013519 translation Methods 0.000 description 5
- 238000006243 chemical reaction Methods 0.000 description 3
- 230000006837 decompression Effects 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000005070 sampling Methods 0.000 description 3
- 125000000205 L-threonino group Chemical group [H]OC(=O)[C@@]([H])(N([H])[*])[C@](C([H])([H])[H])([H])O[H] 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 2
- 230000032683 aging Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000002346 layers by function Substances 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- ORQBXQOJMQIAOY-UHFFFAOYSA-N nobelium Chemical compound [No] ORQBXQOJMQIAOY-UHFFFAOYSA-N 0.000 description 2
- 238000012856 packing Methods 0.000 description 2
- 230000000717 retained effect Effects 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 230000006585 stringent response Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000009849 deactivation Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000007667 floating Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5614—User Network Interface
- H04L2012/5615—Network termination, e.g. NT1, NT2, PBX
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5614—User Network Interface
- H04L2012/5616—Terminal equipment, e.g. codecs, synch.
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5632—Bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13034—A/D conversion, code compression/expansion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13141—Hunting for free outlet, circuit or channel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13176—Common channel signaling, CCS7
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13209—ISDN
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/1322—PBX
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13332—Broadband, CATV, dynamic bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13384—Inter-PBX traffic, PBX networks, e.g. corporate networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13389—LAN, internet
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13396—Signaling in general, in-band signalling
Definitions
- the present invention relates generally to channel utilization in data and voice communication systems, and more particularly to optimizing channel utilization in Integrated Services Digital Networks (ISDN).
- ISDN Integrated Services Digital Networks
- ISDN International Committee
- CITT International Committee
- An ISDN is structured by architecture closely following the OSI Seven Layer Reference Model.
- the network provides services and the user accesses the services through the user-network interface.
- a "channel" represents a specified portion of the information carrying capacity of an interface. Channels are classified by two types, Basic Rate ISDN (BRI) and Primary Rate ISDN (PRI).
- BRI delivers two B-channels, each having a capacity of 64 Kbps, capable of transmitting voice and data simultaneously.
- a 16Kbps D-channel transmits call control messages and user packet data.
- PRI provides twenty three B-channels of 64 Kbps capacity each for carrying voice, circuit switched data or packet data.
- the D-channel is a 64Kbps signaling channel.
- the B and D channels are logically multiplexed together at Layer 1 of the OSI Reference Model.
- an "intelligent" device such as a digital PBX terminal controller or Local Area Network (LAN)
- an ISDN terminal TE such as a voice or data terminal
- NT1 Network Termination
- Non-ISDN terminals TE may be connected to a Network Termination (NT2) [over the RS-232 Interface] and a Terminal Adapter TA.
- NT2 in turn is connected over an "S/T-Interface", which is a four-wire bus, to a termination NT1 that performs functions such as signal conversion and maintenance of the electrical characteristics of the loop.
- U-Interface At the local loop, a two-wire bus, termed the "U-Interface", or “Loop”, interconnects NT1 and a Loop Termination (LT) at the central office. Finally, the "U-Interface” is a bus between the local loop at the carrier end and exchange switching equipment. Details of this architecture are provided in ISDN: An Overview, Data Pro Research, Concepts & Technologies, MT 20-365; pp 101-110, published by McGraw Hill Incorporated (December 1988).
- ISDN can be used to service the needs both of public data telephony and private networks.
- access to public telephone is performed as shown in FIG. 2(a).
- An initiating host H first issues dialing commands to the public network to set up a connection with the destination host H, and then uses the connection to communicate with the destination host.
- the connection either is circuit switched or packet switched.
- Data communication in private networks incorporates routers, generically called Interface Message Processors (IMPs), which may also be used as hosts.
- IMPs Interface Message Processors
- FIG. 3(a) a host A communicating with host C will take an appropriate route through an IMP interface.
- a gateway operating at the upper layers of the OSI reference model accomplishes gateway functions, translating protocols used on dissimilar networks.
- An ISDN gateway designated by GW in FIG. 1, will operate entirely in the digital domain, carrying out all necessary protocol conversion between the host network and ISDN.
- a related commonly assigned application Ser. No. 08/094,114 to Gagliardi et al., entitled “Method of and System for Accessing Distributed Resources on ISDN”, filed on even date herewith, is directed to implementation of the gateway GW to enable computers interconnected to each other and to the ISDN to share resources by issuing commands in operating system commands.
- One computer can access a storage disk of another computer distributed anywhere in a virtual network established on the ISDN. Each disk throughout the networks has a unique name by which it is accessed. The configuration of the network and number of computers distributed on it are transparent to each user.
- FIG. 3(b) support for existing private networks is transparently accomplished by providing an ISDN gateway GW of a type described in copending application Ser. No. 07/890,588 to Gagliardi et al., entitled "ISDN Interfacing of Personal Computers", which emulates the current interface between a host in the private network and the IMPs that comprise the network, or by emulating the interface to a fixed point-to-point communication link, such as a leased T1 line. Users simply replace the connections to IMPs to connect to an ISDN gateway.
- FIG. 3(c) depicts a variation replacing the connection between an IMP or host and the communication line with that to an ISDN gateway; the IMPs and hosts in this configuration are equivalent.
- a local area network provides a cluster of interconnected hosts (computers), or nodes, on a medium. Each node can communicate with every other node; the network requires no central node or computer.
- Base band LAN systems such as Ethernet, impress data signals directly on the network medium, whereas broad band systems modulate a very high frequency carrier with the data signal before impressing it on the medium.
- the architecture of each LAN conforms with the OSI reference model.
- Other physical media standards include Token Ring and Token Bus.
- FIG. 4 depicts utilization of one type of gateway GW described in copending application entitled "ISDN Interfacing of Local Area Networks" for interconnecting a number of hosts to form a virtual LAN.
- a variation shown in FIG. 5, provides ISDN gateways GW to interconnect to LANs of a common type or of different types using a common naming convention.
- a remote host H is connected to a pair of hosts residing on a LAN through first and second gateways GW at the host and LAN branches of the ISDN.
- the hostside gateway GW1 is of a type described in the copending application entitled "ISDN Interfacing of Personal Computers".
- the LAN side gateway GW2 in the Figure is of a type described in the copending application entitled "ISDN Interfacing of Local Area Networks".
- Interconnection of hosts with a LAN facility or forming a virtual LAN is based on our discovery that point-to-point communications on the ISDN is of the same order of magnitude as that of a high speed local area network. This discovery is counterintuitive, as the nominal throughput of an ISDN is 64 Kbps whereas that of a local area network is in the range of between 10 and 16 Mbps. Accordingly, it would appear that interconnecting a LAN to an ISDN would not be feasible from a performance point of view.
- One factor underlying this surprising "natural" performance adaptation between Mbps LANs and Kbps ISDN is due to a number of factors.
- One factor is the very significant difference between actual point-to-point LAN throughput an LAN rated bandwidth.
- the throughput of a 10 Mbps Ethernet-based LAN typically ranges from 56 to 79 Kbps, less than the capacity of a single ISDN B- channel.
- Our observations indicate the surprising result that while the very large bandwidth can accommodate many simultaneous point-to-point sessions, it is fully compatible for the ISDN to provide long distance interlinking for such sessions.
- one object of the invention is to improve channel utilization for transmission of data through an ISDN.
- Another object is to optimize utilization of ISDN B-channels to individual computers or a local area computer network.
- Yet another object is to flexibly allocate bandwidth in an ISDN, avoiding arbitrary limits permitted for various types of data transfer.
- a B-channel algorithm automatically determines when to allocate B-channels, how many to allocate and for how long. This enables transparent selection of available B-channels to provide the necessary bandwidth for different size file transfers.
- the channel allocation algorithm comprises two components, a long term allocator and a short term allocator.
- the long term allocator monitors recent traffic pattern to and from a destination and decides upon the bandwidth and types of channels to be allocated to that destination.
- the short term allocator monitors the current size of the destination queues and the aging constraints of those queues, and decides whether to temporarily deviate from the decisions of the long term allocator in order to respond to situations that are not well handled by it.
- An example is temporary or sudden surge of traffic to certain destinations not predicted based on the long term allocator algorithm.
- long term allocation forms virtual B channels out of a B channel pool to allocate, deallocate or replace a channel so as to dynamically alter bandwidth.
- Each virtual channel controlled by a corresponding processor, is operative in activated, deactivated, transient or steady states.
- a restricted mode data to be transmitted is sequentially distributed, one packet at a time in a round-robin fashion over the activated virtual channels.
- a far-end virtual processor receives and recovers the data in the same round-robin sequence.
- the load-balancing mode distribution of transmissions over the channels follows a most-empty-channel-first protocol for transmission. The data is recovered by scanning global sequence numbers attached to the data, comparing and implementing a trace-back time-out presentation procedure.
- ISDN traffic is compressed to improve data throughput; typically at least a 2:1 compression of data is carried out by the particular compression technique implemented. Examples in the preferred embodiments are based on run-length encoding and Huffman encoding as well as on variations of the Lempel-Ziv algorithms. Other compression techniques are possible.
- Another aspect of the invention involves processing of packets by the gateway into "trains" to be shipped to a specific destination over ISDN.
- trains may be compressed before transmission.
- Each train has its own header including all packing and compression information to be used by the receiving site to rebuild the original packets and correctly dispatch them.
- the trains are rebuilt into the original packet sequence as a result of numbering applied to each single packet.
- any ISDN application is enabled with the ability to add or drop B-channels automatically, based on the amount of traffic encountered.
- Data throughput between destinations is optimized by packaging variable numbers of packets in trains, compressing the packaged data, and transmitting when a train of data packets becomes available for transmission.
- FIG. 1 is a simplified circuit diagram of an integrated services digital network.
- FIG. 2(a) is a symbolic diagram showing a conventional public circuit or packet switched network.
- FIG. 2(b) is a symbolic diagram of a network functionally equivalent to that shown in FIG. 2(a), implemented using ISDN gateways described in a copending application.
- FIG. 3(a) is a symbolic diagram of a conventional private network having private IMP interfaces or routers.
- FIG. 3(b) is a diagram showing a network functionally equivalent to that of FIG. 3(a), implemented by ISDN gateways disclosed in a copending application.
- FIG. 3(c) is a variation of FIG. 3(b) having a host-IMP interface.
- FIG. 4 is a symbolic diagram showing interconnection of multiple hosts through ISDN gateways to form a virtual network, described in a copending application.
- FIG. 5 is a symbolic diagram showing interconnection of local area networks through ISDN gateways, described in another copending application.
- FIG. 6 is a symbolic diagram showing interconnection of a remote host to an existing local area network through ISDN gateways.
- FIG. 7 is a simplified block diagram showing the hardware architecture of an ISDN gateway provided in accordance with the invention.
- FIG. 8 is a diagram of software architecture incorporated in the system master card shown in FIG. 7.
- FIG. 9 is a diagram of software architecture shown in one embodiment of a LAN line card of FIG. 7.
- FIG. 10 is a diagram showing software architecture incorporated in an ISDN line card shown in FIG. 7.
- FIG. 11 is a diagram of software architecture incorporated in the SDLC line card shown in FIG. 7.
- FIG. 12 is a diagram showing mapping of software to hardware components within the ISDN gateway.
- FIG. 13a is a diagram showing details of the intelligent ISDN manager and device driver shown in FIG. 12.
- FIG. 13b is a symbolic diagram of the communication mode adapter incorporated in the ISDN line card of FIG. 12.
- FIG. 14 is a flow chart of algorithms for carrying out LTA bandwidth allocation in accordance with an aspect of the invention.
- FIG. 15 is a flow chart of algorithms for selecting between LTA and STA channel allocation.
- FIG. 16 is a flow chart of channel processes responding to decisions made by both the LTA and STA channel allocation algorithms.
- FIG. 17 is a diagram showing development of a virtual channel and its components.
- FIG. 18 is a diagram of components for carrying out LTA channel allocation in accordance with another aspect of the invention.
- FIG. 19 is a flow chart describing assembly and compression of packet trains for transmission to a new B-channel.
- FIG. 20 is a flow chart showing compression, decompression and resequencing of packets.
- FIGS. 21a and 21b are diagrams respectively of a packet and a data frame.
- FIG. 22 depicts a train of packets in accordance with a further aspect of the invention.
- the invention provides dynamic bandwidth allocation in an ISDN gateway by allocating B-channels automatically in response to traffic monitored at each destination on the ISDN. Packets are packaged into trains, shipped to a destination when a train having a predetermined packet length becomes available. Data embedded in the trains is compressed for efficient bandwidth utilization.
- an ISDN gateway 100 in accordance with the invention, comprises four hardware elements 102, 104, 106, 108 interconnected by a common bus 110.
- the elements 102-108 preferably comprise individual circuit cards, although some or all of the elements may be incorporated in a single circuit board.
- the board or boards preferably reside within a personal computer but alternatively may reside outside the computer.
- Element 102 is a system master which implement infrequent user functions, such as configuration management and connection requests.
- the system master 102 furthermore functions as a standard computing platform, emulating an IBM compatible PC or other computer standard.
- LAN line card 104 implements firmware and hardware for specific IEEE 802 physical and data link protocol together with software carrying out host filtering. Different LAN line cards with corresponding protocols will be required for other LAN connections, e.g., 802.5 Token Ring and 802.3 Ethernet.
- ISDN line card 106 comprises firmware and hardware implementing the ISDN physical, data link layer (LAPD), and the D-channel layer 3 protocol, and the physical layer of the B-channel.
- Software incorporated in the ISDN line card 106 implements train protocol and B-channel allocation algorithms as well as data compression algorithms to support a virtual broad band capability of the gateway, also to be described later.
- SDLC line card 108 includes firmware and hardware to implement the SNA physical and data link (SDLC) layers. This card is optional to the network.
- the software architecture of system master element 102 is configured with three layers of software underlying the system master 102(b) in a stack.
- the underlying layers comprise call request management, configuration management and monitoring, 102(b), as well as layers 102(c), 1O2(d) for implementing a computing platform.
- the software architecture of one embodiment of a LAN line card (LLC) 104 for 802.5 Token Ring comprises a functional layer 104(a) together with a layer 104(b) comprising a host filter, receiving and selectively processing packets addressed to the host, as well as underlying layers 104(c), 104(d) implementing the specific IEEE 802 physical and data link protocol (802.5) for Token Ring.
- LLC LAN line card
- the software architecture of the ISDN line card 106 comprises a functional layer 106(a), together with underlying layers 106(b)-106(f) for carrying out the requirements of the OSI reference model layers associated with the ISDN. These layers include a communication mode adapter at layer 106(b) (see also FIG. 13a) and protocol services at layer 106(c).
- Layer 106d (IIM) carries out gateway peer protocol and executing buffer allocation algorithms to be described in detail later. The peer protocols, applied on B-channels used by the gateway to implement train packing, compression and error handling, is also described later.
- FIG. 11 depicts the software architecture of the SDLC line card implementing the SNA physical and data link layers for carrying out inter-networking among hosts.
- a USER software module 110 supports user application software and protocol stack, residing at layer 7 of the OSI Reference Model.
- Configuration control manager 112 of the system master monitor bandwidth allocation and errors.
- the system master 102 specifically manages configuration of the gateway, providing status, billing and information tracing on the use of resources in the gateway, as well as access to internal tables used by bridging and routing gateway services. Also provided by the system master are network management services and remote access to other system masters in the same interconnected network.
- Functions carried out by the system master 102 include updating of records, loaded on disk into memory resident data structures when the system is initiated. When these tables are updated, the disk is automatically updated as well.
- Configuration control manager 112 controls parameters which define the resources available to the gateway and the access privileges to the system master 102.
- a connection request manager incorporated in 112, defines how the gateway relates to other gateways for implementing gateway functions to a personal computer or to define an interconnected LAN providing a virtual network, described in the copending applications entitled "ISDN Interfacing of Personal Computers” and “ISDN Interfacing of Local Area Networks", incorporated herein by reference.
- Configuration control manager 112 maintains a configuration table for parameters controlling the operation of the gateway.
- the table implemented in software, defines the ISDN configuration including number of channels allocated to the gateway, characteristics of the channels and all directory numbers associated with the gateway. Furthermore stored are characteristics of the types of interconnections of the host side of the network, e.g., RS-232, DMA, etc., and default parameters for incoming calls, e.g., select all non-collect calls, allow collect calls with proper user information and collect calls only from particular numbers. Level of system monitoring, also retained by the control configuration manager tables, controls available options and enables the amount of overhead associated with those options to be limited. Password information for access to the gateway and user profiles determining what kind of activities are allowed to a given user or a class of users also are retained in the manager tables.
- a connection request manager included in module 112, controls a table containing information required to set up a B-channel or remote gateway. This information includes at least one remote ISDN number for the connection and any user information required in the layer 3 set-up message.
- the connection request table defines the interconnected LAN. During operation of the gateway, this table also records whether the connection is established and provides a handle for the connection which can be used to direct packets to a destination manager.
- Configuration control manager 112 collects statistics for B-channels, including channel utilization including a statistical sampling to determine the percentage of idle capacity on the channel, possibly on a per-connection basis. Since each channel is bi-directional, measurement takes place both on the outgoing and incoming lines. Information also is maintained on any delay for packets in the system, as well as on the "high water mark" in the buffer pool for a given destination and the number of buffers discarded for a destination due to memory constraints. For channels that are connected, the percentage of frames sent or received in errors will also be recorded for use, among other ways to determine the type of data link protocol applied to a given destination.
- Use of the gateway by nodes of an LAN is monitored by a system administrator (not shown in FIG. 12) which records the amount of data sent or received by a node on a per-cargo destination basis, the number of connections initiated due to packets of a given node, and the arrival rate of packets from a particular node.
- the system administrator further may monitor broadcast or multi-cast transmissions by a particular node, and the number of times a node is not found in tabulated data. To reduce the overhead of monitoring the bridging operation, the system administrator restricts monitoring to traffic from specific nodes or uses statistical sampling of all traffic in the gateway.
- LAN card 104 comprises principally a host filter 114.
- the host filter 114 Upon arrival of a packet from another host within a local LAN, the host filter 114 examines the link-level address of the packet. If the packet is addressed to a local host other than the gateway, the packet is discarded. If the packet is addressed to remote hosts covered by a bridging service, it is passed to bridger 118 implemented in ISDN line card 106. If the packet is addressed to the gateway, and the packet indicates a service access point of the gateway protocol services, then it is passed to gateway services module 120. Finally, if the packet is addressed to the gateway, and the packet type is not recognized to be any of the service access points of the gateway protocol services, then it is passed to user module 110 in system master card 102 (LI/B).
- IIM intelligent ISDN manager
- the packet is passed to the bridger 118, the packet is intended to be bridges over to another local area network.
- gateway services module 120 the packet is intended to be processed by some gateway protocol service programs analogous to those in the user private protocol stack in user module 110.
- the services provided are those commonly associated with the network or inter-network layer of communication protocols, including name and address resolution and some limited form of routing. An example is a simplified re-implementation of the network layer of an existing communication protocol.
- These service programs in turn interact with the IIM 116 to pass data to remote hosts (LI/R).
- a packet passed to the user module 110 is meant to be handled by some application or protocol software resident on the same node as the gateway.
- An example of such a program is a private protocol router.
- the user module 110 of system master card 102 interfaces with communication mode adapter (CMA) 122 of the ISDN line card 104 through a communication mode adaptor interface 124.
- the CMA 122 provides various adaptation modules allowing the user module 110 to interface with destinations, such as a user modem, leased lines or virtual circuit telemetry which adapts existing USER software and interacts with public or private data networks that support virtual circuits.
- the architecture of the CMA is depicted symbolically in FIG. 13a.
- the gateway services module 120 provides router functions for private protocol stacks. Name and address resolutions are performed at the user module 110, incorporating existing software of the private protocol stacks or one performed within gateway services module 120. In the latter case, the gateway services module 120 can be performed of at an existing private network/inter-network protocol stack, re-implemented as required for particular applications.
- the intelligent ISDN manager (IIM) 116 receives packets of data and commands to set up virtual circuits.
- the IIM 116 implements train packaging and B-channel allocation as well as data compression, forming important aspects of the invention. The content and operation of IIM 116 are described in detail hereinafter.
- Bridger 118 operates at the 802 medium access (MAC) layer between LANs or single nodes. This module is used to create a much larger "virtual LAN” out of an arbitrary number of LANs and single nodes, described in copending application entitled "ISDN Interfacing of Local Area Networks".
- An 802 MAC level bridge as a method to interconnect level 2 networks in this regard is particularly advantageous for several reasons. First, providing a connection at the MAC level ensures that all higher level protocols available across connected LANs will continue to work in a virtual LAN with no modification, and that network applications based on these higher level protocols will also operate in the same manner. A bridge in this respect supports many types of network systems on different LANs.
- bridges in general can handle an order of magnitude more packets using the same processing power.
- MAC level bridges operate in a connectionless mode and depend on high quality transmission lines to minimize retransmissions controlled by higher level protocols on an end-to-end basis.
- Network routers tend to require much more overhead, because they operate in connection mode and in view of to the number of control messages required to allow for a dynamic routing. Given the disparity between ISDN bandwidth and LAN bandwidths, the ability to minimize the overhead needed to manage the LAN connection is considerable.
- Peer protocol implemented by IIM 116 ensures that data packets arrive to the remote gateway in the same order as they were received by the local gateway. Peer protocol provides a transport level surface to sequence all packets for this purpose.
- packet sequence refers to an ordered series of packets sharing a common source/destination pair; the series may or may no be continuous. For example, if a gateway on a first LAN receives a series of packets with the same source and destination, after the packets are shipped to a gateway on a second LAN the packets are released as a packet sequence in the same order with or without discarded packets. Packet sequencing does not ensure that all packets from the first LAN to the second will be placed on the second LAN in the original order, only that the order to a particular source/destination pair will be the same.
- a header is added to each 802 packet identifying packet type, the sequence number for the packet and the packet size.
- 802.3 packets already have a length field, 802.5 packets do not so that peer protocol as implemented herein must provide one.
- Packet sequences are mapped into cargo destinations, with many packet sequences being designated to a single cargo destination. Mapping of packet sequences to cargo destinations is supported by system master 110. Of particular importance, a cargo destination is divided into many trains of a format shown in FIG. 22 in accordance with an aspect of the invention. A train contains an integral number of packets. There is no limit to the size of a train, although the size is predetermined and all gateways preferably use the same maximum train size so that fixed size buffers can be implemented.
- the content of a train is compressed in accordance with another aspect of the invention, then "framed" by adding start and stop sequences, a checksum and other frame control information.
- Peer protocol preferably specifies the description of a frame, including details of the frame header and data fields. This model enables the peer protocol to operate at three different levels, PS packets (803 packets having a PS header), trains and frames.
- PS packets (803 packets having a PS header)
- trains and frames The following diagram shows transformations that a packet undergoes both as a packet arrives to a gateway from a local area network and as the packet is transferred back to a different local area network:
- FIG. 21a shows a PS packet comprising the following fields: PT (packet type), PSN (Packet Sequence Number), LEN (Length of Stripped Packet) and Data.
- a data frame format shown in FIG. 21b as another alternative, comprises the following fields: FS (Frame Start), FT (Frame Type), FSN (Frame Sequence Number), FC (Frame Control), Data, FCS (Frame Checksum) and FE (Frame End).
- packet processing as the packets are moved from a first LAN to a second LAN assumes use of the gateway as a bridge at the 802 medium access control level (MAC), the following is a description of packet processing as the packets are moved from a first LAN to a second LAN.
- packets addressed to the gateway are forwarded to the system master 102; packets addressed to other nodes on LAN 1 are discarded, and all other packets are passed to the packet sequence manager.
- Complete 802.5 packets are built by adding start of frame and end of frame fields, completing the host filter 114 functions.
- Calls from a cargo destination manager determine the cargo destination for the received packet.
- the size each queue and the hold time of each queue not being serviced by the train builder is communicated to the B-channel allocation manager (FIG. 13(b)).
- the PS header has a packet sequence number to each packet, and the initial packet in a sequence is assigned sequence number 1.
- the PS header is removed from the 802 packet, checked and may be discarded.
- the packet is sequenced as follows. If the packet sequence number is 1, the bridge manager is notified that a new conversation with a remote node has been initiated by the remote node, and the bridge manager will update the bridge data base. If the sequence number is not 1, the number is checked to see if there was a gap from the last packet received. If a gap exists, the packet is queued, and a timer is set. If the missing packet arrives before the timer expires, the queue is re-ordered, and the packets are released in order. Otherwise, the number of received packet is recorded, and the packet is released. If a packet with a lower sequence number subsequently arrives, it is discarded. The 802 packet type is checked and 802 protocol translation is carried out if necessary, i.e., translating an 802.3 packet to an 802.5 packet.
- the train builder requests packets from the cargo destination manager, allocates and fills buffers and maintains the number of bytes used in the buffer. Received buffers are unpacked and passed to the level above after being parsed to ensure that no error in transmission has occurred.
- a compressor compresses the input buffer using a compression algorithm in a manner to be described later. Incoming data is decompressed and tested to confirm that it will fit in a new buffer; if not, an error is indicated.
- a data frame is built by adding a frame header and trailer to the active bits in the buffer.
- the B-channel allocation manager indicates when the frame control bits should be set to "last frame".
- the frame is gated onto the B-channel for the destination found in the buffer control block.
- the buffer is freed after being gated to the B-channel.
- For incoming data a buffer is allocated for the arriving frame.
- the frame is checked using the FCS, and any frames in error are discarded.
- Control frames are supplied to the system master.
- Data frames are supplied to the compression manager, and the B-channel allocation manager receives a "last frame” setting in the frame control (FC) field.
- FC frame control
- An important aspect of the invention is B-channel allocation, implemented by an allocation algorithm to maximize utilization of the channels, minimize response times and the probability of losing data packets due to buffer overflow.
- the channel allocation algorithm residing within the B-channel manager of IIM 116 (FIG. 12), includes commands to establish user-level connections to destinations and to send and receive data. Data passed to the IIM 116 is queued in destination queues.
- the channel allocation algorithm monitors the status of the destination queues, and dynamically allocates ISDN channel bandwidth to these queues.
- the following definitions support the channel allocation algorithm.
- each destination Associated with each destination is a "destination queue”, denoted as Q(d), consisting of a pool of buffers.
- the pool of buffers for destination d comprises the messages destined for d.
- the number of buffers in Q(d) is denoted as b(d); it is assumed that B-channels output from or input to a buffer in parallel, with each buffer having a fixed maximum size.
- a number of B-channels currently allocated to a destination B is denoted as B(d). If a queue Q(d) becomes too long relative to the number of channels allocated to d, an extra channel is allocated. On the other hand, if Q(d) is relatively short compared to the size of B(d), some channels are released. If no buffers are available for accumulation of a new train at a destination d, a "buffer fault" is created.
- the channel allocation algorithm operates asynchronously to the buffer allocation algorithm described previously.
- the channel allocation algorithm is portioned into two components, long term allocation and short term allocation.
- Long term allocation monitors the recent historical track pattern to and from a destination, and decides upon the bandwidth and types of channels to be allocated to that destination.
- a short term allocation monitors the current size of the destination queues and the aging constraints of these queues, and decides whether to deviate, temporarily, from decisions of the long term allocation algorithm. This enables response to situations that are not well-handled by long term allocation, e.g., situations arising due to a temporary or sudden surge of traffic to certain destinations not predicted based on the long term allocation algorithm.
- Decisions on bandwidth allocation produced by the long term and short term allocation algorithms preferably are stored in charged memory, and are carried out at convenient intervals by ISDN channel processes to be described later.
- B-channels can be used in a circuit switched mode or in a packet switched mode.
- the circuit switched mode preferably is used only to transmit data between low-traffic destinations in view of the relatively high set-up tear down overhead required.
- the packet switched mode is preferable for transmission to destinations with a low-traffic rate if there is a moderate response time requirement. For destinations that require higher traffic rate or have more stringent response time requirements, use of B-channels in the circuit switched mode is preferable. For destinations that do not have high traffic rate but have very stringent response time requirements, the B-channels should be dedicated in the circuit switched mode and deliberately under utilized.
- the long term allocation algorithm is summarized in the flow chart of FIG. 14.
- the traffic rate R at each destination is monitored by a software flowmeter, which may be a counter of data quantity arriving at the destination queue within a particular interval of time.
- Each software flowmeter is polled at fixed intervals (w).
- the flowmeter is read, then reset, and the reading is used by the long term allocator LTA to determine how many B-channels are to be allocated to that destination.
- step 150 reads a traffic rate R for a destination d, wherein R is defined as follows.
- v -- in(d, t-w, t) is the accumulated input traffic volume for destination d between time t and t-w
- v -- out(d, t-w, t) is that for the output queue.
- step 152 an integer x, that is greater than or equal to zero, is found such that:
- hbw -- cs is the achievable bandwidth once set up for a circuit switched mode B-channel. This number in practice is close to 64 Kbs.
- step 154 determines whether residual is greater than mbw -- cs, where mbw -- cs is the minimum utilization of a circuit switched B-channel, or whether the response time is more stringent than moderate (step 156).
- moderate is defined to be the response time that can be offered by a packet switched channel. If either condition is true, than one more B-channel is allocated to destination d (step 158).
- a fraction of a packet switched channel is allocated to destination d, wherein the fraction f is determined as follows.
- ebw -- ps effective bandwidth of a packet switched B channel.
- step 160 if destination d is not reachable by packet switched channels, or the packet is not of a nature that is suitably transmitted through packet switched channels, and the response time requirement is very relaxed (step 162), then a fraction of a circuit switched mode channel is allocated to destination d (step 164).
- the fraction in this example is determined by the size of the residual.
- the algorithm is sensitive to the transmission delay of packet switched channels and the ISDN call set-up and tear down times for circuit switched mode.
- the former is used to derive a boundary between moderate and height response times.
- the latter is used to calculate the response times obtainable for time-shared fractional allocation of B-channels in circuit switched modes, which in turn determines the value of z which defines the boundary between moderate and very relaxed response time requirements.
- the basic logic of the algorithm remains unchanged under different performance profiles.
- meter window w
- w the "meter window” w, which is selected such that the algorithm is sufficiently sensitive to short-term fluctuation in traffic intensity but is not too sensitive. If w is too small, a very short-termed surge in traffic may result in too many B-channels allocated and therefore will incur a high set-up/tear down overhead. If w is too large, the algorithm may not be responsive enough to a short term search, resulting in a fast destination queue build-up. An excessive amount of buffer space may be consumed and response time may be degraded.
- a method using weighted averaging of traffic in multiple windows is provided. If a window system W with three windows w1, w2 and w3 is used, with weights wt1, wt2 and wt3, where the sum of wt1-wt3 is unity, traffic rate r can be equated to R(d, t, W,) computed as follows: ##EQU1##
- wt1 should be increased and wt3 decreased, and vice versa.
- Multiple counters are maintained for each destination queue using this strategy.
- the long term allocation algorithm functions well in cases where there are sufficient B-channels available and decisions made by the LTA are feasible. This means that the total number of B-channels allocated by the LTA is smaller than the total number of B-channels subscribed, and sufficiently smaller such that the probability that an incoming call request finds all channels busy is very small, and further that the recent past history in fact represents a good basis for allocation. When such conditions are not met, short term allocation (STA) must be implemented.
- STA makes decisions which override, temporarily, decisions made by LTA.
- Channel processes described hereinafter, implement decisions made by LTA under normal circumstances.
- the B-channel process checks to see if a decision has been made to de-allocate channels from the destination d. If so, it de-allocates itself and finds a new destination for which a decision has been made by LTA to have additional channels allocated.
- self-adjustment may be performed by the B-channel process to execute decisions rendered by STA.
- step 170 waits until a B-channel is freed from servicing in the input buffer and the output buffer, and then waits for an STA condition, such as the two conditions previously described, to be detected (step 172).
- STA condition such as the two conditions previously described
- LTA is implemented in step 174 unless the STA condition is detected.
- STA channel allocation is carried out in step 176, and the process continues.
- An important aspect of the invention involves the B-channel processes which respond to decisions made by both the LTA and STA.
- channel process invocation is triggered in response to end of train transmission on any B-channel for input or output traffic.
- the first part of the channel process algorithm at 180 prevents locking out trains associated with low traffic rate destinations, or locking out incoming call requests. Executing lockout prevention at the first part of the algorithm eliminates possibility of lockout. Since this part of the algorithm tends to disturb stable allocations of B-channels to high intensity traffic streams, probability of invocation preferably is modulated inversely to the number of B-channels assigned to the destination associated with the just freed B-channel.
- the probability of invocation is higher if the B-channel is allocated fractionally to a high number of distinct destinations. Probability of invocation is lower if more B-channels have been allocated to the same destination. In other words, the higher the traffic rate for a destination d, the lower the probability of causing a "wild" de-allocation of one of its B-channels to handle of locked out trains.
- Sealed trains are time stamped. A check is made by STA over the entire buffer pool for all destinations to see if there are trains whose age exceeds a predetermined age limit. If any are found, absence of B-channels allocated to their destinations are checked to confirm that trains are truly locked out. If such a flag is found, the just freed B-channel is associated to all respective destinations, originating fractional allocations of B-channels, the oldest locked out train is selected and transmitted.
- a condition wherein the age limit is set at a sufficiently high level, and if overall traffic does not exceed the capacity of the gateway is very rare. This condition must be rare to avoid thrashing in the allocation of B-channels, and must be handled as the first priority decision to avoid blocking trains associated with very low packet rates.
- step 182 of the flow chart the B-channel is re-used to transmit it. Giving priority to the same destination re-use of the B-channel minimizes ISDN call overhead.
- step 184 two subcases are considered.
- the just freed B-channel is fractionally allocated to n destinations.
- the remaining n-1 destinations are checked for waiting trains, and if one is found the channel is assigned to it for transmittal. This allows maintenance of "stable" pools of low traffic rate destinations if none are found, the following second subcase is executed. If no complete train is waiting for destination d -- sub -- i, Flag -- Queue -- Size is checked, and if set, a new destination d -- sub -- j is computed as the one which contains the largest relative queue size. Thereafter, the channel process remains with decisions made by LTA.
- Run-length encoding refers to replacement of sequences of identical source elements by a triple consisting of a special code indicating a "run" of elements, a count of the run length and the repeated element.
- Huffman encoding translates fixed-sized source elements into variable-sized codes, where the size of the output code and bits is approximately the logarithm of the probability of the source element. For some kinds of data, the probabilities of elements are well known and fixed translation tables are available.
- a translation table can be computed for a sum block of input data, and transferred along with the data to allow decompression. This requires two passes over the input during compression; table size must be significantly smaller than the data blocks.
- the Lempel-Ziv algorithms convert variable-sized input elements, or strings, into fixed-sized codes. Allowing long input sequences gives the possibility for higher compression ratios than are possible with fixed-size source element algorithms, such as Huffman encoding.
- the Lempel-Ziv algorithms are adaptive in that translation tables are built dynamically to reflect characteristics of the input, but require only a single pass during encoding. Decompression can be performed by dynamically building the same translation tables as were used during compression, using information implicit in the encoded data stream such as whether a particular code has been encountered.
- the typical ranges of compression ratios of a compression algorithm selected to compress packet trains vary from about unity for certain kinds of inherently random data such as floating point data or previously compressed data, to eight for some data bases containing large amounts of redundant or null data.
- the average compression ratios over mixed input types depends on the chosen samples, but ratios of between two and four for fairly large samples of mixed input found on real computer systems are common; two is proposed as an example in the preferred embodiment.
- a controller 170 comprises a virtual B Allocator/Resource Manager 172 which opens a virtual B-channel with control attributes in table I below from the B-channel pool as requested. Manager 172 also assigns a virtual B processor 174 implemented from among a plurality of such processors, and handles related supporting global resources.
- the virtual B processors 174 at run time or initialization time provide the service of transparent addition and deletion of new or existing component channels in its virtual B-channel based on virtual B attributes.
- the processors 174 further provide transparent multiplexing of client data.
- Virtual B-channel monitor 176 carries out traffic and error monitoring of all virtual B-channels, data traffic flow and allocation, day allocation and replacement of channels to dynamically alter bandwidth are performed by the monitor 176.
- Call set-up/disconnect processor 178 sets up and disconnects protocol on the D-channel.
- Processor 178 interfaces to B-channel hardware to transform the B-channel call set-up or disconnect, and interfaces with the virtual B processors 174, resource manager 172 and client.
- HDLC/LAPD links 180 provide the variable links for clients, and are optional.
- Component channels allocated for a virtual B-channel have the following four defined states: activated, deactivated, transient and steady. In the deactivated state, data transfer is forbidden although control protocol exchange is not. Component channels allocated or joined are initially in the deactivated state. A channel, deactivated for a sender immediately following the deactive -- b command, described later, is queued for transmission. For a receiver, a channel is deactivated immediately after the command is received. Only a bi-directionally deactivated channel is removed and physically disconnected from the virtual channel of which it was a member.
- both data and control protocol transfer are permitted.
- a channel is activated to a sender only after acknowledgement of the active -- b command transmitted is received.
- a channel is activated immediately after this command is received.
- the transient state is defined by guarding periods before acknowledgements are received from the far-end.
- a virtual channel is transient when any component channels are transient. No data can be sent over a channel in the transient state.
- a component channel is in the steady state if it is not in the transient state, that is, if it is activated or deactivated.
- a virtual channel is in the steady state if all its components are in the steady state.
- a virtual B-channel is operative in two multiplexing modes, restricted mode and forced load-balancing mode.
- restricted mode data received for transmission is sequentially distributed, one packet at a time, in a round-robin fashion over the steady activated component channels; deactivated channels are skipped.
- the far-end virtual B processor 174 receives and recovers data in the same round-robin sequence.
- load balancing mode of operation the distribution for transmissions over the channels follows a protocol of most-empty-channel-first for transmission. The receiver recovers it by the global sequence numbers by scanning, comparing and carrying out trace-back time-out presentation.
- active -- b commands described below, are sent in-line on the deactivated component channels.
- deactive -- b commands are sent in-line over these channels in place of the data in the sequence.
- Time-fill SYNC -- vB packets may be sent over channels in the restricted mode of operation to avoid "holes" in the data stream, and further can be used for time control in the load-balancing mode of operation.
- command categories together with detailed format and bit definitions, used for controlling and multiplexing protocol.
- This protocol assumes the use of flow control to be optional depending on implementation and environment.
- protocol formats are for the restricted mode
- the load-balancing mode is identical except that all the numbered command category header-bytes described below will be two bytes in length.
- This protocol assumes the use of flow control to be optional, at least to some degree, depending on the implementation and environment. In the restricted mode, this can be controlled by client link level protocol; outstanding transmissions preferably should not result in difference of 26 generations or more between the receiving and the far-end transmitting loop.
- the load-balancing mode has the same format except that all the numbered command category header-bytes described below will be two bytes in length.
- Ossnnnn one byte as header of client's data for transmit.
- 101nnnnn one byte header of one or multiple control bytes.
- the first control byte can further specify explicitly whether it is global. If it does not specify, it depends on the address bytes which follow. No address byte for the in-band operation is required, and multiple address bytes imply the in-band line is not explicitly included.
- the explicit global commands have the leftmost bit on, followed by explicitly specified address bytes. If the leftmost two bits are both on, it is a broadcast, and no address bytes follow. Multiple bytes are useful for off-band control. At present, only one byte of in-band control is employed. The leftmost third bit is reserved, and the fourth bit is for system control point specification. These are external or internal indicated by E and I respectively as follows. The last four bits define the commands of this category. At present, these are:
- DEACTIV -- Bs group uwx1z, w bit is reserved and u defines two system points.
- ACTIV -- Bs group uwxOz, w bit is reserved, u the same as defined above.
- 110nnnnn one byte only, used for time-fill and synchronization.
- 111nnnnn one byte header, followed by no or multiple optional bytes. This is an acceptance acknowledge in reply to a RQST -- Bs, and in-band is implied if no other bytes follow. Similar to the case in RQST -- Bs, the first by which follows can further specify whether it is global. The leftmost two bits have exactly the same meanings, which describe the scope of the possible further succeeding address bytes. The leftmost third bit, if on, turns the whole meaning of the response into a negative acknowledgement, instead. The last five bits are the same as for RQST -- Bs.
- MODE -- lbc with thirteen (13) bits global sequence numbers, when opening a virtual B.
- the attributes of Table I to follow after these headers are optional.
- the mode negotiation can proceed only when all component channels are in deactivated states, or UNA will be received if the optional attributes are not accepted, UNA will also be received. A REJ will be received if the remote end does not support or will not accept this request.
- MODE -- vB resets the generation number or the global sequence number for transmitter and the corresponding variable back to 0 to restart and resets the transmitter and receiver (loop) pointers back to the first component position.
- This unnumbered positive response means acceptance in the mode negotiation.
- the same MODE -- vB packet will be sent back as bi-direction initialization, following the UA.
- the UA is also used for acknowledgement to flow control commands RR and RNR. It is used for acceptance acknowledgement to ATTRB -- vB as well as unnumbered commands.
- 10010100 a negative response for refusing, used similarly to UA.
- nnnnn is a module 32 correlation generation number, or a zero based global sequence number, assigned to each round of transmissions in restricted mode of operation, or assigned and incremented by one for each numbered transmission in the load balanced mode.
- the "ss" in the DATA command which has four values 11, 10, 01 nd 11, is for frame segmentation.
- sequence numbers are for data synchronization across the component channels.
- a receiver variable "nr”, used for synchronization, is incremented by one after each round, or each actual numbered reception. This is a recover process corresponding to the far-end sender's sequence number increment for each round, or each data or numbered command transmission.
- the selected virtual B processor 714 polls the receiving queue and then steps to the next component channel.
- restricted mode if nothing arrives in the queue of an activated channel, the processor stays and waits indefinitely.
- the processor waits indefinitely or steps after a time out period if a trace-back timer has been started, regardless of the channel states.
- the processor hunts through all following contiguous deactivated channels for any arrival, and does trace-back get, steps or stays until the trace-back timer expires, if arrival time inversion is found.
- the time-fill SYNC -- vB commands are to be received over their preceding channels, if no other commands or data are available through these channels.
- the receptions in load-balancing mode are always in hunting mode, across the full range of component channels.
- the processor continues looking for the correct sequence number for presentation. Trace-back time-out presentation scheme applies in either mode.
- Sensing of traffic for automatic control of bandwidth is carried out as follows. Assuming that the sampling rate is one sample every two seconds, the maximum bandwidth of the virtual channel opened is set to be five B-channels, definition of the high -- util thres is 75%, of a high -- busy -- util -- thres is 5, the high action -- thres is ten and the initial channel opened is one B-channel (64 Kbps). As transmission rate increases steadily from an original effective rate of 45 Kbps to 55 Kbps, a procedure for adding a new line is automatically initiated thirty seconds later. This assumes that the high -- action -- permit is true. A new element channel is added and the new line utilization will be 42.3% if traffic is maintained at 55 kbps. An increase in input data rate thus drives up bandwidth growth. If the input data rate continues to increase, the bandwidth eventually will reach five B-channels as a maximum.
- Bandwidth of an ISDN line is dynamically allocated by a gateway GW in accordance with the invention which monitors traffic to each destination and in response allocates or deallocates virtual B-channels in accordance with FIG. 18.
- a long term bandwidth allocation algorithm (LTA) shown in FIG. 14, determines when and for how long to allocate B-channels to a destination queue under typical traffic conditions; a short term allocation algorithm (STA) allocates B-channels under other conditions (FIG. 15).
- Bandwidth utilization is optimized by packaging and transmitting data packets in "trains". The trains are compressed using a suitable data compression algorithm before transmission from the gateway to the ISDN.
Abstract
Description
______________________________________ 802.5 LAN 1 (full 802.5 frame) GW Lan Card (802.5 packet stripped of fields not covered by the checksum) Packet Sequence Builder (PS header + stripped 802.5) Train Builder (buffer of PS packets) Destination Known Frame Builder (Frame Header + compressed Train (bit array) + Frame Trailer) B Channel 64Kbs bit stream ISDN ______________________________________
r=Max{v.sub.-- in(d, t-w, t)w, v.sub.-- out(d, t-w, t)/w},
x*hbw.sub.-- cs≦r≦(x+1)*hbw.sub.-- cs
TABLE I __________________________________________________________________________ Virtual B Channel Attributes (in C language representation) __________________________________________________________________________ typedef struct long err.sub.-- threshold; /* one out of err.sub.-- threshold frames */ short err.sub.-- action.sub.-- thres; /* act on config err.sub.-- action.sub.-- thres */ short err.sub.-- action.sub.-- permit; /* allow deactivation of errored channel */ short max.sub.-- band.sub.-- width; /* max allowed bandwidth */ short high.sub.-- util.sub.-- thres; /* high effective % band width threshold */ short high.sub.-- busy.sub.-- util.sub.-- thres; /* one high util out of high.sub.-- busy.sub.-- util */ short high.sub.-- action.sub.-- thres; /* act on contig high.sub.-- busy.sub.-- util.sub.-- thres */ short high.sub.-- action.sub.-- permit; /* allow bandwidth increment actions */ short min.sub.-- band.sub.-- width; /* minimum allowed bandwidth */ short low.sub.-- util.sub.-- thres; /* low effective % bandwidth threshold */ short low.sub.-- busy.sub.-- util.sub.-- thres; /* one low util out of low.sub.-- busy.sub.-- util */ short low.sub.-- action.sub.-- thres; /* act on contig low.sub.-- busy.sub.-- util.sub.-- thres */ short low.sub.-- action.sub.-- permit; /* allow bandwidth decrement actions */ short set.sub.-- up.sub.-- retry.sub.-- thres; /* max contig retry before giving up */ short no.sub.-- action.sub.-- thres; /* no action threshold time */ VB.sub.-- THRESHOLD; __________________________________________________________________________
Claims (11)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/094,115 US5479407A (en) | 1991-05-24 | 1991-05-24 | Channel utilization method and system for ISDN |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/094,115 US5479407A (en) | 1991-05-24 | 1991-05-24 | Channel utilization method and system for ISDN |
CA002109632A CA2109632C (en) | 1991-05-24 | 1991-05-24 | Channel utilization method and system for isdn |
PCT/US1991/003613 WO1992021188A1 (en) | 1991-05-24 | 1991-05-24 | Channel utilization method and system for isdn |
Publications (1)
Publication Number | Publication Date |
---|---|
US5479407A true US5479407A (en) | 1995-12-26 |
Family
ID=25676798
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/094,115 Expired - Lifetime US5479407A (en) | 1991-05-24 | 1991-05-24 | Channel utilization method and system for ISDN |
Country Status (1)
Country | Link |
---|---|
US (1) | US5479407A (en) |
Cited By (57)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5574861A (en) * | 1993-12-21 | 1996-11-12 | Lorvig; Don | Dynamic allocation of B-channels in ISDN |
US5577041A (en) | 1993-01-08 | 1996-11-19 | Multi-Tech Systems, Inc. | Method of controlling a personal communication system |
US5617423A (en) | 1993-01-08 | 1997-04-01 | Multi-Tech Systems, Inc. | Voice over data modem with selectable voice compression |
FR2744580A1 (en) * | 1996-02-06 | 1997-08-08 | Siemens Ag | METHOD FOR TRANSMITTING DIGITAL SIGNALS IN THE FORM OF TIME-MULTIPLEXED CHANNELS VIA AN ATM TRANSMISSION DEVICE |
US5675732A (en) * | 1995-05-08 | 1997-10-07 | Lucent Technologies Inc. | Dynamic channel assignment for TCP/IP data transmitted via cable television channels by managing the channels as a single sub network |
US5682386A (en) | 1994-04-19 | 1997-10-28 | Multi-Tech Systems, Inc. | Data/voice/fax compression multiplexer |
US5724356A (en) * | 1995-04-28 | 1998-03-03 | Multi-Tech Systems, Inc. | Advanced bridge/router local area network modem node |
US5754786A (en) * | 1996-09-13 | 1998-05-19 | At&T Corp | System and method for integrated overload control and message distribution |
US5754589A (en) | 1993-01-08 | 1998-05-19 | Multi-Tech Systems, Inc. | Noncompressed voice and data communication over modem for a computer-based multifunction personal communications system |
US5757801A (en) | 1994-04-19 | 1998-05-26 | Multi-Tech Systems, Inc. | Advanced priority statistical multiplexer |
US5764628A (en) | 1993-01-08 | 1998-06-09 | Muti-Tech Systemns, Inc. | Dual port interface for communication between a voice-over-data system and a conventional voice system |
US5787087A (en) * | 1995-10-11 | 1998-07-28 | Visser; John A. | Method and apparatus for interconnecting a plurality of terminal equipments to the ISDN |
US5805570A (en) * | 1995-05-02 | 1998-09-08 | Merge Technologies Group, Inc. | Method of simulating an ISDN-BRI central office switch using a single microcomputer |
US5812534A (en) | 1993-01-08 | 1998-09-22 | Multi-Tech Systems, Inc. | Voice over data conferencing for a computer-based personal communications system |
US5815503A (en) | 1993-01-08 | 1998-09-29 | Multi-Tech Systems, Inc. | Digital simultaneous voice and data mode switching control |
US5864560A (en) | 1993-01-08 | 1999-01-26 | Multi-Tech Systems, Inc. | Method and apparatus for mode switching in a voice over data computer-based personal communications system |
US5938735A (en) * | 1997-10-21 | 1999-08-17 | Ricoh Company, Ltd. | System for establishing optimized ISDN communication by identifying common communication attributes of destination and source terminals prior to establishing communication link therebetween |
US6009082A (en) | 1993-01-08 | 1999-12-28 | Multi-Tech Systems, Inc. | Computer-based multifunction personal communication system with caller ID |
EP0782351A3 (en) * | 1995-12-29 | 2000-02-02 | AT&T Corp. | Communications network with global event based trunk allocation system |
US6157647A (en) * | 1996-11-06 | 2000-12-05 | 3Com Corporation | Direct addressing between VLAN subnets |
US6169728B1 (en) * | 1996-03-29 | 2001-01-02 | Motorola Inc. | Apparatus and method for spectrum management in a multipoint communication system |
WO2001031842A2 (en) * | 1999-10-26 | 2001-05-03 | Telefonaktiebolaget Lm Ericsson (Publ) | System and method for improved resource management in an integrated telecommunications network having a packet-switched network portion and a circuit-switched network portion |
US6253247B1 (en) * | 1996-11-21 | 2001-06-26 | Ragula Systems | System and method for transmitting a user's data packets concurrently over different telephone lines between two computer networks |
US20010007550A1 (en) * | 2000-01-06 | 2001-07-12 | Phan Cao Thanh | Management method for maintaining communications options within a private communications network |
US6269095B1 (en) | 1998-02-04 | 2001-07-31 | Siemens Information And Communication Networks, Inc. | B-channel synchronization for G 723 1 vocoding |
US6327361B1 (en) | 1998-07-13 | 2001-12-04 | Lucent Technologies Inc. | Multivariate rate-based overload control for multiple-class communications traffic |
US6389493B1 (en) * | 1999-06-29 | 2002-05-14 | Cisco Technology, Inc. | System and method for dynamically allocating bandwidth to a plurality of slave cards coupled to a bus |
US6400708B1 (en) | 1998-09-28 | 2002-06-04 | Verizon Services Corp. | D-channel voice communications |
US20020080826A1 (en) * | 2000-12-23 | 2002-06-27 | Alcatel | Method for improving the transmission quality of information offered from the internet |
US6418132B1 (en) | 1997-05-15 | 2002-07-09 | Nec Corporation | Multi-directional multiplex communication system and ISDN servicing method therein |
US20030128715A1 (en) * | 1999-03-15 | 2003-07-10 | Satish D. Deo | Multi-service architecture with any port any servivice (apas) hardware platform |
US6597907B1 (en) * | 2000-05-05 | 2003-07-22 | Ericsson Inc. | Detection of a deadlocked resource condition in a pool of shared resources |
US6668283B1 (en) * | 1999-05-21 | 2003-12-23 | Cisco Technology, Inc. | ISDN B-channel count limitation |
US6728771B2 (en) * | 1998-03-20 | 2004-04-27 | Siemens Information And Communication Networks, Inc. | Generic transport option for transporting messages in relay or broadcast mode via combinations of ISDN B-channels or D-channels |
US20040088426A1 (en) * | 1997-03-31 | 2004-05-06 | Brewer Jason M. | Interconnected ethernet and 1394 network |
US20050124350A1 (en) * | 2002-03-12 | 2005-06-09 | Ascom Ag | Radio resource allocation in a radio communication network |
US6985477B2 (en) * | 1998-03-26 | 2006-01-10 | Cisco Technology, Inc. | Method and apparatus for supporting multiservice digital signal processing applications |
US7042905B1 (en) * | 1999-05-04 | 2006-05-09 | Sprint Communications Company L.P. | Broadband wireless communication system |
US20060198385A1 (en) * | 2005-03-01 | 2006-09-07 | Intel Corporation | Method and apparatus to prioritize network traffic |
US20070093124A1 (en) * | 2005-10-20 | 2007-04-26 | Lsi Logic Corporation | Methods and structure for SAS expander optimization of SAS wide ports |
US7301933B1 (en) | 2000-12-22 | 2007-11-27 | Cisco Technology, Inc. | Delivery of a service program to a digital signal processor within a multiservice processing system |
US7324452B2 (en) | 2002-01-14 | 2008-01-29 | Fujitsu Limited | Weighted credit-based arbitration using credit history |
US20080056122A1 (en) * | 2006-08-30 | 2008-03-06 | Madhi Nambi K | Method and system of transmit load balancing across multiple physical ports |
US7360244B2 (en) | 1996-02-06 | 2008-04-15 | Graphon Corporation | Method for authenticating a user access request |
US7385963B1 (en) * | 2000-11-28 | 2008-06-10 | Genband Inc. | System and method for communicating telecommunication information from a telecommunication network to a broadband network |
US7424737B2 (en) | 1996-10-17 | 2008-09-09 | Graphon Corporation | Virtual host for protocol transforming traffic traversing between an IP-compliant source and non-IP compliant destination |
US7539745B1 (en) * | 2001-12-11 | 2009-05-26 | Emc Corporation | Network management for replication of data stored in a data storage environment |
US20100146170A1 (en) * | 2008-12-09 | 2010-06-10 | International Business Machines Corporation | Differentiating Traffic Types in a Multi-Root PCI Express Environment |
US7738449B2 (en) | 1999-07-16 | 2010-06-15 | Genband Inc. | Method and apparatus for providing voice signals to and from a telecommunications switch |
US20100165874A1 (en) * | 2008-12-30 | 2010-07-01 | International Business Machines Corporation | Differentiating Blade Destination and Traffic Types in a Multi-Root PCIe Environment |
US7827136B1 (en) | 2001-09-20 | 2010-11-02 | Emc Corporation | Management for replication of data stored in a data storage environment including a system and method for failover protection of software agents operating in the environment |
US20110090796A1 (en) * | 1999-12-30 | 2011-04-21 | Avaya Inc. | ADAPTIVELY MAINTAINING QUALITY OF SERVICE (QoS) IN DISTRIBUTED PBX NETWORKS |
US7990984B2 (en) | 2000-11-28 | 2011-08-02 | Genband Us Llc | System and method for communicating telecommunication information between a broadband network and a telecommunication network |
US7990882B1 (en) | 1999-12-30 | 2011-08-02 | Avaya Inc. | Adaptively maintaining quality of service (QoS) in distributed PBX networks |
US8005978B1 (en) * | 2002-03-01 | 2011-08-23 | Cisco Technology, Inc. | Method to optimize the load balancing of parallel coprocessors |
US8117298B1 (en) | 1996-02-26 | 2012-02-14 | Graphon Corporation | Multi-homed web server |
US8396052B1 (en) * | 2000-07-20 | 2013-03-12 | Alcatel Lucent | Apparatus and method for synchronous and asynchronous switching of internet protocol traffic |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4556972A (en) * | 1983-12-27 | 1985-12-03 | At&T Bell Laboratories | Arrangement for routing data packets through a circuit switch |
US4677616A (en) * | 1985-09-11 | 1987-06-30 | At&T Company | Flow control scheme for a switching network |
US4799219A (en) * | 1986-08-27 | 1989-01-17 | International Business Machines Corp. | Pseudo synchronous transport mechanism in a communication network |
US4993024A (en) * | 1987-05-26 | 1991-02-12 | L'etat Francais Represente Par Le Ministre Des Ptt Centre National D'etudes Des Telecommunications 5Cnet | System and process for controlling the flow of either data packets or channel signals in an asynchronous time multiplexer |
US5012469A (en) * | 1988-07-29 | 1991-04-30 | Karamvir Sardana | Adaptive hybrid multiple access protocols |
US5165021A (en) * | 1991-01-18 | 1992-11-17 | Racal-Datacom, Inc. | Transmit queue with loadsheding |
-
1991
- 1991-05-24 US US08/094,115 patent/US5479407A/en not_active Expired - Lifetime
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4556972A (en) * | 1983-12-27 | 1985-12-03 | At&T Bell Laboratories | Arrangement for routing data packets through a circuit switch |
US4677616A (en) * | 1985-09-11 | 1987-06-30 | At&T Company | Flow control scheme for a switching network |
US4799219A (en) * | 1986-08-27 | 1989-01-17 | International Business Machines Corp. | Pseudo synchronous transport mechanism in a communication network |
US4993024A (en) * | 1987-05-26 | 1991-02-12 | L'etat Francais Represente Par Le Ministre Des Ptt Centre National D'etudes Des Telecommunications 5Cnet | System and process for controlling the flow of either data packets or channel signals in an asynchronous time multiplexer |
US5012469A (en) * | 1988-07-29 | 1991-04-30 | Karamvir Sardana | Adaptive hybrid multiple access protocols |
US5165021A (en) * | 1991-01-18 | 1992-11-17 | Racal-Datacom, Inc. | Transmit queue with loadsheding |
Cited By (85)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5754589A (en) | 1993-01-08 | 1998-05-19 | Multi-Tech Systems, Inc. | Noncompressed voice and data communication over modem for a computer-based multifunction personal communications system |
US5617423A (en) | 1993-01-08 | 1997-04-01 | Multi-Tech Systems, Inc. | Voice over data modem with selectable voice compression |
US6009082A (en) | 1993-01-08 | 1999-12-28 | Multi-Tech Systems, Inc. | Computer-based multifunction personal communication system with caller ID |
US5600649A (en) | 1993-01-08 | 1997-02-04 | Multi-Tech Systems, Inc. | Digital simultaneous voice and data modem |
US5864560A (en) | 1993-01-08 | 1999-01-26 | Multi-Tech Systems, Inc. | Method and apparatus for mode switching in a voice over data computer-based personal communications system |
US5815503A (en) | 1993-01-08 | 1998-09-29 | Multi-Tech Systems, Inc. | Digital simultaneous voice and data mode switching control |
US5673257A (en) | 1993-01-08 | 1997-09-30 | Multi-Tech Systems, Inc. | Computer-based multifunction personal communication system |
US5764627A (en) | 1993-01-08 | 1998-06-09 | Multi-Tech Systems, Inc. | Method and apparatus for a hands-free speaker phone |
US5812534A (en) | 1993-01-08 | 1998-09-22 | Multi-Tech Systems, Inc. | Voice over data conferencing for a computer-based personal communications system |
US5790532A (en) | 1993-01-08 | 1998-08-04 | Multi-Tech Systems, Inc. | Voice over video communication system |
US5764628A (en) | 1993-01-08 | 1998-06-09 | Muti-Tech Systemns, Inc. | Dual port interface for communication between a voice-over-data system and a conventional voice system |
US5673268A (en) | 1993-01-08 | 1997-09-30 | Multi-Tech Systems, Inc. | Modem resistant to cellular dropouts |
US5592586A (en) | 1993-01-08 | 1997-01-07 | Multi-Tech Systems, Inc. | Voice compression system and method |
US5577041A (en) | 1993-01-08 | 1996-11-19 | Multi-Tech Systems, Inc. | Method of controlling a personal communication system |
US5574861A (en) * | 1993-12-21 | 1996-11-12 | Lorvig; Don | Dynamic allocation of B-channels in ISDN |
US6570891B1 (en) | 1994-04-19 | 2003-05-27 | Multi-Tech Systems, Inc. | Advanced priority statistical multiplexer |
US5682386A (en) | 1994-04-19 | 1997-10-28 | Multi-Tech Systems, Inc. | Data/voice/fax compression multiplexer |
US5757801A (en) | 1994-04-19 | 1998-05-26 | Multi-Tech Systems, Inc. | Advanced priority statistical multiplexer |
US6515984B1 (en) | 1994-04-19 | 2003-02-04 | Multi-Tech Systems, Inc. | Data/voice/fax compression multiplexer |
US6275502B1 (en) | 1994-04-19 | 2001-08-14 | Multi-Tech Systems, Inc. | Advanced priority statistical multiplexer |
US6151333A (en) | 1994-04-19 | 2000-11-21 | Multi-Tech Systems, Inc. | Data/voice/fax compression multiplexer |
US5724356A (en) * | 1995-04-28 | 1998-03-03 | Multi-Tech Systems, Inc. | Advanced bridge/router local area network modem node |
US5805570A (en) * | 1995-05-02 | 1998-09-08 | Merge Technologies Group, Inc. | Method of simulating an ISDN-BRI central office switch using a single microcomputer |
US5675732A (en) * | 1995-05-08 | 1997-10-07 | Lucent Technologies Inc. | Dynamic channel assignment for TCP/IP data transmitted via cable television channels by managing the channels as a single sub network |
US5787087A (en) * | 1995-10-11 | 1998-07-28 | Visser; John A. | Method and apparatus for interconnecting a plurality of terminal equipments to the ISDN |
EP0782351A3 (en) * | 1995-12-29 | 2000-02-02 | AT&T Corp. | Communications network with global event based trunk allocation system |
US5878042A (en) * | 1996-02-06 | 1999-03-02 | Siemens Aktiengesellschaft | Method for the transmission of signals in time division multiplex channel form via an ATM transmission device |
US7360244B2 (en) | 1996-02-06 | 2008-04-15 | Graphon Corporation | Method for authenticating a user access request |
US7380273B2 (en) | 1996-02-06 | 2008-05-27 | Graphon Corporation | Method for authenticating a user access request |
FR2744580A1 (en) * | 1996-02-06 | 1997-08-08 | Siemens Ag | METHOD FOR TRANSMITTING DIGITAL SIGNALS IN THE FORM OF TIME-MULTIPLEXED CHANNELS VIA AN ATM TRANSMISSION DEVICE |
US8346890B1 (en) | 1996-02-26 | 2013-01-01 | Graphon Corporation | Multi-homed web server with compiled animation server |
US8370453B1 (en) | 1996-02-26 | 2013-02-05 | Graphon Corporation | Modular multi-homed web server with compiled animation server |
US8117298B1 (en) | 1996-02-26 | 2012-02-14 | Graphon Corporation | Multi-homed web server |
US8346861B1 (en) | 1996-02-26 | 2013-01-01 | Graphon Corporation | Web server with animation player |
US8364754B1 (en) | 1996-02-26 | 2013-01-29 | Graphon Corporation | Multi-homed web server with compiled animation server and programmable functionality |
US8359368B1 (en) | 1996-02-26 | 2013-01-22 | Graphon Corporation | Multi-homed web server with animation player |
US8370476B1 (en) | 1996-02-26 | 2013-02-05 | Graphon Corporation | Modular multi-homed web server with animation player |
US8356073B1 (en) | 1996-02-26 | 2013-01-15 | Graphon Corporation | Multi-homed web server with animation player and programmable functionality |
US6169728B1 (en) * | 1996-03-29 | 2001-01-02 | Motorola Inc. | Apparatus and method for spectrum management in a multipoint communication system |
US5754786A (en) * | 1996-09-13 | 1998-05-19 | At&T Corp | System and method for integrated overload control and message distribution |
US7424737B2 (en) | 1996-10-17 | 2008-09-09 | Graphon Corporation | Virtual host for protocol transforming traffic traversing between an IP-compliant source and non-IP compliant destination |
US6157647A (en) * | 1996-11-06 | 2000-12-05 | 3Com Corporation | Direct addressing between VLAN subnets |
US6253247B1 (en) * | 1996-11-21 | 2001-06-26 | Ragula Systems | System and method for transmitting a user's data packets concurrently over different telephone lines between two computer networks |
US7254131B2 (en) * | 1997-03-31 | 2007-08-07 | Texas Instruments Incorporated | Interconnected Ethernet and 1394 network |
US20040088426A1 (en) * | 1997-03-31 | 2004-05-06 | Brewer Jason M. | Interconnected ethernet and 1394 network |
US6418132B1 (en) | 1997-05-15 | 2002-07-09 | Nec Corporation | Multi-directional multiplex communication system and ISDN servicing method therein |
US5938735A (en) * | 1997-10-21 | 1999-08-17 | Ricoh Company, Ltd. | System for establishing optimized ISDN communication by identifying common communication attributes of destination and source terminals prior to establishing communication link therebetween |
US6269095B1 (en) | 1998-02-04 | 2001-07-31 | Siemens Information And Communication Networks, Inc. | B-channel synchronization for G 723 1 vocoding |
US6728771B2 (en) * | 1998-03-20 | 2004-04-27 | Siemens Information And Communication Networks, Inc. | Generic transport option for transporting messages in relay or broadcast mode via combinations of ISDN B-channels or D-channels |
US6985477B2 (en) * | 1998-03-26 | 2006-01-10 | Cisco Technology, Inc. | Method and apparatus for supporting multiservice digital signal processing applications |
US6327361B1 (en) | 1998-07-13 | 2001-12-04 | Lucent Technologies Inc. | Multivariate rate-based overload control for multiple-class communications traffic |
US6400708B1 (en) | 1998-09-28 | 2002-06-04 | Verizon Services Corp. | D-channel voice communications |
US20030128715A1 (en) * | 1999-03-15 | 2003-07-10 | Satish D. Deo | Multi-service architecture with any port any servivice (apas) hardware platform |
US6975632B2 (en) | 1999-03-15 | 2005-12-13 | Cisco Technology, Inc. | Multi-service architecture with any port any service (APAS) hardware platform |
US7042905B1 (en) * | 1999-05-04 | 2006-05-09 | Sprint Communications Company L.P. | Broadband wireless communication system |
US6668283B1 (en) * | 1999-05-21 | 2003-12-23 | Cisco Technology, Inc. | ISDN B-channel count limitation |
US6389493B1 (en) * | 1999-06-29 | 2002-05-14 | Cisco Technology, Inc. | System and method for dynamically allocating bandwidth to a plurality of slave cards coupled to a bus |
US7738449B2 (en) | 1999-07-16 | 2010-06-15 | Genband Inc. | Method and apparatus for providing voice signals to and from a telecommunications switch |
WO2001031842A2 (en) * | 1999-10-26 | 2001-05-03 | Telefonaktiebolaget Lm Ericsson (Publ) | System and method for improved resource management in an integrated telecommunications network having a packet-switched network portion and a circuit-switched network portion |
WO2001031842A3 (en) * | 1999-10-26 | 2001-12-13 | Ericsson Telefon Ab L M | System and method for improved resource management in an integrated telecommunications network having a packet-switched network portion and a circuit-switched network portion |
US8477602B2 (en) | 1999-12-30 | 2013-07-02 | Avaya Inc. | Adaptively maintaining quality of service (QoS) in distributed PBX networks |
US7990882B1 (en) | 1999-12-30 | 2011-08-02 | Avaya Inc. | Adaptively maintaining quality of service (QoS) in distributed PBX networks |
US20110090796A1 (en) * | 1999-12-30 | 2011-04-21 | Avaya Inc. | ADAPTIVELY MAINTAINING QUALITY OF SERVICE (QoS) IN DISTRIBUTED PBX NETWORKS |
US20010007550A1 (en) * | 2000-01-06 | 2001-07-12 | Phan Cao Thanh | Management method for maintaining communications options within a private communications network |
US7079484B2 (en) * | 2000-01-06 | 2006-07-18 | Alcatel | Management method for maintaining communications options within a private communications network |
US6597907B1 (en) * | 2000-05-05 | 2003-07-22 | Ericsson Inc. | Detection of a deadlocked resource condition in a pool of shared resources |
US8396052B1 (en) * | 2000-07-20 | 2013-03-12 | Alcatel Lucent | Apparatus and method for synchronous and asynchronous switching of internet protocol traffic |
US7990984B2 (en) | 2000-11-28 | 2011-08-02 | Genband Us Llc | System and method for communicating telecommunication information between a broadband network and a telecommunication network |
US7385963B1 (en) * | 2000-11-28 | 2008-06-10 | Genband Inc. | System and method for communicating telecommunication information from a telecommunication network to a broadband network |
US7301933B1 (en) | 2000-12-22 | 2007-11-27 | Cisco Technology, Inc. | Delivery of a service program to a digital signal processor within a multiservice processing system |
US20020080826A1 (en) * | 2000-12-23 | 2002-06-27 | Alcatel | Method for improving the transmission quality of information offered from the internet |
US7827136B1 (en) | 2001-09-20 | 2010-11-02 | Emc Corporation | Management for replication of data stored in a data storage environment including a system and method for failover protection of software agents operating in the environment |
US7539745B1 (en) * | 2001-12-11 | 2009-05-26 | Emc Corporation | Network management for replication of data stored in a data storage environment |
US7324452B2 (en) | 2002-01-14 | 2008-01-29 | Fujitsu Limited | Weighted credit-based arbitration using credit history |
US8005978B1 (en) * | 2002-03-01 | 2011-08-23 | Cisco Technology, Inc. | Method to optimize the load balancing of parallel coprocessors |
US20050124350A1 (en) * | 2002-03-12 | 2005-06-09 | Ascom Ag | Radio resource allocation in a radio communication network |
US7483377B2 (en) * | 2005-03-01 | 2009-01-27 | Intel Corporation | Method and apparatus to prioritize network traffic |
US20060198385A1 (en) * | 2005-03-01 | 2006-09-07 | Intel Corporation | Method and apparatus to prioritize network traffic |
US20070093124A1 (en) * | 2005-10-20 | 2007-04-26 | Lsi Logic Corporation | Methods and structure for SAS expander optimization of SAS wide ports |
US20080056122A1 (en) * | 2006-08-30 | 2008-03-06 | Madhi Nambi K | Method and system of transmit load balancing across multiple physical ports |
US7855957B2 (en) * | 2006-08-30 | 2010-12-21 | Hewlett-Packard Development Company, L.P. | Method and system of transmit load balancing across multiple physical ports |
US20100146170A1 (en) * | 2008-12-09 | 2010-06-10 | International Business Machines Corporation | Differentiating Traffic Types in a Multi-Root PCI Express Environment |
US7913024B2 (en) * | 2008-12-09 | 2011-03-22 | International Business Machines Corporation | Differentiating traffic types in a multi-root PCI express environment |
US8144582B2 (en) | 2008-12-30 | 2012-03-27 | International Business Machines Corporation | Differentiating blade destination and traffic types in a multi-root PCIe environment |
US20100165874A1 (en) * | 2008-12-30 | 2010-07-01 | International Business Machines Corporation | Differentiating Blade Destination and Traffic Types in a Multi-Root PCIe Environment |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5479407A (en) | Channel utilization method and system for ISDN | |
US5442630A (en) | ISDN interfacing of local area networks | |
US5444703A (en) | ISDN interfacing of personal computers | |
US5574861A (en) | Dynamic allocation of B-channels in ISDN | |
EP0503207B1 (en) | Adaptation device and method for efficient interconnection of data processing devices and networks | |
US6807185B1 (en) | System and method for signalling and call processing for private and hybrid communications systems including multimedia systems | |
US6292482B2 (en) | Systems and methods for multiple mode voice and data communications using intelligently bridged TDM and packet buses | |
US5594732A (en) | Bridging and signalling subsystems and methods for private and hybrid communications systems including multimedia systems | |
US6535505B1 (en) | Method and apparatus for providing a time-division multiplexing (TDM) interface among a high-speed data stream and multiple processors | |
US8126009B2 (en) | Method and apparatus for providing ringing timeout disconnect supervision in remote telephone extensions using voice over packet-data-network systems (VOPS) | |
US8144729B2 (en) | Systems and methods for multiple mode voice and data communications using intelligently bridged TDM and packet buses | |
US6977898B1 (en) | Method for supporting high priority calls on a congested WAN link | |
WO1992021188A1 (en) | Channel utilization method and system for isdn | |
US6009093A (en) | Apparatus and method for interfacing private exchange to integrated services digital network | |
US7009962B1 (en) | Method and apparatus for providing forwarding on ring-no-answer for remote telephone extensions using voice over packet-data-network systems (VOPS) | |
WO1992021185A1 (en) | Isdn interfacing of personal computers | |
WO1992021189A1 (en) | Isdn interfacing of local area networks | |
CA2109632C (en) | Channel utilization method and system for isdn | |
CA2109634C (en) | Isdn interfacing of personal computers | |
CA2109633C (en) | Isdn interfacing of local area networks | |
WO1992021186A1 (en) | Method of and system for accessing distributed resources on isdn | |
Cisco | Configuration Guide | |
Cisco | Configuration Guide | |
Cisco | Configuration Guide | |
US6560244B1 (en) | Subscriber network terminal of an access line network and method for operating a network connecting unit |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STPP | Information on status: patent application and granting procedure in general |
Free format text: APPLICATION UNDERGOING PREEXAM PROCESSING |
|
FEPP | Fee payment procedure |
Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
REMI | Maintenance fee reminder mailed | ||
FPAY | Fee payment |
Year of fee payment: 4 |
|
SULP | Surcharge for late payment | ||
FPAY | Fee payment |
Year of fee payment: 8 |
|
FPAY | Fee payment |
Year of fee payment: 12 |
|
AS | Assignment |
Owner name: BELL ATLANTIC NETWORK SERVICES, INC., VIRGINIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HSU, MEICHUN;CUMMINGS, PAUL;GAGLIARDI, UGO O.;AND OTHERS;SIGNING DATES FROM 19890320 TO 19890508;REEL/FRAME:028978/0332 |
|
AS | Assignment |
Owner name: VERIZON SERVICES CORP., VIRGINIA Free format text: CHANGE OF NAME;ASSIGNOR:BELL ATLANTIC NETWORK SERVICES, INC.;REEL/FRAME:032761/0226 Effective date: 20000801 |
|
AS | Assignment |
Owner name: VERIZON PATENT AND LICENSING INC., NEW JERSEY Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:VERIZON SERVICES CORP.;REEL/FRAME:032851/0319 Effective date: 20140409 |