WO2001020829A1 - Method and apparatus for prevention of congestion in atm networks through atm protection switching - Google Patents

Method and apparatus for prevention of congestion in atm networks through atm protection switching

Info

Publication number
WO2001020829A1
WO2001020829A1 PCT/US2000/023498 US0023498W WO0120829A1 WO 2001020829 A1 WO2001020829 A1 WO 2001020829A1 US 0023498 W US0023498 W US 0023498W WO 0120829 A1 WO0120829 A1 WO 0120829A1
Authority
WO
WIPO (PCT)
Prior art keywords
traffic
congestion
network
fraction
switching
Prior art date
Application number
PCT/US2000/023498
Other languages
French (fr)
Inventor
Mihnea C. Nemes
Dhadesugoor R. Vaman
Dongsoo S. Kim
Original Assignee
Megaxess, Inc.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Megaxess, Inc. filed Critical Megaxess, Inc.
Priority to AU70785/00A priority Critical patent/AU7078500A/en
Publication of WO2001020829A1 publication Critical patent/WO2001020829A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/14Charging, metering or billing arrangements for data wireline or wireless communications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478Provisions for broadband connections
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5625Operations, administration and maintenance [OAM]
    • H04L2012/5627Fault tolerance and recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/5631Resource management and allocation
    • H04L2012/5636Monitoring or policing, e.g. compliance with allocated rate, corrective actions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651Priority, marking, classes

Definitions

  • the present invention generally relates to an automatic protection switching method for preventing congestion in an ATM network, and more particularly to a method that uses ATM protection switching to prevent congestion occurrence in ATM networks by treating the onset of congestion as network soft failures.
  • ATM network congestion control methods address the capacity of a network as a whole to carry the offered traffic.
  • flow control methods address the point to point communication between a sender and a receiver, by adapting the data rate of the sender to the data rate at which the receiver can process the traffic.
  • congestion control methods addresses the ability of a network to handle traffic, while flow control addresses the ability of the receiving devices to follow the speed of the transmitting devices.
  • congestion control methods have traditionally been categorized as part of traffic management. Therefore, congestion control methods used in the past have involved methods that rely on modifying or shaping the traffic at the traffic source, or at the network entrance point, in order to prevent or to handle congestion.
  • Typical congestion control techniques include "open loop” and "closed loop” methods.
  • Open loop methods are, by definition, measures that the network takes prior to servicing the traffic. These measures include decision mechanisms to accept or reject new traffic (Call Admission Control). These mechanisms rely on analyzing the network condition for a determined destination at the point of entrance in the network. Whenever a call setup request arrives at the network entrance point, the parameters specified in the call traffic contract are checked against the resource based on the traffic contracts of the accepted calls in the network. These open loop methods also include packet or cell discarding or tagging. If a traffic source does not conform to the traffic contract, the packets or cells belonging to that call are discarded, or if their priority is high, the cells are tagged and their priority is changed to a lower one. Open loop methods also include traffic shaping techniques (Leaky),
  • Bucket, Token Bucket that transform bursty traffic patterns into uniform traffic patterns.
  • Networks that transport bursty traffic are difficult to dimension, and therefore they are subject to experience congestion. If the traffic pattern is uniform, then the network can be dimensioned so that the risk of congestion diminishes.
  • Open loop methods are based on pre-dimensioning the network, and do not follow the dynamic changes in the network.
  • Closed loop methods are based on feedback received from the network. Closed loop techniques monitor the system to detect the time and location of congestion occurrence, convey the congestion notification to the parts of the system that can adjust the system operation, and ultimately, adjust the system operation. They include techniques that rely on notifying the congestion to the traffic source, which has to reduce the transmission rate for the congestion to be relieved (Source Rate Adaptation). Also included in closed loop methods are admission controls, which may be used in response to a state of network congestion, and which prevents any call from being accepted after the congested state is declared. Another closed loop method employs the use of additional bandwidth for new calls. This technique gives the possibility to offer additional bandwidth for the new calls that arrive at a congested point. This technique however, does not improve the state of the calls that are already routed through a congested path. Closed loop methods are reactive in the sense that they do not act until congestion is already in place, and therefore service degradations may occur.
  • the Recommendation 1.630 presents the architecture and protocol related to ATM layer protection switching. It recommends that ATM protection switching be used if failures or signal degradations are detected. 'Transparent Non-disruptible ATM Network," Vaman, et al.. U.S. Patent
  • QoS quality of service
  • the present invention provides a method and apparatus for preventing congestion from occurring in ATM networks by treating congestion as a soft network failure and taking preventative measures before congestion occurs to prevent service degregation and insure that quality of service is provided even when traffic grows beyond an acceptable limit on a particular route.
  • the invention uses closed loop and open loop methods for congestion control and utilizes protection switching mechanisms before congestion occurs.
  • the present invention monitors congestion based on traffic parameter monitoring, average parameter values computation, appropriate threshold setting and selective protective switching. When growth of traffic threatens the quality of service in particular segment of the network, protection on the affected route.
  • the fraction of traffic that is switched can be a virtual path, a group of virtual paths, or several virtual path groups.
  • the method comprises the steps of monitoring traffic parameters; computing the average growth of the traffic; comparing the average traffic growth with predetermined thresholds; executing selective protection switching processes when the average traffic growth exceed predetermined thresholds; executing selective protection switching by selecting the traffic fraction to be switched and switching the selected traffic fraction; monitoring the traffic parameters; and optionally returning to the original configuration if the traffic parameters return to normal values for a selected time.
  • This process can be implemented on a microprocessor or microcontroller platform with access to the traffic parameters, and with communication access to the switching fabric.
  • the process can be implemented in both hardware and software to be placed in existing and evolving network entities, or the apparatus can be a stand alone apparatus.
  • the elements of the apparatus include buffer management; network management; dynamic diversion of traffic; and integration to hitless, link and hard-node failure.
  • FIG. la is a graph of the instantaneous traffic load on the working path
  • FIG lb is a graph of the instantaneous traffic load on the protection path.
  • FIG. 2 is a graph of the behavior of a network where no congestion control methods are applied.
  • FIG. 3 is a graph of the behavior of a network that, upon congestion, stops accepting new calls.
  • FIG. 4 is a graph of the behavior of a network where additional capacity is provided when congestion becomes important.
  • FIG. 5 is a graph of the behavior of a network that implements the method of the present invention.
  • FIG. 6 is a flow chart of the steps comprising the method of the present invention.
  • FIG. 7 is a flow chart of the step of selecting an entity to be switched.
  • FIG. 8 is a flow chart of the steps involved in the function of selection of FIG. 7.
  • FIG. 9a and 9b show link utilization in a network before and after protection switching, respectively.
  • the present invention relates to a method for preventing congestion from occurring in ATM networks. This ensures that Quality of Service (QoS) is provided even when the traffic grows beyond an acceptable limit on a particular route.
  • QoS means that a user can send information over the network at a set rate that does not change.
  • protection switching according to the present invention is executed before the congestion occurs, all the measures are preventive and therefore, service degradation is prevented.
  • the invention can be used in connection with IP,
  • the method of the present invention is based on traffic parameter monitoring, average parameter values computation, appropriate threshold setting, and selective protection switching.
  • protection switching is executed selectively (i.e. just a fraction of the traffic is switched) to relieve the traffic on the affected routes.
  • the switched traffic is accommodated on pre-assigned protection paths that carry low priority (excess) traffic.
  • the fraction of the traffic that is switched can be a Virtual Path (VP), group of Virtual Paths or Virtual Path Group (VPG), or several Virtual Path Groups (VPGs).
  • the present invention is based on automated protection switching at the ATM layer. Protection switching is a process where an alternate path (protection path) is provided in addition to the path in use, whenever an impairment is detected on the path is use (working path).
  • the invention treats the onset of congestion in a network as a soft failure of the network entity where it occurs.
  • hard failures and soft failures can be treated in an integrated manner.
  • soft failures and in this case the onset of congestion
  • hard failures are addressed.
  • all the traffic that was carried on the affected path must be switched onto the protection path. In the case of congestion, there is no need to switch all the traffic on the protection path, but rather only a fraction of it.
  • the traffic can be grouped in VCs, VPs, and even VPGs, the fraction that can used for low priority traffic, and a spare capacity can always be reserved. The protection switching should occur only if the traffic switched would not overload or congest the protection path.
  • FIGS, la and b illustrates how protection switching relieves the working path by switching a fraction of the carried traffic onto the protection path.
  • FIG. la shows the instantaneous traffic on the working path
  • FIG. lb shows the instantaneous traffic on the protection path.
  • A, B, C Periods in time tO, tl : moments in time.
  • period A the traffic on the working path is above the safety threshold, but no actions are taken yet.
  • the traffic is crossing the congestion onset threshold. This starts the hold off timer.
  • the entire period B coincides with the hold off time.
  • protection switching is required. After selecting which fraction of the traffic will be switched to the protection path, the protection switching occurs. The goal is to bring the traffic on the working path below the safety threshold.
  • the traffic on the protection path increases with the amount of traffic switched from the working path. During this time no new calls are accepted on the working path.
  • FIGS. 2 - 4 depict the relationship between the traffic that enters in the network and the traffic that is delivered by the network for each technique presented. The following conventions are used:
  • FIG. 2 shows the behavior of a network where no congestion control without any problems.
  • the traffic load approaches the maximum capacity of the network, even as the number of packets is increasing, the number of delivered packets remains the same. This is evident in Region B. However, if the number of incoming packets is increasing still, then the network will be unable to process them and as a result, many packets will be lost and not delivered. This corresponds to the congested state and to Region C, where in this case the curve reaches far.
  • FIG. 3 shows the behavior of a network that upon congestion stops accepting new calls. Since the number of incoming packets in this case is bounded, the congestion does not become any worse, and therefore the curve does no go far in the congested state, which is represented by Region C.
  • FIG. 4 show the behavior of a network where additional capacity is provided when congestion becomes important. Regions A, B, and C are the same as in FIG. 2. While Curve 1 and Regions A, B, and C correspond to the operation of the system at normal capacity, Curve 2 and Region D correspond to the operation of the system with additional capacity. As FIG. 4 shows, the additional capacity is only offered after congestion has reached alarming proportions. Region D corresponds to a betterment of the network performance.
  • FIG. 5 shows the behavior of a network that implements the present invention.
  • Curve 1 corresponds to the operation of the network when only the working path is used. When the traffic goes beyond the onset of congestion threshold for a period longer than the hold-off time, protection switching is executed and the traffic on the working path falls below the safety threshold.
  • Curve 2 corresponds with the operation of the system when both working and protection paths are used. The boundary between Curve 1 and Curve 2 will fall statistically between thresholds 201 and 202.
  • Region A which corresponds with the optimal performance of the network, is larger than in all other cases presented, and it allows for a better packets delivered / incoming packets ratio when the number of incoming packets is larger. Limitation of the number of packets delivered occurs only at large numbers of incoming packets (Region B). Statistically, the traffic load on both paths does not go beyond the acceptable level, which assures the maintenance of QoS.
  • novel features of the invention include: i. Use of a closed loop following techniques, at the same time, to prevent congestion: increase of resources, and decrease of load on the affected route; and use of protection switching as a mechanism to prevent the occurrence of congestion.
  • Existing closed loop congestion control methods are reactive. The mechanisms are triggered after congestion has occurred. The present invention triggers the protection switching mechanisms before congestion has occurred.
  • the present invention uses both techniques at the same time, since by executing protection switching, more bandwidth becomes available to the service, and the load is also reduced on the affected route. This ensures the Service Level Agreement (SLA) maintenance on the affected route without dropping or reducing user traffic.
  • SLA Service Level Agreement
  • the protection switching is used against node or link failures. By extending its usage to congestion prevention and congestion relieving, failures and congestion can be treated in an integrated manner.
  • the method of the present invention comprises the following steps: monitoring traffic parameters; computing the average growth of the traffic; comparing the average traffic growth with pre-determined thresholds; executing selective protection switching processes when the average traffic growth exceeds predetermined thresholds; executing selective protection switching by selecting the traffic fraction to be switched and switching the selected traffic fraction; monitoring the traffic parameters and optionally returning to the original configuration if the traffic parameters return to normal values for a selected time period.
  • FIG. 6 shows the four steps or processes that are involved in the congestion prevention method of the present invention and the relationships among the steps. The following conventions are used: A,B,C,D - Processes;
  • Process "A” samples continuously the values of the traffic parameters that were chosen as a measure of congestion. Periodically, these values are passed to "B” writes periodically the statistics to the Shared Memory “E.” Also, if the parameters reach an alarm threshold, congestion prevention is triggered by launching
  • Process “C” selects a fraction of the traffic to be switched on the protection path, in order to relieve the working path.
  • Process “C” may select a VC, a VP or group of VPs, depending on whether protection switching is executed at the
  • the output of the selection process will indicate which VPG must be switched in order to relieve the working path.
  • the selected entity is a
  • Process "A” which relates to the traffic parameters measurement is an implementation issue as various traffic parameters could be used. Among the most used are the Buffer Occupancy, Link Utilization and Cell Loss Ratio (CLR). Process “B” involves simple arithmetical computations and is also implementation dependent. Process “D” represents a Protection Switching Process. Process “C” is explained below, using FIG. 7 as an illustration.
  • FIG. 7 illustrates the main functions of one of the four processes involved in congestion prevention, namely the Selection of the Entity to be switched (Process "C” in FIG. 6).
  • the Process reads the real time statistics that present the current state of the network (in the node where the process is executed). If the onset of congestion is detected, the process checks if protection switching is allowed. Protection switching may not be desired if the traffic load on the protection path is such that traffic cannot be accommodated from the working path, in which case the human operator (network manager) sets a variable to inhibit protection switching. If Protection switching is allowed, the selection process starts.
  • the selection process is implemented through a Function "Z.” Function "Z" analyzes all entities (services or bundles of services) that cross the point of onset of congestion.
  • the protection switching is executed for the selected entity. If after a determined interval of time or observation period, the real time statistics still show the onset of of traffic carrying entity. When the network load comes to a normal level for the observation period, the process is ended.
  • the priorities of the entities are established by the network operator.
  • An example of how the priorities could be assigned is as follows: Priority P0 (highest) -
  • P0 is assigned to the services that are most sensitive to network impairments. The integrity of the cell stream for these services has to be guaranteed. Therefore a condition may be imposed by the network operator so that the services in this category should not be switched upon onset of congestion. These services impose conditions that may or may not be fulfilled during the protection switching process.
  • Constant Bit Rate - CBR and real-time Variable Bit Rate - rtVBR impose restrictions both on the value of Cell Loss Ration (CLR) as well as the Cell Transfer Delay (CDT) or Cell Delay Variation (CDV).
  • CLR, CDT and CDV are all QoS Parameters and reflect the sensitivity of the service to cell losses and to cell delays.
  • Priority PI - In this example, PI is assigned to the services that are less sensitive to network impairments, but do require some degree of QoS assurance. These services could be non real-time Variable Bit Rate - nrtVBR or Available Bit Rate - ABR. These services impose restrictions on the CLR, but are not concerned with delays in the network. Protection switching may be allowed for these services, if there is a guarantee that the number of lost cells during the protection switching will not exceed the maximum allowed CLR. In this case, only hitless (no cell loss) protection switching may be allowed.
  • Priority P2 (lowest) - is assigned to the services that are not sensitive to cell losses nor delays. These services could be Unspecified Bit Rate - UBR services. These are the services that will be switched first in case of congestion onset.
  • the amount of carried traffic may or may not be specified. In case it is specified, it may be specified in various ways (Peak Cell Rate - PCR, Sustainable Cell Rate - SCR, Maximum Burst Size - MBS).
  • An illustration of the steps involved in selecting an entity for protection switching based on priority and amount of carried traffic is shown in FIG. 8. is allowed for the respective priority, a search is performed in order to find entities that have that particular priority. If such entities are found, the selection process continues further for that priority of traffic.
  • the amount of carried traffic is specified in some manner or another for the entities of that priority, the entity that is selected will be the one that carries the least amount of traffic. If the amount of traffic is not specified, then the entity selected is the first one to be found among all entities of the same priority in the database. If no entities carrying the desired priority are found, then the search will be initiated for the next higher priority.
  • the function Before performing the search for entities of higher priority, the function must verify that the entities of that priority may be switched or not. In other words, the function must verify if the services of next higher priority allow protection switching or not, because of their sensitivity to losses or delays. In the case that protection switching is allowed for the higher priority and that there are entities of that higher priority, an entity of the higher priority will be selected. The process stops as soon as an entity is selected.
  • FIG. 9 illustrates an example the operation of the congestion prevention mechanism for a given topology and for a given traffic load.
  • the traffic parameter selected as a Measure of Congestion is the link utilization. It is assumed as well that all links have the same capacity. Thus, if a link is utilized x%, the same amount of traffic on a different link will result in a link utilization of x% as well. It is also assumed that the alarm threshold is 65%, with a safety margin of 3%. This means that whenever the threshold of 65% utilization is reached and/or crossed for the observation period, onset of congestion state is declared and the congestion preventive mechanisms are triggered. The normal state is reached only after the link utilization has dropped below the alarm threshold with a value at least equal to the safety margin, for a complete observation period. In this case the link utilization has to be recorded at the most 62% for the FIG.
  • 9a shows the initial state of the network composed of five nodes, where the percentage values represent the link utilization.
  • the protection switching is executed at the VPG level. Between node A and B a link utilization of 65% has been observed throughout the waiting period. After the selection process, VPG1 that carries traffic between A and C via B is selected and switched over to the protection path A to C via D.
  • FIG. 9b shows the state of the network after VPG1 has been switched.
  • VPG1 accounts for 5% of the link utilization. Since in this case the link utilization of link A-B dropped to 60% and this value has been recorded for a complete observation period, the normal state is declared and the selection/switching process is ended.
  • the process can be implemented on a microprocessor or microcontroller platform, with access to the traffic parameters, and with communication access to the switching fabric.
  • the technology can be implemented both in software and in hardware-software to be placed in existing and evolving network entities.
  • the apparatus can be a stand-alone apparatus.
  • the apparatus can be implemented as part of protection switching.
  • the basic operation involves: buffer management; network management; dynamic diversion of the traffic; and integration to hitless, link and hard-node failure (apparatus failure).
  • the present invention can be used as part of commercial product such as a stand alone microprocessor-based board or as an ATM switch or VP cross-connect.
  • the present invention can be easily integrated in protection switching apparatus that protects the network domains from node failure, link failure.
  • the invention handles congestion as a soft-node failure and therefore, the node can quickly react to the traffic flow towards congestion and can prevent any loss of information or prevent any temporary delays to the traffic.
  • the implementation of a protection domain to provide the congestion prevention requires a modest spare bandwidth that can be used temporarily to prevent congestion occurrence as a soft-node failure. This does not significantly add to the cost of network operation, since networks are designed to have spare capacity for The apparatus that uses the proposed invention will eliminate the need for significant over-provisioning of bandwidth to assure QoS at all times. Therefore, the present invention significantly reduces the cost of network operations and emergency repairs.

Abstract

The present invention provides a method and apparatus for preventing congestion from occurring in ATM networks by treating congestion as a soft network failure and taking preventive measures before congestion occurs to prevent service degradation and insure that quality of service is provided even when traffic grows beyond an acceptable limit on a particular route. The invention uses closed loop and open loop methods for congestion control and utilizes protection switching mechanisms before congestion occurs. The present invention monitors congestion based on traffic parameter monitoring (100), average parameter values computation (101), appropriate threshold setting and selective protective switching (104). When growth of traffic threatens the quality of service in particular segment of the network, protection switching is executed selectively to divert a fraction of the traffic to relieve the traffic on the affected route.

Description

METHOD AND APPARATUS FOR PREVENTION OF CONGESTION IN ATM NETWORKS THROUGH ATM PROTECTION SWITCHING
SPECIFICATION BACKGROUND OF THE INVENTION
FIELD OF THE INVENTION
The present invention generally relates to an automatic protection switching method for preventing congestion in an ATM network, and more particularly to a method that uses ATM protection switching to prevent congestion occurrence in ATM networks by treating the onset of congestion as network soft failures.
RELATED ART
ATM network congestion control methods address the capacity of a network as a whole to carry the offered traffic. In contrast, flow control methods address the point to point communication between a sender and a receiver, by adapting the data rate of the sender to the data rate at which the receiver can process the traffic. Basically, congestion control methods addresses the ability of a network to handle traffic, while flow control addresses the ability of the receiving devices to follow the speed of the transmitting devices.
The majority of congestion control methods have traditionally been categorized as part of traffic management. Therefore, congestion control methods used in the past have involved methods that rely on modifying or shaping the traffic at the traffic source, or at the network entrance point, in order to prevent or to handle congestion. Typical congestion control techniques include "open loop" and "closed loop" methods.
Open loop methods are, by definition, measures that the network takes prior to servicing the traffic. These measures include decision mechanisms to accept or reject new traffic (Call Admission Control). These mechanisms rely on analyzing the network condition for a determined destination at the point of entrance in the network. Whenever a call setup request arrives at the network entrance point, the parameters specified in the call traffic contract are checked against the resource based on the traffic contracts of the accepted calls in the network. These open loop methods also include packet or cell discarding or tagging. If a traffic source does not conform to the traffic contract, the packets or cells belonging to that call are discarded, or if their priority is high, the cells are tagged and their priority is changed to a lower one. Open loop methods also include traffic shaping techniques (Leaky
Bucket, Token Bucket) that transform bursty traffic patterns into uniform traffic patterns. Networks that transport bursty traffic are difficult to dimension, and therefore they are subject to experience congestion. If the traffic pattern is uniform, then the network can be dimensioned so that the risk of congestion diminishes. Open loop methods are based on pre-dimensioning the network, and do not follow the dynamic changes in the network.
Closed loop methods are based on feedback received from the network. Closed loop techniques monitor the system to detect the time and location of congestion occurrence, convey the congestion notification to the parts of the system that can adjust the system operation, and ultimately, adjust the system operation. They include techniques that rely on notifying the congestion to the traffic source, which has to reduce the transmission rate for the congestion to be relieved (Source Rate Adaptation). Also included in closed loop methods are admission controls, which may be used in response to a state of network congestion, and which prevents any call from being accepted after the congested state is declared. Another closed loop method employs the use of additional bandwidth for new calls. This technique gives the possibility to offer additional bandwidth for the new calls that arrive at a congested point. This technique however, does not improve the state of the calls that are already routed through a congested path. Closed loop methods are reactive in the sense that they do not act until congestion is already in place, and therefore service degradations may occur.
Other efforts to reduce congestion and/or to overcome hard or soft network failures include:
ITU-T Recommendation 1.630. The Recommendation 1.630 presents the architecture and protocol related to ATM layer protection switching. It recommends that ATM protection switching be used if failures or signal degradations are detected. 'Transparent Non-disruptible ATM Network," Vaman, et al.. U.S. Patent
Application Serial No. 08/862,631, filed May 23, 1997, now which discloses a method to provide non-disrupted service through rerouting in case of resource failure or in the case that a resource becomes unreachable (in mobile networks). Also, the invention specifies that an alarm indication management cell is used to notify about congestion. However, there is no disclosure of use of protection switching or re-routing to relieve or prevent congestion.
"Hitless ATM Cell Transport for Reliable Multi-service Provisioning" Vaman. et al., U.S. Patent Serial No. 09/249,001, filed February 12, 1999, now , which discloses a means of lossless conveyance of user information even when network failures occur. This method can be coupled with the invention disclosed in the present document to ensure QoS at all times.
"A Taxonomy for Congestion Control Algorithms in Packet Switching Networks", Yang C.-Q., Reddy A.V.S., IEEE Network Magazine, vol 9, pp34-35, July/ Aug. 1995. In this article, a taxonomy for congestion control algorithms is given. This taxonomy is used to identify the novel features of the present disclosed congestion control method. Additionally, terminology used herein is generally defined in an ATM Forum Specification: "Traffic Management Specification Version 4.0," The ATM Forum Technical Committee. April. 1996. In contrast with the techniques previously set forth, the present invention specifically addresses the need for preventing congestion by treating the onset of congestion as a soft-failure of a network entity. There is a need to prevent congestion before it happens through feedback from the network entity. The present invention combines the advantages of congestion prevention with the effectiveness of feedback loops. OBJECTS AND SUMMARY OF THE INVENTION
It is a primary object of the present invention to prevent network congestion from occurring in ATM networks.
It is another object of the present invention to prevent congestion from occurring in ATM networks by treating the onset of congestion as a soft network failure.
It is an additional object of the present invention to use open loop and closed loop methods, in combination, to prevent congestion in ATM networks.
It is even an additional object of the present invention to prevent congestion from occurring in an ATM network by utilizing protection switching before congestion occurs to prevent service degregation, and to insure quality of service even when traffic grows beyond an acceptable limit on a particular route.
It is still another object of the present invention to prevent congestion from occurring by taking action at a switch in a network. It is yet another object of the present invention to prevent congestion from occurring in an ATM network by taking advantage of network resources and finding capacity without reducing offering and without source requirements.
It is a further object of the present invention to prevent congestion from occurring in ATM networks by taking action prior to the occurrence of congestion. It is yet an additional object of the present invention to insure quality of service (QoS) in the network, i.e. guarantee that the user sends at the same rate.
The present invention provides a method and apparatus for preventing congestion from occurring in ATM networks by treating congestion as a soft network failure and taking preventative measures before congestion occurs to prevent service degregation and insure that quality of service is provided even when traffic grows beyond an acceptable limit on a particular route. The invention uses closed loop and open loop methods for congestion control and utilizes protection switching mechanisms before congestion occurs. The present invention monitors congestion based on traffic parameter monitoring, average parameter values computation, appropriate threshold setting and selective protective switching. When growth of traffic threatens the quality of service in particular segment of the network, protection on the affected route. The fraction of traffic that is switched can be a virtual path, a group of virtual paths, or several virtual path groups. The method comprises the steps of monitoring traffic parameters; computing the average growth of the traffic; comparing the average traffic growth with predetermined thresholds; executing selective protection switching processes when the average traffic growth exceed predetermined thresholds; executing selective protection switching by selecting the traffic fraction to be switched and switching the selected traffic fraction; monitoring the traffic parameters; and optionally returning to the original configuration if the traffic parameters return to normal values for a selected time. This process can be implemented on a microprocessor or microcontroller platform with access to the traffic parameters, and with communication access to the switching fabric. The process can be implemented in both hardware and software to be placed in existing and evolving network entities, or the apparatus can be a stand alone apparatus. The elements of the apparatus include buffer management; network management; dynamic diversion of traffic; and integration to hitless, link and hard-node failure.
BRIEF DESCRIPTION OF THE DRAWINGS
Other important objects and features of the invention will be apparent from the following Detailed Description of the Invention taken in connection with the accompanying drawings in which: FIG. la is a graph of the instantaneous traffic load on the working path and
FIG lb is a graph of the instantaneous traffic load on the protection path.
FIG. 2 is a graph of the behavior of a network where no congestion control methods are applied.
FIG. 3 is a graph of the behavior of a network that, upon congestion, stops accepting new calls.
FIG. 4 is a graph of the behavior of a network where additional capacity is provided when congestion becomes important.
FIG. 5 is a graph of the behavior of a network that implements the method of the present invention. FIG. 6 is a flow chart of the steps comprising the method of the present invention.
FIG. 7 is a flow chart of the step of selecting an entity to be switched.
FIG. 8 is a flow chart of the steps involved in the function of selection of FIG. 7. FIG. 9a and 9b show link utilization in a network before and after protection switching, respectively.
DETAILED DESCRIPTION OF THE INVENTION
The present invention relates to a method for preventing congestion from occurring in ATM networks. This ensures that Quality of Service (QoS) is provided even when the traffic grows beyond an acceptable limit on a particular route. QoS means that a user can send information over the network at a set rate that does not change. Moreover, when protection switching according to the present invention is executed before the congestion occurs, all the measures are preventive and therefore, service degradation is prevented. The invention can be used in connection with IP,
DWDM, Wireless and DSL networks. The method of the present invention is based on traffic parameter monitoring, average parameter values computation, appropriate threshold setting, and selective protection switching. When growth of traffic threatens the assured QoS in a particular segment of the network, protection switching is executed selectively (i.e. just a fraction of the traffic is switched) to relieve the traffic on the affected routes. The switched traffic is accommodated on pre-assigned protection paths that carry low priority (excess) traffic. The fraction of the traffic that is switched can be a Virtual Path (VP), group of Virtual Paths or Virtual Path Group (VPG), or several Virtual Path Groups (VPGs).
The present invention is based on automated protection switching at the ATM layer. Protection switching is a process where an alternate path (protection path) is provided in addition to the path in use, whenever an impairment is detected on the path is use (working path). The invention treats the onset of congestion in a network as a soft failure of the network entity where it occurs. Thus, hard failures and soft failures can be treated in an integrated manner. However, there are differences in the way soft failures (and in this case the onset of congestion) and hard failures are addressed. In order to efficiently react to a hard failure, all the traffic that was carried on the affected path must be switched onto the protection path. In the case of congestion, there is no need to switch all the traffic on the protection path, but rather only a fraction of it. This ensures that the risk of congestion on the working path is eliminated, without reducing the source information rate and without dropping cells. Since the traffic can be grouped in VCs, VPs, and even VPGs, the fraction that can used for low priority traffic, and a spare capacity can always be reserved. The protection switching should occur only if the traffic switched would not overload or congest the protection path.
FIGS, la and b illustrates how protection switching relieves the working path by switching a fraction of the carried traffic onto the protection path. FIG. la shows the instantaneous traffic on the working path, while FIG. lb shows the instantaneous traffic on the protection path. The following conventions apply:
201 : Safety threshold
202: Congestion onset threshold 404: Maximum spare capacity reserved for protection switching
A, B, C: Periods in time tO, tl : moments in time.
FIG. la, period A: the traffic on the working path is above the safety threshold, but no actions are taken yet. At tO, the traffic is crossing the congestion onset threshold. This starts the hold off timer. The entire period B coincides with the hold off time. At tl, since the traffic is still above the congestion onset threshold and thus the risk of congestion is high, protection switching is required. After selecting which fraction of the traffic will be switched to the protection path, the protection switching occurs. The goal is to bring the traffic on the working path below the safety threshold. At the same instance of time the traffic on the protection path increases with the amount of traffic switched from the working path. During this time no new calls are accepted on the working path.
FIGS. 2 - 4 depict the relationship between the traffic that enters in the network and the traffic that is delivered by the network for each technique presented. The following conventions are used:
201 : Safety threshold
202: Congestion onset threshold
301 : Maximum capacity on the working path
302: Cumulated maximum capacity on the working and protection path A, B, C, D: Graph segments
FIG. 2 shows the behavior of a network where no congestion control without any problems. As the traffic load approaches the maximum capacity of the network, even as the number of packets is increasing, the number of delivered packets remains the same. This is evident in Region B. However, if the number of incoming packets is increasing still, then the network will be unable to process them and as a result, many packets will be lost and not delivered. This corresponds to the congested state and to Region C, where in this case the curve reaches far.
FIG. 3 shows the behavior of a network that upon congestion stops accepting new calls. Since the number of incoming packets in this case is bounded, the congestion does not become any worse, and therefore the curve does no go far in the congested state, which is represented by Region C.
FIG. 4 show the behavior of a network where additional capacity is provided when congestion becomes important. Regions A, B, and C are the same as in FIG. 2. While Curve 1 and Regions A, B, and C correspond to the operation of the system at normal capacity, Curve 2 and Region D correspond to the operation of the system with additional capacity. As FIG. 4 shows, the additional capacity is only offered after congestion has reached alarming proportions. Region D corresponds to a betterment of the network performance.
FIG. 5 shows the behavior of a network that implements the present invention. Curve 1 corresponds to the operation of the network when only the working path is used. When the traffic goes beyond the onset of congestion threshold for a period longer than the hold-off time, protection switching is executed and the traffic on the working path falls below the safety threshold. Curve 2 corresponds with the operation of the system when both working and protection paths are used. The boundary between Curve 1 and Curve 2 will fall statistically between thresholds 201 and 202. Region A, which corresponds with the optimal performance of the network, is larger than in all other cases presented, and it allows for a better packets delivered / incoming packets ratio when the number of incoming packets is larger. Limitation of the number of packets delivered occurs only at large numbers of incoming packets (Region B). Statistically, the traffic load on both paths does not go beyond the acceptable level, which assures the maintenance of QoS.
The novel features of the invention include: i. Use of a closed loop following techniques, at the same time, to prevent congestion: increase of resources, and decrease of load on the affected route; and use of protection switching as a mechanism to prevent the occurrence of congestion. Existing closed loop congestion control methods are reactive. The mechanisms are triggered after congestion has occurred. The present invention triggers the protection switching mechanisms before congestion has occurred.
In existing congestion control algorithms, either of the two techniques is used. The present invention uses both techniques at the same time, since by executing protection switching, more bandwidth becomes available to the service, and the load is also reduced on the affected route. This ensures the Service Level Agreement (SLA) maintenance on the affected route without dropping or reducing user traffic. The protection switching is used against node or link failures. By extending its usage to congestion prevention and congestion relieving, failures and congestion can be treated in an integrated manner. The method of the present invention comprises the following steps: monitoring traffic parameters; computing the average growth of the traffic; comparing the average traffic growth with pre-determined thresholds; executing selective protection switching processes when the average traffic growth exceeds predetermined thresholds; executing selective protection switching by selecting the traffic fraction to be switched and switching the selected traffic fraction; monitoring the traffic parameters and optionally returning to the original configuration if the traffic parameters return to normal values for a selected time period.
FIG. 6 shows the four steps or processes that are involved in the congestion prevention method of the present invention and the relationships among the steps. The following conventions are used: A,B,C,D - Processes;
E - Memory shared by Processes B and C; and
100, 101, 102, 103, 104 - Interactions between processes or read/write actions from/to the shared memory. Process "A" samples continuously the values of the traffic parameters that were chosen as a measure of congestion. Periodically, these values are passed to "B" writes periodically the statistics to the Shared Memory "E." Also, if the parameters reach an alarm threshold, congestion prevention is triggered by launching
Process "C." Process "C" selects a fraction of the traffic to be switched on the protection path, in order to relieve the working path. Process "C" may select a VC, a VP or group of VPs, depending on whether protection switching is executed at the
VC, VP or VPG level. For example, if protection switching should be executed at the VPG level, the output of the selection process will indicate which VPG must be switched in order to relieve the working path. In this case, the selected entity is a
VPG. Once an entity has selected, Process "D," Protection Switching, is launched for that entity.
Process "A," which relates to the traffic parameters measurement is an implementation issue as various traffic parameters could be used. Among the most used are the Buffer Occupancy, Link Utilization and Cell Loss Ratio (CLR). Process "B" involves simple arithmetical computations and is also implementation dependent. Process "D" represents a Protection Switching Process. Process "C" is explained below, using FIG. 7 as an illustration.
FIG. 7 illustrates the main functions of one of the four processes involved in congestion prevention, namely the Selection of the Entity to be switched (Process "C" in FIG. 6). The Process reads the real time statistics that present the current state of the network (in the node where the process is executed). If the onset of congestion is detected, the process checks if protection switching is allowed. Protection switching may not be desired if the traffic load on the protection path is such that traffic cannot be accommodated from the working path, in which case the human operator (network manager) sets a variable to inhibit protection switching. If Protection switching is allowed, the selection process starts. The selection process is implemented through a Function "Z." Function "Z" analyzes all entities (services or bundles of services) that cross the point of onset of congestion. Based on the priorities of the entities, and amount of carried traffic, only one entity is selected for protection switching. Then the protection switching is executed for the selected entity. If after a determined interval of time or observation period, the real time statistics still show the onset of of traffic carrying entity. When the network load comes to a normal level for the observation period, the process is ended.
The priorities of the entities are established by the network operator. An example of how the priorities could be assigned is as follows: Priority P0 (highest) - In this example, P0 is assigned to the services that are most sensitive to network impairments. The integrity of the cell stream for these services has to be guaranteed. Therefore a condition may be imposed by the network operator so that the services in this category should not be switched upon onset of congestion. These services impose conditions that may or may not be fulfilled during the protection switching process. As an example, Constant Bit Rate - CBR and real-time Variable Bit Rate - rtVBR impose restrictions both on the value of Cell Loss Ration (CLR) as well as the Cell Transfer Delay (CDT) or Cell Delay Variation (CDV). CLR, CDT and CDV are all QoS Parameters and reflect the sensitivity of the service to cell losses and to cell delays. Priority PI - In this example, PI is assigned to the services that are less sensitive to network impairments, but do require some degree of QoS assurance. These services could be non real-time Variable Bit Rate - nrtVBR or Available Bit Rate - ABR. These services impose restrictions on the CLR, but are not concerned with delays in the network. Protection switching may be allowed for these services, if there is a guarantee that the number of lost cells during the protection switching will not exceed the maximum allowed CLR. In this case, only hitless (no cell loss) protection switching may be allowed.
Priority P2 (lowest) - In this example, P2 is assigned to the services that are not sensitive to cell losses nor delays. These services could be Unspecified Bit Rate - UBR services. These are the services that will be switched first in case of congestion onset.
The amount of carried traffic may or may not be specified. In case it is specified, it may be specified in various ways (Peak Cell Rate - PCR, Sustainable Cell Rate - SCR, Maximum Burst Size - MBS). An illustration of the steps involved in selecting an entity for protection switching based on priority and amount of carried traffic is shown in FIG. 8. is allowed for the respective priority, a search is performed in order to find entities that have that particular priority. If such entities are found, the selection process continues further for that priority of traffic. In case the amount of carried traffic is specified in some manner or another for the entities of that priority, the entity that is selected will be the one that carries the least amount of traffic. If the amount of traffic is not specified, then the entity selected is the first one to be found among all entities of the same priority in the database. If no entities carrying the desired priority are found, then the search will be initiated for the next higher priority.
Before performing the search for entities of higher priority, the function must verify that the entities of that priority may be switched or not. In other words, the function must verify if the services of next higher priority allow protection switching or not, because of their sensitivity to losses or delays. In the case that protection switching is allowed for the higher priority and that there are entities of that higher priority, an entity of the higher priority will be selected. The process stops as soon as an entity is selected.
In the case that no entity can be selected (for example, if all entities have the same high priority and do not allow to be switched) protection switching cannot be performed. This is the reason why a careful planning of the network and services has to be performed in advance by the network operator. FIG. 9 illustrates an example the operation of the congestion prevention mechanism for a given topology and for a given traffic load.
It is assumed that the traffic parameter selected as a Measure of Congestion is the link utilization. It is assumed as well that all links have the same capacity. Thus, if a link is utilized x%, the same amount of traffic on a different link will result in a link utilization of x% as well. It is also assumed that the alarm threshold is 65%, with a safety margin of 3%. This means that whenever the threshold of 65% utilization is reached and/or crossed for the observation period, onset of congestion state is declared and the congestion preventive mechanisms are triggered. The normal state is reached only after the link utilization has dropped below the alarm threshold with a value at least equal to the safety margin, for a complete observation period. In this case the link utilization has to be recorded at the most 62% for the FIG. 9a shows the initial state of the network composed of five nodes, where the percentage values represent the link utilization. The protection switching is executed at the VPG level. Between node A and B a link utilization of 65% has been observed throughout the waiting period. After the selection process, VPG1 that carries traffic between A and C via B is selected and switched over to the protection path A to C via D.
FIG. 9b shows the state of the network after VPG1 has been switched. In average, VPG1 accounts for 5% of the link utilization. Since in this case the link utilization of link A-B dropped to 60% and this value has been recorded for a complete observation period, the normal state is declared and the selection/switching process is ended.
To perform the steps comprising the method of the present invention, the process can be implemented on a microprocessor or microcontroller platform, with access to the traffic parameters, and with communication access to the switching fabric. The technology can be implemented both in software and in hardware-software to be placed in existing and evolving network entities. In addition, the apparatus can be a stand-alone apparatus. The apparatus can be implemented as part of protection switching. The basic operation involves: buffer management; network management; dynamic diversion of the traffic; and integration to hitless, link and hard-node failure (apparatus failure).
The present invention can be used as part of commercial product such as a stand alone microprocessor-based board or as an ATM switch or VP cross-connect. The present invention can be easily integrated in protection switching apparatus that protects the network domains from node failure, link failure. The invention handles congestion as a soft-node failure and therefore, the node can quickly react to the traffic flow towards congestion and can prevent any loss of information or prevent any temporary delays to the traffic.
The implementation of a protection domain to provide the congestion prevention requires a modest spare bandwidth that can be used temporarily to prevent congestion occurrence as a soft-node failure. This does not significantly add to the cost of network operation, since networks are designed to have spare capacity for The apparatus that uses the proposed invention will eliminate the need for significant over-provisioning of bandwidth to assure QoS at all times. Therefore, the present invention significantly reduces the cost of network operations and emergency repairs.
Having thus described the invention in detail, it is to be understood that the foregoing description is not intended to limit the spirit and scope thereof. What is desired to be protected by Letters Patent is set forth in the appended claims.

Claims

CLAIMSWhat is claimed is:
1. A method for preventing congestion in an ATM network and insuring quality of service comprising: providing closed loop congestion control methods utilizing feedback from the network to switch a fraction of the traffic from a primary path to secondary paths; and at the same time, providing open loop congestion control methods by planning for additional bandwidth on the secondary paths.
2. The method of claim 1 wherein the step of providing closed loop congestion control methods includes monitoring traffic growth along a primary path.
3. The method of claim 2 wherein the step of providing open loop congestion control methods includes increasing resources.
4. The method of claim 3 wherein the step of providing open loop congestion control methods further includes decreasing traffic on the primary path by protection switching a fraction of the traffic to a secondary path.
5. A method for preventing congestion in an ATM network and insuring quality of service comprising the steps of: monitoring traffic parameters on the network; computing average growth of traffic on the network; comparing the average traffic growth with pre-determined thresholds; executing selective protection switching when the average traffic growth exceeds pre-determined thresholds, including: selecting a traffic fraction to be switched; and switching the selected traffic fraction to a secondary path; continuing to monitor the traffic parameters; and optionally returning to the original configuration of the network if the traffic parameters return to normal values for a selected time period.
6. The method of claim 5 wherein the step of selecting a traffic fraction to be switched comprises evaluating available bandwidth.
7. The method of claim 6 wherein the step of selecting a traffic fraction to be virtual path groups.
8. The method of claim 7 wherein after the step of continuing to monitor the traffic parameters, if the traffic growth still exceeds predetermined levels, switching additional traffic to a secondary path.
9. A method of preventing congestion in an ATM network, and assuring quality of service, comprising: sampling traffic parameters indicative of congestion; computing average values for sampled traffic parameters; storing average values in memory; comparing average values to pre-set thresholds; and initiating congestion prevention actions if average values exceed pre-set thresholds.
10. The method of claim 9 wherein the congestion prevention actions comprise selecting a fraction of traffic to be switched onto a protection path and switching the fraction of traffic onto the protection path.
11. The method of claim 9 wherein the fraction of traffic comprises a VC, VP or VPG.
12. The method of claim 10 further comprising selecting the traffic parameters to be sampled.
13. The method of claim 12 wherein the traffic parameters include buffer occupancy, link utilization or cell loss ratio.
14. The method of claim 12 wherein the pre-set thresholds relate to bandwidth.
15. The method of claim 12 wherein after switching the fraction of traffic to the protection path, traffic is again sampled, averaged, stored and compared, and if traffic still exceed pre-set thresholds, additional congestion prevention actions are initiated.
16. The method of claim 12 wherein the step of selecting a fraction of traffic to be switched comprises establishing priorities of entities and first selecting lowest priority entities for switching.
17. An apparatus for preventing congestion from occurring in an ATM network and assuming quality of service comprising: measuring means for measuring traffic parameters in an ATM network; means for switching of traffic from primary path to secondary paths prior to the onset of congestion.
18. The apparatus of claim 17 wherein the apparatus can be placed into existing networks.
19. The apparatus of claim 17 wherein the apparatus is a stand alone.
PCT/US2000/023498 1999-09-14 2000-08-28 Method and apparatus for prevention of congestion in atm networks through atm protection switching WO2001020829A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU70785/00A AU7078500A (en) 1999-09-14 2000-08-28 Method and apparatus for prevention of congestion in atm networks through atm protection switching

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US39583199A 1999-09-14 1999-09-14
US09/395,831 1999-09-14

Publications (1)

Publication Number Publication Date
WO2001020829A1 true WO2001020829A1 (en) 2001-03-22

Family

ID=23564711

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2000/023498 WO2001020829A1 (en) 1999-09-14 2000-08-28 Method and apparatus for prevention of congestion in atm networks through atm protection switching

Country Status (3)

Country Link
US (2) US7082101B2 (en)
AU (1) AU7078500A (en)
WO (1) WO2001020829A1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1517494A1 (en) * 2003-09-22 2005-03-23 Alcatel Providing protection switching via failure prediction
EP1742444A1 (en) * 2005-07-05 2007-01-10 Tellitec Engineering GmbH Object transmission based multilink gateway
US7230924B2 (en) 2001-03-28 2007-06-12 At&T Corp. Method and apparatus for communications traffic engineering
EP2760181A1 (en) * 2013-01-25 2014-07-30 ARXCEO Corporation Methods and systems for providing redundancy in data network communications
US9277452B1 (en) 2013-03-07 2016-03-01 Dragonwave, Inc. Adaptive modulation and priority-based flow control in wireless communications

Families Citing this family (84)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6856627B2 (en) 1999-01-15 2005-02-15 Cisco Technology, Inc. Method for routing information over a network
US7463581B1 (en) * 2000-02-07 2008-12-09 Cisco Technology, Inc. Re-routing connections using redundant path connections and loopbacks
US7389341B2 (en) 2001-01-31 2008-06-17 Accenture Llp Remotely monitoring a data processing system via a communications network
US7477594B2 (en) * 2001-05-16 2009-01-13 Cisco Technology, Inc. Method for restoring a virtual path in an optical network using 1:N protection
US8135834B1 (en) * 2001-06-18 2012-03-13 Packet Design, Inc. Method and system for causing intra-AS network traffic to be more evenly balanced
JP2003078553A (en) * 2001-08-31 2003-03-14 Hitachi Ltd Packet transferring method
US7110422B1 (en) 2002-01-29 2006-09-19 At&T Corporation Method and apparatus for managing voice call quality over packet networks
FR2836313A1 (en) * 2002-02-21 2003-08-22 France Telecom Method for protection of label switching paths in a multiprotocol label-switching network (MPLS), whereby an alternative bypass label switched path is provided with reserved network resources in case of failure of a first path
JP2003298633A (en) * 2002-04-05 2003-10-17 Fujitsu Ltd Transmission equipment having data channel fault informing function in the case of control channel fault
US6965775B2 (en) * 2002-05-15 2005-11-15 Nokia Corporation Service-oriented protection scheme for a radio access network
JP3972737B2 (en) * 2002-06-05 2007-09-05 日本電気株式会社 Digital transmission system and digital transmission method used therefor
US7525907B2 (en) * 2002-07-05 2009-04-28 Nortel Networks Limited Method, device and software for establishing protection paths on demand and revertive protection switching in a communications network
JP3715596B2 (en) * 2002-07-11 2005-11-09 富士通株式会社 Wide area load balancing control system
DE10235646A1 (en) * 2002-08-02 2004-02-19 Marconi Communications Gmbh Telecommunications network section has each data line connected to interface circuit per node, each interface circuit configured to transfer set number of channels between data lines, routing matrix
US7596629B2 (en) * 2002-11-21 2009-09-29 Cisco Technology, Inc. System and method for interconnecting heterogeneous layer 2 VPN applications
US7469282B2 (en) 2003-01-21 2008-12-23 At&T Intellectual Property I, L.P. Method and system for provisioning and maintaining a circuit in a data network
US7619966B2 (en) * 2003-02-21 2009-11-17 Alcatel Lucent Hybrid virtual private LAN extensions
US20040218590A1 (en) * 2003-04-30 2004-11-04 Clark Edward Alan Telecommunication network with layered switching fabric
US7457234B1 (en) * 2003-05-14 2008-11-25 Adtran, Inc. System and method for protecting communication between a central office and a remote premises
US8028050B2 (en) * 2003-06-13 2011-09-27 Alcatel-Lucent Usa Inc. Restoration for virtual private networks
US8737200B1 (en) * 2003-06-25 2014-05-27 Rockstar Consortium Us Lp MPLS/IP pseudo-wire and layer-2 virtual private network resiliency
US7536100B2 (en) * 2003-08-26 2009-05-19 Sprint Communications Company Lp POP-to-POP optical wavelength protection in a communication system
US8014290B2 (en) * 2003-10-17 2011-09-06 Hewlett-Packard Development Company, L.P. Traffic flow management through a multipath network
JP4253569B2 (en) * 2003-12-03 2009-04-15 株式会社日立コミュニケーションテクノロジー Connection control system, connection control device, and connection management device
US8199638B2 (en) 2003-12-23 2012-06-12 At&T Intellectual Property I, L.P. Method and system for automatically rerouting logical circuit data in a data network
US8223632B2 (en) * 2003-12-23 2012-07-17 At&T Intellectual Property I, L.P. Method and system for prioritized rerouting of logical circuit data in a data network
US7639606B2 (en) 2003-12-23 2009-12-29 At&T Intellectual Property I, L.P. Method and system for automatically rerouting logical circuit data in a virtual private network
US7609623B2 (en) 2003-12-23 2009-10-27 At&T Intellectual Property I, L.P. Method and system for automatically rerouting data from an overbalanced logical circuit in a data network
US7639623B2 (en) 2003-12-23 2009-12-29 At&T Intellectual Property I, L.P. Method and system for real time simultaneous monitoring of logical circuits in a data network
US8203933B2 (en) 2003-12-23 2012-06-19 At&T Intellectual Property I, L.P. Method and system for automatically identifying a logical circuit failure in a data network
US7630302B2 (en) 2003-12-23 2009-12-08 At&T Intellectual Property I, L.P. Method and system for providing a failover circuit for rerouting logical circuit data in a data network
US7646707B2 (en) 2003-12-23 2010-01-12 At&T Intellectual Property I, L.P. Method and system for automatically renaming logical circuit identifiers for rerouted logical circuits in a data network
AU2005215043A1 (en) * 2004-02-19 2005-09-01 Georgia Tech Research Corporation Systems and methods for parallel communication
US7466646B2 (en) 2004-04-22 2008-12-16 At&T Intellectual Property I, L.P. Method and system for automatically rerouting logical circuit data from a logical circuit failure to dedicated backup circuit in a data network
US8339988B2 (en) 2004-04-22 2012-12-25 At&T Intellectual Property I, L.P. Method and system for provisioning logical circuits for intermittent use in a data network
US7460468B2 (en) 2004-04-22 2008-12-02 At&T Intellectual Property I, L.P. Method and system for automatically tracking the rerouting of logical circuit data in a data network
US7768904B2 (en) 2004-04-22 2010-08-03 At&T Intellectual Property I, L.P. Method and system for fail-safe renaming of logical circuit identifiers for rerouted logical circuits in a data network
US7664043B1 (en) * 2004-07-01 2010-02-16 At&T Corp. Method and apparatus for performing reachability testing within the context of customer virtual private networks
US20060039697A1 (en) * 2004-08-19 2006-02-23 International Business Machines Corporation Autonomous optical path management device
US7483996B2 (en) * 2004-11-29 2009-01-27 Cisco Technology, Inc. Techniques for migrating a point to point protocol to a protocol for an access network
US7769037B2 (en) * 2005-02-19 2010-08-03 Cisco Technology, Inc. Techniques for using first sign of life at edge nodes for a virtual private network
US7778199B2 (en) * 2005-02-19 2010-08-17 Cisco Technology, Inc. Techniques for customer self-provisioning of edge nodes for a virtual private network
US8059527B2 (en) * 2005-02-19 2011-11-15 Cisco Technology, Inc. Techniques for oversubscribing edge nodes for virtual private networks
US7852748B2 (en) * 2005-03-23 2010-12-14 Cisco Technology, Inc. Method and system for providing voice QoS during network failure
US20060252441A1 (en) * 2005-05-03 2006-11-09 Harris John M System and method for programming an inactivity timer
US8260922B1 (en) 2005-09-16 2012-09-04 Cisco Technology, Inc. Technique for using OER with an ECT solution for multi-homed sites
US7801030B1 (en) * 2005-09-16 2010-09-21 Cisco Technology, Inc. Technique for using OER with an ECT solution for multi-homed spoke-to-spoke sites
KR100716153B1 (en) * 2005-11-03 2007-05-10 한국전자통신연구원 Method for Measuring Stage-to-stage Delay in Nonsynchronization Packet Transfer Network, Nonsynchronization Packet Sender and Receiver
US7693047B2 (en) * 2005-11-28 2010-04-06 Cisco Technology, Inc. System and method for PE-node protection
JP4952712B2 (en) * 2006-03-20 2012-06-13 富士通株式会社 Data transfer system, data transfer method, communication device, and control method
US8149708B2 (en) * 2006-04-20 2012-04-03 Cisco Technology, Inc. Dynamically switching streams of packets among dedicated and shared queues
DE602006002961D1 (en) * 2006-05-04 2008-11-13 Nokia Siemens Networks Gmbh Automatic backup of the forwarding of the packets into the MPLS network in a double-linked Ethernet bridge
US8309528B2 (en) * 2006-05-10 2012-11-13 The Trustees Of Columbia University In The City Of New York Two pore channels as regulators of proliferation in cancer
US8295162B2 (en) 2006-05-16 2012-10-23 At&T Intellectual Property I, L.P. System and method to achieve sub-second routing performance
ITTO20060364A1 (en) * 2006-05-19 2007-11-20 Xanto Technologies Srl USB MASS MEMORY DEVICE AND ITS DATA TRANSFER PROCEDURE
US8355316B1 (en) 2009-12-16 2013-01-15 Sprint Communications Company L.P. End-to-end network monitoring
US7921224B2 (en) * 2006-12-29 2011-04-05 Alcatel-Lucent Usa Inc. Method of maintaining traffic services through congestion caused by network failovers
US8289878B1 (en) * 2007-05-09 2012-10-16 Sprint Communications Company L.P. Virtual link mapping
US20090003229A1 (en) * 2007-06-30 2009-01-01 Kai Siang Loh Adaptive Bandwidth Management Systems And Methods
US8259584B2 (en) * 2008-03-18 2012-09-04 Cisco Technology, Inc. Dynamic reroute of network traffic
TW200941965A (en) * 2008-03-28 2009-10-01 Chunghwa Telecom Co Ltd Network standby system and method
CN102027761B (en) * 2008-05-15 2015-05-20 哈里斯施特拉特克斯网络运行公司 Systems and methods for distributed data routing in a wireless network
US9088929B2 (en) * 2008-05-15 2015-07-21 Telsima Corporation Systems and methods for distributed data routing in a wireless network
EP2281408A4 (en) * 2008-05-28 2013-03-06 Harris Stratex Networks Operat Systems and methods for data path control in a wireless network
US8094569B2 (en) 2008-12-05 2012-01-10 Cisco Technology, Inc. Failover and failback of communication between a router and a network switch
EP2430563A4 (en) 2009-05-13 2013-10-09 Aviat Networks Inc Systems and methods for fractional routing redundancy
CN101989906B (en) 2009-07-30 2013-12-18 华为技术有限公司 Message synchronizing method, device and system
US8458323B1 (en) 2009-08-24 2013-06-04 Sprint Communications Company L.P. Associating problem tickets based on an integrated network and customer database
KR20120093225A (en) 2009-09-23 2012-08-22 에어로바이론먼트, 인크. Active multi-path network redundancy with performance monitoring
WO2011080744A1 (en) * 2010-01-04 2011-07-07 Starhome Gmbh Local access to data while roaming with a mobile telephony device
US8456984B2 (en) * 2010-07-19 2013-06-04 Ciena Corporation Virtualized shared protection capacity
US8644146B1 (en) 2010-08-02 2014-02-04 Sprint Communications Company L.P. Enabling user defined network change leveraging as-built data
US8855012B1 (en) * 2011-03-18 2014-10-07 Mojyle LLC Mobile, secure and customizable emergency service gateway system
US9432258B2 (en) 2011-06-06 2016-08-30 At&T Intellectual Property I, L.P. Methods and apparatus to configure virtual private mobile networks to reduce latency
US9305029B1 (en) 2011-11-25 2016-04-05 Sprint Communications Company L.P. Inventory centric knowledge management
US9451393B1 (en) * 2012-07-23 2016-09-20 Amazon Technologies, Inc. Automated multi-party cloud connectivity provisioning
US20150023173A1 (en) * 2013-07-16 2015-01-22 Comcast Cable Communications, Llc Systems And Methods For Managing A Network
US9680564B2 (en) 2013-08-26 2017-06-13 Verizon Patent And Licensing Inc. Protection in metro optical networks
US9590736B2 (en) * 2013-08-26 2017-03-07 Verizon Patent And Licensing Inc. Using floating transport card for best effort traffic
EP3039831A1 (en) * 2013-08-30 2016-07-06 Nokia Solutions and Networks Oy Methods and apparatus
US9667538B2 (en) * 2015-01-30 2017-05-30 Telefonaktiebolget L M Ericsson (Publ) Method and apparatus for connecting a gateway router to a set of scalable virtual IP network appliances in overlay networks
US10402765B1 (en) 2015-02-17 2019-09-03 Sprint Communications Company L.P. Analysis for network management using customer provided information
DE102018212360A1 (en) * 2018-07-25 2020-01-30 Robert Bosch Gmbh First network unit of a communication network
CN114826887A (en) * 2022-03-21 2022-07-29 阿里云计算有限公司 Private network connection communication method and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5848055A (en) * 1996-11-19 1998-12-08 Northern Telecom Limited Bandwidth correlation means for paths in connection-oriented packet switching networks
US5898673A (en) * 1997-02-12 1999-04-27 Siemens Information And Communication Networks, Inc. System and method for prevention of cell loss due to quality of service contracts in an ATM network
US6064653A (en) * 1997-01-07 2000-05-16 Bell Atlantic Network Services, Inc. Internetwork gateway to gateway alternative communication
US6145005A (en) * 1997-06-04 2000-11-07 Nortel Networks Limited Communications system

Family Cites Families (32)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03104451A (en) * 1989-09-19 1991-05-01 Fujitsu Ltd Route changeover system for multi-stage link exchange system
US6115393A (en) * 1991-04-12 2000-09-05 Concord Communications, Inc. Network monitoring
JP3623997B2 (en) * 1994-12-28 2005-02-23 富士通株式会社 Digital exchange relay system and digital exchange
JPH08288981A (en) * 1995-04-18 1996-11-01 Fujitsu Ltd Line changeover system for duplex transmitter between different modes
FR2737371A1 (en) * 1995-07-26 1997-01-31 Trt Telecom Radio Electr SECURITY BY DOUBLING AT LEAST CERTAIN LOGIC CHANNELS IN A TELECOMMUNICATIONS NETWORK
JPH0974412A (en) * 1995-09-04 1997-03-18 Fujitsu Ltd Aps system for atm exchange network
US5793745A (en) * 1996-05-06 1998-08-11 Bell Communications Research, Inc. Bundled protection switching in a wide area network background of the invention
US5838924A (en) * 1996-08-06 1998-11-17 Lucent Technologies Inc Asynchronous transfer mode (ATM) connection protection switching apparatus and method
JP2806374B2 (en) * 1996-08-19 1998-09-30 日本電気株式会社 ATM virtual path switching node
US6091737A (en) * 1996-11-15 2000-07-18 Multi-Tech Systems, Inc. Remote communications server system
US5999525A (en) * 1996-11-18 1999-12-07 Mci Communications Corporation Method for video telephony over a hybrid network
US6760302B1 (en) * 1996-12-20 2004-07-06 The Trustees Of Columbia University In The City Of New York Automatic protection switching system in a network
DE19703992A1 (en) * 1997-02-03 1998-08-06 Siemens Ag Method for the equivalent switching of transmission devices in ring architectures for the bidirectional transmission of ATM cells
US6011780A (en) * 1997-05-23 2000-01-04 Stevens Institute Of Technology Transparant non-disruptable ATM network
US5959972A (en) * 1997-05-27 1999-09-28 3Com Corporation Method of port/link redundancy in an ATM switch
US5959968A (en) * 1997-07-30 1999-09-28 Cisco Systems, Inc. Port aggregation protocol
EP1010346B1 (en) * 1997-08-22 2003-10-15 Nortel Networks Limited Protection switching trigger generation
US6108330A (en) * 1997-09-26 2000-08-22 3Com Corporation Apparatus and methods for use therein for an ISDN LAN modem that selects among a plurality of DNS servers for responding to a DNS query
US6028848A (en) * 1997-09-26 2000-02-22 3Com Corporation Apparatus and methods for use therein for an ISDN LAN modem utilizing internal DNS and DHCP servers for transparent translation of local host names to IP addresses
JPH11177189A (en) * 1997-12-12 1999-07-02 Fujitsu Ltd Terminal structure of wiring on printed board
US6272107B1 (en) * 1998-05-12 2001-08-07 3Com Corporation Method of path restoration in an ATM network utilizing point to point switched virtual circuits
JP3036524B2 (en) * 1998-08-14 2000-04-24 日本電気株式会社 VP protection system and method
US6167445A (en) * 1998-10-26 2000-12-26 Cisco Technology, Inc. Method and apparatus for defining and implementing high-level quality of service policies in computer networks
US6426941B1 (en) * 1999-02-12 2002-07-30 Megaxess, Inc. Hitless ATM cell transport for reliable multi-service provisioning
JP3465620B2 (en) * 1999-03-17 2003-11-10 日本電気株式会社 Virtual private network construction system
US6721269B2 (en) * 1999-05-25 2004-04-13 Lucent Technologies, Inc. Apparatus and method for internet protocol flow ring protection switching
US6353593B1 (en) * 1999-06-03 2002-03-05 Fujitsu Network Communications, Inc. Protection architecture for virtual channel connections (VCCS) in a telecommunications network
US6535481B1 (en) * 1999-08-20 2003-03-18 Nortel Networks Limited Network data routing protection cycles for automatic protection switching
US6654923B1 (en) * 1999-09-09 2003-11-25 Nortel Networks Limited ATM group protection switching method and apparatus
US6532088B1 (en) * 1999-09-10 2003-03-11 Alcatel System and method for packet level distributed routing in fiber optic rings
EP1126741A1 (en) * 2000-02-15 2001-08-22 Siemens Aktiengesellschaft Method for protection switching of transmission equipment in MPLS networks
US6775229B1 (en) * 2000-05-05 2004-08-10 Fujitsu Network Communications, Inc. Method and system for providing a protection path for connection-oriented signals in a telecommunications network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5848055A (en) * 1996-11-19 1998-12-08 Northern Telecom Limited Bandwidth correlation means for paths in connection-oriented packet switching networks
US6064653A (en) * 1997-01-07 2000-05-16 Bell Atlantic Network Services, Inc. Internetwork gateway to gateway alternative communication
US5898673A (en) * 1997-02-12 1999-04-27 Siemens Information And Communication Networks, Inc. System and method for prevention of cell loss due to quality of service contracts in an ATM network
US6145005A (en) * 1997-06-04 2000-11-07 Nortel Networks Limited Communications system

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7230924B2 (en) 2001-03-28 2007-06-12 At&T Corp. Method and apparatus for communications traffic engineering
US7948899B2 (en) 2001-03-28 2011-05-24 At&T Intellectual Property Ii, Lp Method and apparatus for communications traffic engineering
EP1517494A1 (en) * 2003-09-22 2005-03-23 Alcatel Providing protection switching via failure prediction
US8392755B2 (en) 2003-09-22 2013-03-05 Alcatel Lucent Providing protection switching via failure prediction
EP1742444A1 (en) * 2005-07-05 2007-01-10 Tellitec Engineering GmbH Object transmission based multilink gateway
EP2760181A1 (en) * 2013-01-25 2014-07-30 ARXCEO Corporation Methods and systems for providing redundancy in data network communications
US9277452B1 (en) 2013-03-07 2016-03-01 Dragonwave, Inc. Adaptive modulation and priority-based flow control in wireless communications

Also Published As

Publication number Publication date
AU7078500A (en) 2001-04-17
US20060203719A1 (en) 2006-09-14
US7082101B2 (en) 2006-07-25
US20020172148A1 (en) 2002-11-21
US7804771B2 (en) 2010-09-28

Similar Documents

Publication Publication Date Title
WO2001020829A1 (en) Method and apparatus for prevention of congestion in atm networks through atm protection switching
CA1286758C (en) Packet switching system arranged for congestion control through bandwidth management
US4769811A (en) Packet switching system arranged for congestion control
US6400681B1 (en) Method and system for minimizing the connection set up time in high speed packet switching networks
US6934249B1 (en) Method and system for minimizing the connection set up time in high speed packet switching networks
US8724462B2 (en) Congestion handling in a packet switched network domain
US6847646B1 (en) Network coupling device with small cell memory
JP2782973B2 (en) Flow rate monitoring method and system in packet network
US7236458B2 (en) Method for monitoring traffic in packet switched network
EP0800294B1 (en) Method to control data flow rate, queuing network node and packet switching network
EP0814583A2 (en) Method and system for minimizing the connection set up time in high speed packet switching networks
Wang et al. Fault recovery routing in wide area packet networks
Chen et al. Analysis and design of a highly reliable transport architecture for ISDN frame-relay networks
JPH08274794A (en) Signal acceptance permission device in atm guard device
Cotter et al. Traffic backlog and impact on network dimensioning for survivability for wide-area VP-based ATM networks
Jaeger et al. On fault recovery priority in ATM networks
JP3019352B2 (en) Policing method
JP3989197B2 (en) Packet discard device
JP2757536B2 (en) Call setting admission control method
Mehaoua et al. An intelligent multi-agent architecture for dynamic regulation of ATM congestion control parameters
JP3749443B2 (en) ATM switch and its call admission control method
Kwon et al. A reactive flow control mechanism in ATM network with end-to-end transport
JP3132719B2 (en) Usage parameter control circuit
Kant et al. Comparison of restoration strategies based on pre-planned routing methodologies in ATM networks
WO2000035152A1 (en) Asynchronous transfer mode transmission networks

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP