US20040105443A1 - Distributed virtual path - Google Patents
Distributed virtual path Download PDFInfo
- Publication number
- US20040105443A1 US20040105443A1 US10/722,230 US72223003A US2004105443A1 US 20040105443 A1 US20040105443 A1 US 20040105443A1 US 72223003 A US72223003 A US 72223003A US 2004105443 A1 US2004105443 A1 US 2004105443A1
- Authority
- US
- United States
- Prior art keywords
- network element
- virtual path
- network
- virtual
- distributed virtual
- 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.)
- Abandoned
Links
Images
Classifications
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/64—Hybrid switching systems
- H04L12/6418—Hybrid transport
- H04L2012/6432—Topology
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention that provides a network topology for an ATM network. The topology includes a source network element, at least one intermediate network element, and a distributed virtual path connecting the source network element and the intermediate network elements. The distributed virtual path includes a virtual circuit that originates from the source network element and a virtual circuit that originates from at least one of the intermediate network elements. The distributed virtual path originates from the source network element and may terminate on a destination network element or on the source network element (thereby forming a ring). The network elements may be, for example, computers, satellites or other communications devices.
Description
- The present invention generally relates to asynchronous transfer mode (ATM) networks. In particular, the present invention relates to ATM networks that allow new virtual circuits to be introduced into virtual paths at intermediate network elements rather than only at a source network element.
- ATM networks can provide substantial performance increases over more traditional time division multiplexing (TDM) networks (also known as synchronous transfer mode or STM networks). This is especially true when the networks must carry many different types of information (e.g., data, voice, and video). Information travelling over an ATM network is coded into 53-byte cells. The first 5 bytes of each cell are the cell header and contain important information about the cell, including the routing information (i.e., destination address) for the cell.
- One of the main concepts of the ATM protocol is the virtual path. A virtual path represents a set of physical connections assigned to carry cells that share higher-order address bits. Virtual paths contain one or more virtual circuits. A virtual circuit represents a set of physical connections assigned to carry cells that share lower-order address bits. A virtual path may generally be thought of as a bundle of one or more virtual circuits.
- Another important concept within the ATM protocol is the quality of service (QoS). A QoS class defines parameters that represent a minimal level of network performance for the traffic carried by links that are designated as providing that particular QoS. Thus, for any two network elements within a network, there may need to be as many links (virtual paths and virtual circuits) set up between them as there are QoS classes defined for that network.
- When performing bandwidth allocation, network elements within an ATM network will perform statistical multiplexing with respect to a given virtual path. That is, bandwidth allocation is performed using statistical probabilities determined from historic usage information. The statistical multiplexing performance of a given network element is inversely proportional to the number of virtual paths incident upon that network element. Put another way, as bandwidth fragmentation increases at a given network element, the statistical multiplexing ability of that network element decreases.
- FIG. 1 shows an arrangement of virtual paths within an
ATM network 100 connectingnetwork elements virtual paths - The
virtual paths source network element 102 and each of the possibledestination network elements 104, 106 and 108. After a virtual path, such as thevirtual path 114, leaves a source network element, such as thenetwork element 102, it may pass through one or more intermediate network elements, such as thenetwork elements 104 and 106, as it continues to a destination network element, such as the network element 108. - Note that a network element may be an intermediate network element with respect to some virtual paths, but not with respect to other virtual paths. A network element is an intermediate network element with respect to a virtual path if that virtual path passes through that network element but does not originate or terminate at that network element. In the past, the intermediate network elements only switched virtual paths that passed through them. In other words, in past ATM networks the intermediate network elements did not add or remove virtual circuits to virtual paths.
- Consider data originating at the
network element 102. In order to send data from thenetwork element 102 to any of the other three network elements shown in FIG. 1, there must be three virtual paths defined. The firstvirtual path 110 begins at thenetwork element 102 and terminates at the network element 104 (it has no intermediate network elements). The secondvirtual path 112 begins at thenetwork element 102, passes through network element 104 (which is an intermediate network element with respect to this virtual path), and then terminates at the network element 106. The thirdvirtual path 114 begins at thenetwork element 102, passes through thenetwork elements 104 and 106 (both of which are intermediate network elements with respect to this virtual path), and then terminates at the network element 108. Each of thevirtual paths destination network elements 104, 106 and 108 (respectively) to thesource network element 102. - In this scheme, bandwidth management may be handled by the source network element of the virtual path (for example the
network element 102 with respect to the virtual path 114). This may be done because thesource network element 102 knows how much of the bandwidth assigned to thevirtual path 114 is being used at any given time. Allowing the source network element to manage bandwidth provides for relatively simple bandwidth management. Alternatively, the destination network element of the virtual path may handle the bandwidth management (for example the network element 108 with respect to the virtual path 114). Allowing the destination network element 108 to manage bandwidth is slightly more complex because the destination network element 108 must signal backward to thesource network element 102 when thevirtual path 114 is carrying its maximum allotted bandwidth. This backward signaling would be necessary to prevent thesource network element 102 from sending more cells than may be received by the destination network element 108 over thevirtual path 114. - One problem with the conventional arrangement of virtual paths is the large number of virtual paths required to fully connect the network-elements within the network. The number of virtual paths required to fully connect the network elements using past ATM techniques is nonlinear, being given by X*(N*(N−1))/2, where X is the number of QoS classes defined for the network and N is the number of is network elements in the network. Even for moderately sized networks, where N may be on the order of one hundred, conventional arrangements of virtual paths may lead to a great deal of administrative complexity.
- Another problem created by past virtual path arrangements is the fragmentation of bandwidth among the many virtual paths. Given the large number of network elements to be interconnected (and assuming a uniform community of interest amongst network elements) each virtual path is allocated a relatively small amount of the total bandwidth. The effect is to greatly reduce the amount of statistical multiplexing possible by any network element. The number of virtual paths running between each pair of adjacent network elements is X*N*(N−1)/2. As a result, since each virtual path is allocated a relatively small amount of the bandwidth at any given network element, the ability of that network element to perform statistical multiplexing is greatly reduced.
- Yet another problem with past arrangements of virtual paths is inefficient call setup when the network elements are arranged in a ring topology. In order to set up a call between two network elements it is necessary to check bandwidth availability between each pair of network elements along the path from the source network element to the destination network element. This hop-by-hop approach to call setup is extremely inefficient.
- The presence of these and other problems in past arrangements of virtual paths within ATM networks demonstrates that a need has long existed for an improved arrangement of virtual paths within an ATM network.
- It is an object of the present invention to provide a new type of virtual path within an ATM network.
- Another object of the present invention is to reduce the number of virtual paths required to fully connect the network elements of an ATM network, thereby simplifying bandwidth allocation and network administration.
- Still another object of the present invention is to provide an arrangement of virtual paths within an ATM network that increases the effectiveness of statistical multiplexing within the network elements.
- Yet another object of the present invention is to provide an arrangement of virtual paths within an ATM network that simplifies call setup.
- One or more of the foregoing objects are met in whole or in part by a preferred embodiment of the present invention that provides a network topology for an ATM network. The topology includes a source network element, at least one intermediate network element, and a distributed virtual path connecting the source network element and the intermediate network elements. The distributed virtual path includes a virtual circuit that originates from the source network element and a virtual circuit that originates from at least one of the intermediate network elements. The distributed virtual path originates from the source network element and may terminate on a destination network element or on the source network element (thereby forming a ring). The network elements may be, for example, computers, satellites or other communications devices.
- FIG. 1 illustrates a schematic diagram of a conventional arrangement of virtual paths within an ATM network.
- FIG. 2 illustrates a schematic diagram of an arrangement of distributed virtual paths within an ATM network.
- FIG. 3 illustrates a schematic diagram of a second embodiment of an arrangement of distributed virtual paths within an ATM network.
- FIG. 2 shows an arrangement of virtual paths within an
ATM network 200 connectingnetwork elements Virtual circuits - Consider the DVP210, running from the
source network element 202 through theintermediate network elements source network element 202 to the destination network element 208. The DVP 210 differs from the traditional concept of a virtual path (discussed above in conjunction with FIG. 1), in that it allows theintermediate network elements source network element 202 to the destination network element 208. - To illustrate this important difference between a DVP and a traditional virtual path, consider the DVP210. Both the DVP 210 and a traditional virtual path may contain a virtual circuit analogous to the
virtual circuit 212. Thevirtual circuit 212 enters the DVP 210 at thesource network element 202 and leaves the DVP 210 at the destination network element 208. However, a traditional virtual path would not carry thevirtual circuits intermediate network elements virtual circuits - A second difference between the virtual path210 and a traditional virtual path is that the virtual path 210 is preferably unidirectional. In other words, traffic is generally not carried in a backward direction to a source network element, such as the
network element 202. The virtual path 210 may be considered to contain all traffic destined for the destination network element 208. - When a DVP is used, the destination network element, in this case the destination network element208 of the DVP 210, preferably handles bandwidth allocation. One primary reason is that the destination network element sees the full amount of traffic being carried by the virtual path is Allowing the destination network element of a DVP to manage bandwidth greatly reduces the number of virtual paths required to fully connect the network elements. The number of virtual paths required to fully connect a network using DVPs is X*N, where X is the number of QoS classes defined for the network and N is the number of network elements in the network. When using DVPs, the total number of virtual paths becomes a linear function of the number of network elements in the network.
- A significant improvement is thus realized over the second order relationship of previous virtual path arrangements. Even for moderately sized networks, where N may be on the order of one hundred, the use of DVPs provide a substantial reduction in the total number of virtual paths required for full connectivity. The reduction in the number of virtual paths greatly reduces the complexity of network administration.
- Furthermore, the use of DVPs decreases the number of virtual paths running between adjacent network elements. When using DVPs, the number of virtual paths running between each pair of adjacent network elements is X*(N−1). Each virtual path may therefore receive a greater portion of the available bandwidth and bandwidth fragmentation is greatly reduced. As discussed above, reduced bandwidth fragmentation improves the ability of each network element to perform statistical multiplexing.
- Furthermore, using DVPs may also increase the efficiency of call setup when the network elements are arranged in a ring. Since the terminal network element of a DVP has a view of all of the traffic destined for it, that network element knows the availability of the total bandwidth coming into it. Any network element that needs to send cells to the terminal network element may signal that terminal network element directly to determine if enough bandwidth is available to set up the call.
- Turning now to FIG. 3, that figure shows another embodiment of a
DVP 302 used within anATM network 300 to connectnetwork elements Virtual circuits - Consider the
virtual path 302, running from the source network element 304 through theintermediate network elements virtual path 302 carries virtual circuits that connect the source network element 304 to itself, for example,virtual circuit 312. Thevirtual path 302 differs from the traditional concept of a virtual path (discussed above in conjunction with FIG. 1), in that it allows theintermediate network elements intermediate network elements - Both the
DVP 302 and a traditional virtual path may contain a virtual circuit analogous to thevirtual circuit 312. Thevirtual circuit 312 enters theDVP 302 at the source network element 304 and leaves theDVP 302 at the source network element 304. However, a traditional virtual path cannot carry thevirtual circuits DVP 302 by theintermediate network elements virtual path 302 and from each other) are required to carry each of thevirtual circuits - In the embodiment shown in FIG. 3, the
DVP 302 starts and ends at the same network element, in this case the network element 304, forming a complete ring within the network. The complete ring arrangement allows the network element 304 to receive transmissions from theother network elements intermediate network elements toe DVP 302 to be received by the source network element 304. The ability of network elements to send OAM calls to each other and themselves provides a way to monitor network performance and localize problems (such as breaks in the ring) when such problems arise. - The present invention thus overcomes many limitations found in prior arrangements of virtual paths within an ATM network. The present invention provides for decreased administrative complexity. It also provides decreased bandwidth fragmentation, allowing for improved statistical multiplexing efficiency.
- While particular elements, embodiments and applications of the present invention have been shown and described, it will be understood, of course, that the invention is not limited thereto since modifications may be made by those skilled in the art, particularly in light of the foregoing teachings. It is therefore contemplated by the appended claims to cover such modifications as incorporate those features which come within the spirit and scope of the invention.
Claims (17)
1. A network topology for an ATM network, the network topology comprising:
a source network element;
at least one intermediate network element; and
a distributed virtual path connecting said source network element and said intermediate network elements, said distributed virtual path including a virtual circuit originating from said source network element and a virtual circuit originating from at least one of said intermediate network elements.
2. The network topology of claim 1 , wherein said distributed virtual path originates from said source network element and terminates at said source network element.
3. The network topology of claim 1 , wherein said distributed virtual path originates from said source network elements and terminates at a destination network element distinct from said source network element.
4. The network topology of claim 1 , wherein at least one of said network elements is a computer.
5. The network topology of claim 1 , wherein at least one of said network elements is a satellite.
6. The network topology of claim 3 , wherein said destination network element performs bandwidth allocation for said distributed virtual path.
7. The network topology of claim 1 , wherein said distributed virtual path is unidirectional.
8. A method of arranging distributed virtual paths within an ATM network, the method comprising:
establishing a source network element for a distributed virtual path;
establishing at least one intermediate network element for said distributed virtual path; and
connecting said source network element to at least one of said intermediate network elements using a distributed virtual path;
establishing a virtual circuit originating from said source network element; and
establishing a virtual circuit originating from at least one of said intermediate network elements.
9. The method of claim 8 , wherein the step of connecting further comprises:
connecting said distributed virtual path back to said source network element.
10. The method of claim 8 , the method further comprising:
establishing a destination network element for said distributed virtual path; and
terminating said distributed virtual path at said destination network element.
11. The method of claim 8 , wherein the step of connecting further comprises connecting to at least one computer.
12. The method of claim 8 , wherein the step of connecting further comprises connecting to at least one satellite.
13. The method of claim 11 , the method further comprising the step of:
performing bandwidth allocation for said distributed virtual path at said destination network element.
14. A distributed virtual path comprising:
a virtual path including a virtual circuit originating from a source network element and a virtual circuit originating from at least one intermediate network element.
15. The distributed virtual path of claim 14 , wherein said distributed virtual path originates from said source network element and terminates at said source network element.
16. The distributed virtual path of claim 14 , wherein said distributed virtual path originates from said source network elements and terminates at a destination network element distinct from said source network element.
17. The distributed virtual path of claim 14 , wherein said distributed virtual path is unidirectional.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/722,230 US20040105443A1 (en) | 1999-06-14 | 2003-11-25 | Distributed virtual path |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/332,491 US6721323B1 (en) | 1999-06-14 | 1999-06-14 | Distributed virtual path |
US10/722,230 US20040105443A1 (en) | 1999-06-14 | 2003-11-25 | Distributed virtual path |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/332,491 Continuation US6721323B1 (en) | 1999-06-14 | 1999-06-14 | Distributed virtual path |
Publications (1)
Publication Number | Publication Date |
---|---|
US20040105443A1 true US20040105443A1 (en) | 2004-06-03 |
Family
ID=32043054
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/332,491 Expired - Fee Related US6721323B1 (en) | 1999-06-14 | 1999-06-14 | Distributed virtual path |
US10/722,230 Abandoned US20040105443A1 (en) | 1999-06-14 | 2003-11-25 | Distributed virtual path |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/332,491 Expired - Fee Related US6721323B1 (en) | 1999-06-14 | 1999-06-14 | Distributed virtual path |
Country Status (1)
Country | Link |
---|---|
US (2) | US6721323B1 (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7023829B1 (en) * | 2000-06-01 | 2006-04-04 | Paradyne Corporation | Systems and methods for providing communication between an ATM layer device and multiple multi-channel physical layer devices |
US9112625B2 (en) | 2010-06-21 | 2015-08-18 | Guansong Zhang | Method and apparatus for emulating stream clock signal in asynchronous data transmission |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5150356A (en) * | 1990-07-27 | 1992-09-22 | Nec Corporation | Dual-ring atm communications system |
US5467349A (en) * | 1993-12-21 | 1995-11-14 | Trw Inc. | Address handler for an asynchronous transfer mode switch |
US5469428A (en) * | 1991-03-26 | 1995-11-21 | Nippon Telegraph And Telephone Corporation | Loop-back system in a dual ring network |
US5557611A (en) * | 1994-07-26 | 1996-09-17 | Cselt - Centro Studi E Laboratori Telecomunicazioni S.P.A. | ATM cross-connect node utilizing two passes through the connection network with shaping between passes for optimal resource allocation in a bursty environment |
US5583849A (en) * | 1993-09-27 | 1996-12-10 | Siemens Aktiengesellschaft | Method and circuit arrangement for transmitting message cells via virtual paths of an ATM communication system |
US5719866A (en) * | 1993-02-27 | 1998-02-17 | U.S. Philips Corporation | Local network operating in the asynchronous transfer mode (ATM) |
US5815490A (en) * | 1995-11-20 | 1998-09-29 | Nec America, Inc. | SDH ring high order path management |
US6563795B1 (en) * | 1995-04-11 | 2003-05-13 | Nortel Networks Limited | Method of tracing the root of virtual connections |
Family Cites Families (28)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5115427A (en) | 1990-03-30 | 1992-05-19 | At&T Bell Laboratories | Arrangements for switching multiple packet types combined in a single packet stream |
US5115426A (en) | 1990-03-30 | 1992-05-19 | At&T Bell Laboratories | Broadband isdn packet switching arrangements |
JPH04138739A (en) | 1990-09-28 | 1992-05-13 | Toshiba Corp | Communication control system using asynchronous transmission mode network |
DE69130853T2 (en) | 1990-11-21 | 1999-07-22 | At & T Corp | Bandwidth management and congestion protection for access to broadband ISDN networks |
GB9117172D0 (en) | 1991-08-08 | 1991-09-25 | British Telecomm | Communication system |
US5287347A (en) | 1992-06-11 | 1994-02-15 | At&T Bell Laboratories | Arrangement for bounding jitter in a priority-based switching system |
CA2104753C (en) | 1992-10-29 | 1999-02-16 | Kotikalapudi Sriram | Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband atm networks |
US5274643A (en) | 1992-12-11 | 1993-12-28 | Stratacom, Inc. | Method for optimizing a network having virtual circuit routing over virtual paths |
WO1994023517A1 (en) * | 1993-03-26 | 1994-10-13 | Curtin University Of Technology | Method and apparatus for managing the statistical multiplexing of data in digital communication networks |
CA2124379C (en) | 1993-06-25 | 1998-10-27 | Thomas F. La Porta | Distributed processing architecture for control of broadband and narrowband communications networks |
US5528763A (en) | 1993-09-14 | 1996-06-18 | International Business Machines Corporation | System for admitting cells of packets from communication network into buffer of attachment of communication adapter |
US5425101A (en) * | 1993-12-03 | 1995-06-13 | Scientific-Atlanta, Inc. | System and method for simultaneously authorizing multiple virtual channels |
US5473679A (en) | 1993-12-09 | 1995-12-05 | At&T Corp. | Signaling system for broadband communications networks |
US5392280A (en) | 1994-04-07 | 1995-02-21 | Mitsubishi Electric Research Laboratories, Inc. | Data transmission system and scheduling protocol for connection-oriented packet or cell switching networks |
FR2722929B1 (en) * | 1994-07-21 | 1996-08-23 | Boyer Pierre | FLOW RESERVATION IN SWITCHING NODES OF AN ASYNCHRONOUS NETWORK |
DE69532844T2 (en) * | 1994-08-31 | 2005-01-05 | Nippon Telegraph And Telephone Corp. | Method for communication network design and communication system |
US5548587A (en) | 1994-09-12 | 1996-08-20 | Efficient Networks, Inc. | Asynchronous transfer mode adapter for desktop applications |
US5539744A (en) | 1994-10-17 | 1996-07-23 | At&T Corp. | Hand-off management for cellular telephony |
US5517495A (en) | 1994-12-06 | 1996-05-14 | At&T Corp. | Fair prioritized scheduling in an input-buffered switch |
US5483527A (en) | 1994-12-21 | 1996-01-09 | At&T Corp. | Terminal adapter for interfacing an ATM network with a STM network |
FR2729025B1 (en) * | 1995-01-02 | 1997-03-21 | Europ Agence Spatiale | METHOD AND SYSTEM FOR TRANSMITTING RADIO SIGNALS VIA A SATELLITE NETWORK BETWEEN A FIXED EARTH STATION AND MOBILE USER TERMINALS |
US5544161A (en) | 1995-03-28 | 1996-08-06 | Bell Atlantic Network Services, Inc. | ATM packet demultiplexer for use in full service network having distributed architecture |
NL1001162C2 (en) * | 1995-09-08 | 1997-03-11 | Nederland Ptt | Communication system for interactive services with a packet-switched interaction channel over a narrow-band circuit-switched network, as well as a device for application in such a communication system. |
JPH09270804A (en) * | 1996-04-03 | 1997-10-14 | Toshiba Corp | Atm exchange |
US5953338A (en) * | 1996-12-13 | 1999-09-14 | Northern Telecom Limited | Dynamic control processes and systems for asynchronous transfer mode networks |
US6038594A (en) * | 1998-02-02 | 2000-03-14 | Loral Cyberstar, Inc. | Internet communication system and method with asymmetric terrestrial and satellite links |
US6538987B1 (en) * | 1999-03-25 | 2003-03-25 | Ciena Corporation | Rapid ring protection switching system |
US6295283B1 (en) * | 1999-05-11 | 2001-09-25 | Trw Inc. | Method for providing connectionless data services over a connection-oriented satellite network by associating IP subnets with downlink beam identifiers |
-
1999
- 1999-06-14 US US09/332,491 patent/US6721323B1/en not_active Expired - Fee Related
-
2003
- 2003-11-25 US US10/722,230 patent/US20040105443A1/en not_active Abandoned
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5150356A (en) * | 1990-07-27 | 1992-09-22 | Nec Corporation | Dual-ring atm communications system |
US5469428A (en) * | 1991-03-26 | 1995-11-21 | Nippon Telegraph And Telephone Corporation | Loop-back system in a dual ring network |
US5719866A (en) * | 1993-02-27 | 1998-02-17 | U.S. Philips Corporation | Local network operating in the asynchronous transfer mode (ATM) |
US5583849A (en) * | 1993-09-27 | 1996-12-10 | Siemens Aktiengesellschaft | Method and circuit arrangement for transmitting message cells via virtual paths of an ATM communication system |
US5467349A (en) * | 1993-12-21 | 1995-11-14 | Trw Inc. | Address handler for an asynchronous transfer mode switch |
US5557611A (en) * | 1994-07-26 | 1996-09-17 | Cselt - Centro Studi E Laboratori Telecomunicazioni S.P.A. | ATM cross-connect node utilizing two passes through the connection network with shaping between passes for optimal resource allocation in a bursty environment |
US6563795B1 (en) * | 1995-04-11 | 2003-05-13 | Nortel Networks Limited | Method of tracing the root of virtual connections |
US5815490A (en) * | 1995-11-20 | 1998-09-29 | Nec America, Inc. | SDH ring high order path management |
Also Published As
Publication number | Publication date |
---|---|
US6721323B1 (en) | 2004-04-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7359402B2 (en) | System and method for configuring bandwidth transmission rates for call connections | |
US7139270B1 (en) | Systems and method for transporting multiple protocol formats in a lightwave communication network | |
FI113932B (en) | Improvements to asynchronous transport mode networks for mobile communications | |
US6519257B1 (en) | ATM telecommunications systems and method for routing narrow band traffic | |
EP0753237B1 (en) | B-isdn access | |
EP0969690B1 (en) | System for consolidating telecommunications traffic | |
EP0543957A1 (en) | Connectionless switching for an atm switch | |
EP0967755B1 (en) | Packet data bandwidth control method in packet exchange network and packet exchange network system | |
US7548550B1 (en) | Intelligent peripheral concentrator | |
US6125118A (en) | ATM local access | |
US20070280268A1 (en) | ATM Telecommunications Systems and Method for Routingg Narrow Band Traffic | |
US6721323B1 (en) | Distributed virtual path | |
US6356564B1 (en) | Use of booking factors to redefine available bandwidth | |
US6529512B1 (en) | Statistical method of data compression and decompression | |
US6181688B1 (en) | System, device, and method for consolidating frame information into a minimum number of output links | |
JP3470079B2 (en) | How calls are routed | |
US5448557A (en) | ATM multiplexer/demultiplexer for use in an ATM switching system | |
US6785280B1 (en) | Mechanism and method dynamically allocating ATM connections between exchanges | |
EP0924952A2 (en) | Multi-layered architectures for communications networks | |
JP2794740B2 (en) | Network resource management method | |
US7483372B2 (en) | Communication network | |
AU641828B2 (en) | A method of transmitting data on a telecommunications network | |
JPH0522333A (en) | Connection control system in asynchronous transfer mode | |
Chang et al. | Fair Efficient Call Admission Control Policies for Heterogeneous Traffic Streams in a Packet Routing Server Using The DTM Technology | |
KR20020084517A (en) | Method for Resource Assignment with Grouping of Destination using ATM Adaption Layer 2 Protocol |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |