The field of the invention relates to networks for digital communication. More specifically, the field relates to the reduction of network-wide control message congestion.
A soft or semi-permanent virtual circuit (“SPVC”) is a generic term for any communications medium that is permanently provisioned at the end points, but switched in the middle. An example of an SPVC is illustrated in
In a private network-network interface (“PNNI”) network provisioned with primarily SPVC connections, the demand on control resources remains low until significant changes are precipitated by a failure in the network. A link or node failure may necessitate the rerouting of thousands of SPVCs. This activity results in a burst of call release, setup, route selection, and call connect activity as connections are released (de-routed) and rerouted over alternate paths, all in a relatively short period of time.
When a trunk fails at the PNNI, call clearing is initiated on both sides of the failed trunk by sequentially sending release messages for every failed connection. Once the SPVC manager 150 at the master endpoint 120 receives a release, the SPVC manager initiates a reroute of the connection by sending a setup message into the network. In an effort to conserve switch resources, the SPVC manager reacts to local node congestion, avoiding the sending of setup messages to an already congested switch.
Simulations of up to 100 node networks with failures of links carrying tens of thousands of connections provide evidence that large numbers of setup messages can be dropped at the switches at or near each end of the failed link. These drops, and the ensuing retries, significantly increase the time required for the network to recover from a failure. In these scenarios, reacting to local node congestion yields only a moderate effect on helping the SPVC manager send reroute messages into the network without causing congestion at a distant node. Although local switch congestion may be abated at the connection end nodes, evidence suggests that congestion will not be avoided in the core of the network.
Embodiments are described for a semi-permanent virtual circuit (SPVC) manager to manage a network of switches coupled together to form a semi-permanent virtual circuit. The SPVC manager considers a set of pending connections throughout the network when managing the SPVC. The SPVC manager uses either a static flow control window or a dynamically sized flow control window to manage pending connections within the network.
Other features and advantages of the present invention will be apparent from the accompanying drawings and from the detailed description that follows below.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements and in which:
A system and method are disclosed for reducing congestion within a soft or semi-permanent virtual circuit (“SPVC”) by factoring in pending connections network-wide rather than simply at the local switch. Flow control windows regulate the number of connections pending in the network. The flow control windows comprise either a static window scheme based on configurable static parameters or a dynamic window-sizing scheme based on network-wide signaling congestion indications.
To avoid congestion in the core of the network, a network-wide perspective is used. The SPVC manager is designed to consider the number of connections pending in the network rather than just the number pending at the local switch.
Each switch in the network has one SPVC manager that manages all of the connections that the switch oversees as a master. The SPVC manager (200) interfaces with a call control block (CCB) (205) as illustrated by the block diagram of
Routing software monitors many points where resources may be under pressure at the switch. Congestion indicators are set when a high threshold is reached and are cleared when a low threshold is reached. These congestion indicators include (1) local node setup congestion for connections pending at the node, (2) connection resource manager mild congestion for connect and delete requests queued to the connection resource manger, and (3) connection resource manger severe congestion. The high and low congestion thresholds for these parameters are all configurable. The call control and the SPVC manager software use these congestion indicators to determine if local congestion abatement actions should be taken. The SPVC manager stops sending setup messages whenever there is any indication of local congestion.
A variety of schemes are available to determine when network-wide abatement actions are to be taken, in contrast to local congestion abatement. One method for determining network-wide abatement is a static flow control window. In this scheme, the SPVC manager 200 keeps track of the number of its connections owned by this SPVC manager that are pending anywhere in the network. The algorithm simply limits the maximum number of pending connections to the configured static window size. The optimal size of the static flow control window is based on a number of factors. These factors include the number of nodes in the network, the geographical size of the network, and the distribution across SPVC originating nodes for routing of connections across one link. The latter factor is explained as follows. If most or all of the connections are concentrated in one switch or node that has a small window, and if that switch were to go down, then rerouting would be extremely slow. Assigning a large window to the switch would help to improve flow control. Therefore, if connections are concentrated in a few nodes, then larger windows are optimal for those nodes. If connections are not concentrated in a few nodes, then smaller windows are optimal for the nodes.
A more efficient scheme uses a dynamically sized window based on network-wide congestion indications. Each switch in the network has an impending congestion monitor. The monitor maintains counters of pending connection add and delete requests. For one embodiment, the monitor's thresholds are set to one-half the resource connection manager mild congestion thresholds to act as an early warning that congestion is building. At every switch, the impending network-wide congestion status or indication is recorded in every outgoing connect message.
If there is local node setup congestion (Block 375), SSCOP drops setup messages (Block 380). When all congestion abates (Block 385), the call control 240 processes setup, connect, and release messages on a first-come, first-serve basis (Block 390). A ten second timeout is implemented for each setup or connect message that is dropped at SSCOP.
The SPVC manager 200 monitors network-wide congestion information in connect messages that the SPVC manager 200 receives. Thus a connect message with a network-wide congestion indicator set as shown in Block 374 of
The SPVC manager 200 of
The method described above can be stored in the memory of a computer system as a set of instructions to be executed. The instructions to perform the method described above could alternatively be stored on other forms of machine-readable media, including magnetic and optical disks. For example, the method of embodiments of the present invention could be stored on machine-readable media, such as magnetic disks or optical disks, which are accessible via a disk drive (or computer-readable medium drive). Further, the instructions can be downloaded into a computing device over a data network in a form of compiled and linked version.
Alternatively, the logic to perform the methods as discussed above could be implemented by computer and/or machine readable media, such as discrete hardware components, large-scale integrated circuits (LSI's), application-specific integrated circuits (ASIC's), firmware such as electrically erasable programmable read-only memory (EEPROM's); and be implemented by electrical, optical, acoustical, and other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.), etc.
Although the present invention has been described with reference to specific exemplary embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
Number | Name | Date | Kind |
---|---|---|---|
3988545 | Kuemmerle et al. | Oct 1976 | A |
4238851 | Takahashi et al. | Dec 1980 | A |
4475192 | Fernow et al. | Oct 1984 | A |
4491945 | Turner | Jan 1985 | A |
4494230 | Turner | Jan 1985 | A |
4499576 | Fraser | Feb 1985 | A |
4506358 | Montgomery | Mar 1985 | A |
4561090 | Turner | Dec 1985 | A |
4626624 | Daisenberger | Dec 1986 | A |
4644533 | Braff et al. | Feb 1987 | A |
4654654 | Butler et al. | Mar 1987 | A |
4679190 | Dias et al. | Jul 1987 | A |
4703475 | Dretzka et al. | Oct 1987 | A |
4703477 | Adelmann et al. | Oct 1987 | A |
4757529 | Glapa et al. | Jul 1988 | A |
4771424 | Suzuki et al. | Sep 1988 | A |
4771425 | Baran et al. | Sep 1988 | A |
4819228 | Baran et al. | Apr 1989 | A |
4819230 | Calvignac et al. | Apr 1989 | A |
4839891 | Kobayashi et al. | Jun 1989 | A |
4894824 | Hemmady et al. | Jan 1990 | A |
4903261 | Baran et al. | Feb 1990 | A |
4905233 | Cain et al. | Feb 1990 | A |
4914650 | Sriram | Apr 1990 | A |
4939718 | Servel et al. | Jul 1990 | A |
4974224 | Boone | Nov 1990 | A |
5020058 | Holden et al. | May 1991 | A |
5062106 | Yamazaki et al. | Oct 1991 | A |
5067074 | Farel et al. | Nov 1991 | A |
5072449 | Enns et al. | Dec 1991 | A |
5088032 | Bosack | Feb 1992 | A |
5090011 | Fukuta et al. | Feb 1992 | A |
5115431 | Williams et al. | May 1992 | A |
5119367 | Kawakatsu et al. | Jun 1992 | A |
5128932 | Li | Jul 1992 | A |
5130978 | Mobasser | Jul 1992 | A |
5140584 | Suzuki | Aug 1992 | A |
5267232 | Katsube et al. | Nov 1993 | A |
5278830 | Kudo | Jan 1994 | A |
5280483 | Kamoi et al. | Jan 1994 | A |
5295183 | Langlois et al. | Mar 1994 | A |
5313454 | Bustini et al. | May 1994 | A |
5349579 | Madonna et al. | Sep 1994 | A |
5359592 | Corballis et al. | Oct 1994 | A |
5377327 | Jain et al. | Dec 1994 | A |
5473604 | Lorenz et al. | Dec 1995 | A |
5519690 | Suzuka et al. | May 1996 | A |
5548533 | Gao et al. | Aug 1996 | A |
5590118 | Nederlof | Dec 1996 | A |
5600798 | Cherukuri et al. | Feb 1997 | A |
5703870 | Murase | Dec 1997 | A |
5751969 | Kapoor | May 1998 | A |
5831973 | Yokotani et al. | Nov 1998 | A |
5835484 | Yamato et al. | Nov 1998 | A |
5898691 | Liu | Apr 1999 | A |
5912879 | Cha et al. | Jun 1999 | A |
5970048 | Pajuvirta et al. | Oct 1999 | A |
6018519 | Ginzboorg | Jan 2000 | A |
6032188 | Mairs et al. | Feb 2000 | A |
6169727 | Song | Jan 2001 | B1 |
6192422 | Daines et al. | Feb 2001 | B1 |
6201810 | Masuda et al. | Mar 2001 | B1 |
6275493 | Morris et al. | Aug 2001 | B1 |
6282197 | Takahashi et al. | Aug 2001 | B1 |
6304549 | Srinivasan et al. | Oct 2001 | B1 |
6356629 | Fourie et al. | Mar 2002 | B1 |
6366582 | Nishikado et al. | Apr 2002 | B1 |
6424620 | Nishihara | Jul 2002 | B1 |
6434152 | Yamamura | Aug 2002 | B1 |
6442140 | Kirschenbaum | Aug 2002 | B1 |
6456600 | Rochberger et al. | Sep 2002 | B1 |
6463476 | Milles | Oct 2002 | B1 |
6477143 | Ginossar | Nov 2002 | B1 |
6560654 | Fedyk et al. | May 2003 | B1 |
6563809 | Proctor, Jr. et al. | May 2003 | B1 |
6563835 | Chen | May 2003 | B1 |
6614762 | Illiadis et al. | Sep 2003 | B1 |
6625121 | Lau et al. | Sep 2003 | B1 |
6690653 | Anbiah et al. | Feb 2004 | B1 |
6725378 | Schuba et al. | Apr 2004 | B1 |
6967924 | Aimoto | Nov 2005 | B1 |
20020080721 | Tobagi et al. | Jun 2002 | A1 |
20040071086 | Haumont et al. | Apr 2004 | A1 |
20050060400 | Mannepalli et al. | Mar 2005 | A1 |
Number | Date | Country |
---|---|---|
0374928 | Jun 1990 | EP |
0444395 | Sep 1991 | EP |
WO 9301670 | Jan 1993 | WO |
WO 9319551 | Sep 1993 | WO |
WO 9320637 | Oct 1993 | WO |
WO 9501076 | Jan 1995 | WO |
WO 0047011 | Aug 2000 | WO |