CA2292079A1 - System and method for enhanced routing and reservation protocol - Google Patents

System and method for enhanced routing and reservation protocol Download PDF

Info

Publication number
CA2292079A1
CA2292079A1 CA002292079A CA2292079A CA2292079A1 CA 2292079 A1 CA2292079 A1 CA 2292079A1 CA 002292079 A CA002292079 A CA 002292079A CA 2292079 A CA2292079 A CA 2292079A CA 2292079 A1 CA2292079 A1 CA 2292079A1
Authority
CA
Canada
Prior art keywords
connection
communication link
enhanced
router
new connection
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
CA002292079A
Other languages
French (fr)
Inventor
Shmuel Shaffer
William J. Beyda
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens Communications Inc
Original Assignee
Siemens Information and Communication Networks 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 Siemens Information and Communication Networks Inc filed Critical Siemens Information and Communication Networks Inc
Publication of CA2292079A1 publication Critical patent/CA2292079A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/822Collecting or measuring resource availability data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/22Alternate routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/302Route determination based on requested QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/72Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/74Admission control; Resource allocation measures in reaction to resource unavailability
    • H04L47/745Reaction in network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/76Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
    • H04L47/765Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the end-points
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/80Actions related to the user profile or the type of traffic
    • H04L47/805QOS or priority aware

Abstract

A network node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) and a method of dynamically reconfiguring routes of established connections in a communications system (52;110) operate to provide the optimal path for a new connection based on a priority status of the new connection. The optimal path is provided even when a communication link (36, 38, 40 and 42; 152, 154, 156, 158, 160, 162, 164, 166 and 168) on the optimal path does not have a sufficient amount of available bandwidth to accommodate the new connection. The network node operates in conjunction with other network nodes in the system to reroute one or more established connections that have reserved bandwidth on a communication link on the optimal route and have a lower priority status than the new connection, thereby increasing the available bandwidth on the communication link to accommodate the new connection. The network node also performs conventional functions of a router. The network node and the method can be implemented in any communications system where information is transmitted in packets, blocks, frames or cells. The network node includes a reroute-signal generator (98), a network monitor (96) and a reservation unit (100) that operate with a CPU (94) of the node to perform the rerouting operation.

Description

SYSTEM AND METHOD FOR ENHANCED ROUTING
AND RESERVATION PROTOCOL
TECHNICAL FIELD
The invention relates generally to communications networks and more particularly to a system and a method for routing data through multiple network nodes.
DESCRIPTION OF THE RELATED ART
Various communications systems require routing of voice and data packets, blocks, frames or cells (collectively referred to herein as Apackets-) through two or more network nodes via communication links to provide connectivity between sites that are located at different networks. In 1s a sophisticated communications system, the nodes that provide the connec-tivity between the networks operate using a routing algorithm that allows prioritization of packets that are relayed through the nodes. For example, voice packets are typically placed ahead of data packets because the voice packets carry real-time information.
2o In addition to prioritization of packets, the nodes may be configured to monitor the topology of the system, including the status of the communication links. The link status information may include the operational state and the remaining available bandwidth for each communication link in the system. Using the link status information, the nodes compute routing 2s paths to establish new connections. A reservation protocol may be utilized by the nodes to reserve bandwidth on one or more communication links that define the computed routing paths. Such reservation protocol may be necessary to guarantee space on each communication link along the routing paths. The computed routing paths may vary depending on routing 3o parameters that are being utilized by a particular node. The routing parame-ters may include the number of hops, the amount of toll charge associated with the path, and the distance between the two connecting nodes.
In a normal packet traffic condition, the path chosen by a source node (i.e., the network node associated with a connection-originating 35 network) may be the optimal path in accordance with the prescribed routing parameters. However, when a communication link in the optimal path is over-crowded with reservations of established connections, the source node may be forced to route the new connection through a less preferred path. A
concern is that bandwidth of the over-crowded communication link may be depleted due to a number of low priority connections that have been previously routed through the now over-crowded communication link. The s problem arises when the pending connection to be made is a high priority connection, such as a connection for voice data transmission. The connec-tivity resources of the system are not being utilized efficiently when the high priority connection must be routed through a less preferred path, because the optimal path is being utilized by the lower priority connections.
~o The problem will be further described with reference to Fig. 1.
In Fig. 1, a prior art communications system 10 having networks 12, 14, 16 and 18 is shown. The networks 12B18 are illustrated as local area networks (LANs). However, the networks 12B18 can be other types of network, such as wide area networks (WANs) or metropolitan area networks (MANs). Each ~5 LAN 12B18 can support a number of sites that may be physically located in a confined area, such as an office building, a building complex or a campus.
For simplification, only the LANs 12 and 18 are shown with a number of associated sites. The LAN 12 includes sites 20, 22 and 24. The LAN 18 includes sites 26, 28 and 30. At each site 20B30, a computer 32 and/or a 2o telephone 34 may be connected to their respective network.
The LANs 12B18 are interconnected by communication links 36, 38, 40 and 42. The communication links 36, 38, 40 and 42 may be in a form of physical communication links, such as fiber optic cables, or in a form of wireless communication links. The communication links 36B42 provide 25 connectivity between nodes 44, 46, 48 and 50. The communication link 36 connects the node 44 to the node 46. The communication link 38 connects the node 44 to the node 50. The communication link 40 connects the node 46 to the node 50. The communication link 42 connects the node 48 to the node 50. The nodes 44B50 may be gateways, switches or routers having 3o prioritizing and routing capabilities. However, the nodes 44B50 are identified in Fig. 1 as routers. Each router 44B50 is associated with one of the LANs 12, 14, 16 and 18. The router 44 is associated with the LAN 12, while the router 46 is associated with the LAN 14. The router 48 is associated with the LAN 16, whereas the router 50 is associated with the LAN 18.
The above-described problem may arise in the following man-ner. Initially, the packet traffic on the communication links 36B42 is light and much of the bandwidth on each of the links is available. One of the sites at LAN 12, for example the site 20, may request a data connection to another site at LAN 18, for example the site 26. Assuming that the optimal path for the data connection from LAN 12 to LAN 18 is through the communication link 38, the router 44 responds to the request by reserving the required band-width on the communication link 38. As additional data connections are made through the communication link 38, the available bandwidth on the communication link 38 may be down to 5% of its capacity. The established connections through the communication link 38 may include many data o connections that have a lower priority than voice connections. At such time, a site at LAN 12, for example the site 24, requests a voice connection to a site at LAN 18, for example the site 28. This voice connection requires 10%
of the total bandwidth of the communication link 38. When this request is received by the router 44, the router 44 has no choice except to route the ~s voice connection through the communication links 36 and 40 via the router due to lack of sufficient bandwidth remaining on the communication link 38, even though the optimal path is through the communication link 38.
The compulsory routing of the voice connection through the router 46 can have a negative effect on the packet traffic at the router 46.
2o Since the voice connection has a high priority, the router 46 must relay the packets of the voice connection ahead of lower priority packets that are being transmitted through the established connections via the router 46. The newly introduced voice connection may cause congestion and may increase the probability of dropped packets at the router 46. In addition, the conventional 2s routing technique inefficiently utilizes the connectivity resources of the system 10, since the high priority connection is routed through the less preferred path, while the optimal path for the high priority connection is occupied by the lower priority connections.
What is needed is a communications system and a method that 3o can efficiently utilize the connectivity resources of the system to provide the best possible paths for connections according to the priority status of the connections, regardless of the order that the connections were established.

SUMMARY OF THE INVENTION
In accordance with the present invention, a network node and a method of dynamically reconfiguring routes of established connections in a communications system operate to provide the optimal path for a new connection based on a priority status of the new connection. The optimal path is provided even when a communication link along the optimal path does not have a sufficient amount of available bandwidth to accommodate the new connection. The network node operates in conjunction with other network nodes in the system to reroute one or more established connections that have reserved bandwidth on a communication link on the optimal route and ~o have a lower priority status than the new connection, thereby increasing the available bandwidth on the communication link to accommodate the new connection. The network node also performs conventional functions of a router. Therefore, the network node will be referred to as an Aenhanced router.- The enhanced router and the method can be implemented in any ~ 5 communications system in which information is transmitted in packets, blocks, frames or cells (collectively referred herein as Apackets=).
In the preferred embodiment, the enhanced router operates to monitor the status of communication links in the system by exchanging the status information with other network nodes. The link status includes the 2o available bandwidth on the communication links and the priority status of each presently established connection that is routed through at least one of the communication links. Preferably, every network node in the system is an enhanced router. A network monitor within the enhanced router keeps track of the link status of communication links that are coupled to the enhanced 2s router by recording information regarding new connections that have been routed by the enhanced router and regarding termination of established connections that had been routed through the enhanced router. The network monitor shares the link status information with network monitors of other enhanced routers throughout the system to monitor the current status of so every communication link. The link status information is utilized by the enhanced routers to perform the rerouting operation.
When a request signal for a new connection is received at the enhanced router from an associated network, such as a local area network (LAN), a central processing unit (CPU) of the enhanced router computes the 35 optimal path for the new connection using a routing protocol that is stored in memory. The request signal includes information regarding the required bandwidth for the new connection and the priority status of the new connection. The CPU determines the priority status of the new connection by utilizing a prioritization protocol that is also stored in memory. The enhanced router associated with the originating network of the new connection will be referred to as the Asource enhanced router.- The enhanced router associated with the terminating network of the new connections will be referred to as the Adestination enhanced router.- The optimal path is the best course from the source enhanced router to the destination enhanced router through one or more communication links in accordance with prescribed routing parameters. The routing parameters may include the o number of hops, the amount of toll charge associated with the path, and the distance between the two connecting enhanced routers.
Using the link status information provided by the network moni-tor, the CPU of the source enhanced router determines whether a sufficient amount of available bandwidth exists on each communication link on the ~5 optimal route to accommodate the new connection. If a particular communi-cation link on the optimal route does not have the sufficient amount of avail-able bandwidth, the CPU determines whether there are established connec-tions having a lower priority status than the new connection. The particular communication link will be referred to as the Atarget link- for clarity. If there 2o are established connections having a lower priority status, the CPU deter-mines whether removing one or more of these established connections from the target link will increase the available bandwidth on the target link suffi-ciently to accommodate the new connection.
After a positive determination that removing one of more of the 2s established connections will accommodate the new connection, the source enhanced router operates to reroute one of the established connections through an alternate path to bypass the target link. In one embodiment, a reroute-signal generator of the source enhanced router transmits reroute signals to the end enhanced routers, i.e., the source and destination so enhanced routers of the established connection that is to be rerouted. The end enhanced routers then transmit acknowledgment signals to the source enhanced router for confirmation, utilizing their respective reroute-signal generators. Next, one of the end enhanced routers, e.g., the destination enhanced router of the established connection, transmits reservation signals 35 using a reservation unit to every enhanced router on the alternate path to reserve bandwidth on all of the communication links on the alternate path.
The end enhanced routers then terminate the established connection and re-establish the established connection through the alternate path, bypassing the target link. In a situation where the source enhanced router of the new connection is also one of the end enhanced routers, the source enhanced router will perform the functions that are associated with the source enhanced router and the end enhanced router.
In another embodiment, the source enhanced routers transmit the reroute signals to the enhanced routers that are located at the ends of the target link. These enhanced routers will be referred to as the Atarget routers. A The target routers then transmit acknowledgment signals to the 1o source enhanced router in response to the reroute signals. In this embodi-ment, the target routers operate to redirect a portion of the established connection that is routed through the target link. This is accomplished by rerouting that portion through a secondary path from one target router to the other target router that bypasses the target link. Initially, one of the target ~5 routers transmits one or more reservation signals to the enhanced routers on the secondary path to reserve bandwidth on the communication links on the secondary path. Next, the portion of the established connection through the target link is terminated and connected through the secondary path. In a situation in which the source enhanced router is also one of the target 2o routers, the source enhanced router will perform the functions that are associated with the source enhanced router and the target router.
The above procedure for removing an established connection from the target link may be repeated to remove additional established connections, if necessary, to increase the available bandwidth on the target 2s link to accommodate the new connection. In addition, the entire process for removing one or more established connections from the target link may be repeated for other communication links on the optimal path, if necessary.
After all of the communication links on the optimal path have been prepared for the new connection, the source enhanced routers transmit 3o reservation signals to every enhanced router on the optimal path to reserve bandwidth on the communication links on the optimal path for the new connection. Lastly,~the new connection is established through the optimal path.

BRIEF DESCRIPTION OF THE DRAWINGS
Fig. 1 is a schematic illustration of a prior art communications system with conventional routers.
Fig. 2 is a schematic illustration of a communications system with enhanced routers in accordance with the present invention.
s Fig. 3 is a flow diagram of a method of dynamically reconfigur-ing established connections in the system of Fig. 2 in accordance with the present invention.
Fig. 4 is a block diagram of the enhanced router in accordance with the present invention.
o Fig. 5 is a schematic illustration of a complex communications system with enhanced routers in accordance with the present invention.
DETAILED DESCRIPTION
~ 5 With reference to Fig. 2, a communications system 52 in accordance with the present invention is shown. When applicable, the reference numerals of Fig. 1 will be used for the same components depicted in Fig. 2. The communications system 52 includes the networks 12, 14, 16 and 18. The networks 12B18 may be conventional networks, such as LANs, 2o WANs or MANs. In addition, the networks 12B18 may be of a single type of network or a combination of one or more different types of networks.
Each LAN 12B18 can support a number of sites, such as the sites 20, 22 and 24 or the sites 26, 28 and 30. For simplification, only the LANs 12 and 18 are shown with sites. Each site 20B30 may include a 2s computer 32 and/or a telephone 34 that provide a means to communicate with other sites in the communications system 52. The LANs 12, 14, 16 and 18 are associated with enhanced routers 54, 56, 58 and 60, respectively.
The enhanced routers 54B60 are interconnected by the communication links 36, 38, 40 and 42. The communication links 36B42 may be in a form of so physical communications links, such as fiber optic cables, or in a form of wireless communications links.
The enhanced routers 54860 operate to route a new high priority connection through an optimal path, even when bandwidth of a communication link on the optimal path has been depleted by established 3s connections. The enhanced routers 54B60 provide the optimal route for the _$_ high priority connection by rerouting one or more of the established connections having a lower priority through a less preferred path. The rerouting of established connections increases the available bandwidth on the communication link, thereby allowing the high priority connection to be made through the optimal path.
The rerouting operation of the enhanced routers 54B60 will be s described with reference to Fig. 3. Fig. 3 is a flow diagram of a method for dynamically reconfiguring established connections in the communications system of Fig. 2. For simplification, the primary focus of the description will be network connections made between the LANs 12 and 18. The optimal path for the connections is assumed to be the path provided by the communi-o cation link 38 that connects the enhanced routers 54 and 60. This optimal path may be computed by one of the enhanced routers 54 and 60 when such connection is being initiated using one or more routing parameters. The rout-ing parameters may include the number of hops, the toll charge associated with the path, and the distance between two connecting enhanced routers.
~s Initially, at step 62, the status of each communication link 36B42 is monitored by the enhanced routers 54B60. The link status includes the available bandwidth on the communication links 36B42 and the priority status of any established connections through the communication links 36842. The link status may also include the operational state of the 2o communication links 36B42. Each enhanced router 54B60 is able to monitor the status of the adjacent communication links 36-42 by keeping track of information regarding the status of the adjacent communication links. For example, the enhanced router 54 will be able to monitor the status of the communication links 36 and 38 by keeping track of new connections that are 2s established by the enhanced router 54 and terminated connections that had been routed through the enhanced router 54. The information attained by each enhanced router 36B42 is disseminated among the enhanced routers to continually monitor the current status of the communication links 36B42.
At step 64, a request for a connection from an originating site 3o from the LAN 12 is received by the enhanced router 54. For example, the enhanced router 54 may receive the request from the site 20 of the LAN 12, seeking a connection to the site 26 of the LAN 18. The request may include information regarding the required bandwidth for the connection and the priority status of the connection. Next, at step 66, the enhanced router 54 35 computes the optimal path for the requested connection, using the prescribed routing parameters. As stated above, the optimal path from the LAN 12 to the LAN 18 is through the communication link 38. At step 68, the enhanced router 54 determines whether the communication link 38 has a sufficient amount of remaining bandwidth to accommodate the requested connection.
If so, at step 70, the enhanced router 54 transmits a reservation signal to the enhanced router 60 in order to reserve bandwidth on the communication link s 38 to accommodate the requested connection. At the following step 72, the requested connection is established through the optimal path via the com-munication link 38. The reservation of bandwidth through the communication link 38 ensures that packets for the new connection can be routed through the communication link 38, even when packet traffic increases on the com-o munication link 38.
However, if the enhanced router 54 determines that the com-munication link 38 does not have the sufficient amount of remaining band-width at step 68, the process proceeds to step 74. At step 74, the enhanced router 54 compares the priority status of the requested connection with the ~s priority status of established connections that have reserved bandwidth on the communication link 38 to determine whether any established ccnnection has a lower priority status than the requested connection. The priority status may include a number of levels. The number of levels for the priority status is not critical to the invention. If there is no established connection having a 20 lower priority status than the requested connection, the process proceeds to step 76. At step 76, the enhanced router 54 transmits reservation signals through a secondary path, the less preferred path. The secondary path from the enhanced router 54 to the enhanced router 60 is through the communica-tion links 36 and 40 via the enhanced router 56. The reservation signals are 2s directed to the enhanced routers 56 and 60 to reserve bandwidth on the communication links 36 and 40. Next, at step 78, the requested connection is established through the secondary path via the communication links 36 and 40.
On the other hand, if an established connection with a lower so priority status than the requested connection does exist, the process pro-ceeds to step 80. At step 80, the enhanced router 54 determines whether the amount of bandwidth that has been reserved by one or more lower priority connections, when added to the remaining bandwidth on the communication link 38, is sufficient to accommodate the requested connection. If the answer 35 is negative, the process proceeds to step 76. If the answer is positive, a reroute signal with a protocol element R is transmitted to the enhanced router 60 by the enhanced router 54, at step 82, seeking authorization to reroute one or more of the lower priority connections through the secondary route.
At step 84, the enhance router 54 receives an acknowledgment signal from the enhanced router 60 in response to the reroute signal. Next, at step 86, the enhanced router 54 reads the acknowledgment signal to s determine whether the enhanced router 60 has approved the request to reroute. If the acknowledgment signal indicates that the reroute is not authorized, the process proceeds to step 76. However, if authorized, reservation signals are transmitted by the enhanced router 54 through the secondary path, at step 88. The signals are directed to the enhanced routers 0 56 and 60 to reserve bandwidth through the communication links 36 and 40 to accommodate the lower priority connections that are to be rerouted. Next, at step 90, one or more of the lower priority connections are rerouted through the secondary route. The amount of bandwidth reserved at step 78 will vary depending upon the required bandwidth to accommodate the rerouted lower 15 priority connections. The process then proceeds to step 70 to establish the requested connection through the optimal path.
Turning to Fig. 4, components of the enhanced router 54 are shown. Since the enhanced routers 54B60 are identical, the enhanced router 54 is representative of the other enhanced routers 56, 58 and 60.
2o The enhanced router 54 includes an interface 92, a central processing unit (CPU) 94, a network monitor 96, a reroute-signal generator 98, a reservation unit 100, and memory 102. These components of the enhanced router 54 operate in conjunction with components of the other enhanced routers 56, 58 and 60 to manipulate connections throughout the system 52 in order to 25 ensure optimal connectivity between the LANs 12B18.
The interface 92 includes input/output (I/0) terminals 104, 106 and 108. The interface 92 may include additional I/0 terminals, depending on the network topology. The number of I/O terminals is not critical. The I/O terminal 104 is communicatively coupled to the LAN 12. The I/O terminal 30 106 is coupled to the communication link 36, while the I/O terminal 108 is coupled to the communication link 38. The interface 92 allows the enhanced router 54 to relay packets of information to and from the LAN 12 and the routers 56 and 60.
The CPU 94 is coupled to the interface 92 to process packets 3s that are being relayed by the enhanced router 54. The CPU 94 is also coupled to the network monitor 96, the reroute-signal generator 98, the reservation unit 100 and memory 102. The CPU 94 operates with compo-nents 96B102 of the enhanced router 54 to perform a number of operations.
When a request for a new connection is received by the interface 92, the CPU 94 determines the priority status of the new connection by utilizing a prioritization protocol stored in memory 102. Various factors may be taken into account to determine the priority status of the new connection, such as s the type of connection, the originating site, the destination site, and the required bandwidth. In addition, the CPU 94 determines the optimal route utilizing a routing protocol, also stored in memory, along with information provided by the network monitor 96. The routing protocol may utilize one or more of the routing parameters that were listed in reference to Fig. 3.
The network monitor 96 keeps track of~the status of the com-munication links 36-42 by recording information regarding new connections that are made through the enhanced router 54 and termination of established connections that had been routed through the enhanced router 54. The network monitor 96 shares this information with other network monitors of the ~5 enhanced routers 56B60 to monitor the current status of the communication links 36B42. The sharing of link status information may involve periodically transmitting an update signal among the enhanced routers 56B60. The manner in which network nodes share information is known in the art. This information is utilized by the CPU 94 to make decisions during a new connec-2o tion set-up. The information concerning remaining bandwidth on the com-munication link 38 may be utilized by the CPU 94 to determine whether the new connection may be routed through the communication link 38 without the need to redirect established connections that have been routed through the communication link 38. In addition, the information concerning the priority 2s status of the established connections through the communication link 38 may be utilized by the CPU 94 to determine whether any established connection has a lower priority status than the new connection that is in the process of being routed. Furthermore, the information concerning bandwidth reserved by the lower priority connection may be utilized by the CPU 94 to determine ao whether the communication link 38 can accommodate the new connection, if one or more of the lower priority connections are rerouted through an alter-nate path, bypassing the communication link 38.
The reroute-signal generator 98 provides the reroute signals that are used by the enhanced router 54 to request rerouting of certain estab-35 lished connections. In addition, the reroute-signal generator 98 provides the acknowledgment signals that are transmitted in response to a reroute signal from another enhanced router. The reservation unit 100 generates the reser-vation signals that are used to reserve bandwidth on selected communication links. The reroute signals, the acknowledgment signals and the reservation signals are transmitted to appropriate destinations by the CPU 94.
In one embodiment, the network monitor 96, the reroute-signal generator 98 and the reservation unit 100 are separate devices that include s solely hardware to perform their respective functions. In another embodi ment, these devices include firmware, in addition to hardware, to perform their respective functions. In the preferred embodiment, these devices are embodied in an algorithm executed by the CPU 94.
The enhanced routers, such as the enhanced router 54, may be o implemented in a more complex communications system than the system 52 of Fig. 2. In Fig. 5, a communications system 110 that includes LANs 112B128 is shown. The LANs 112, 114, 116, 118, 120, 122, 124, 126 and 128 are associated with enhanced routers 130, 132, 134, 136, 138, 140, 142, 144 and 146, respectively. The enhance routers 1308146 are ~s interconnected by communication links 152, 154, 156, 158, 160, 162, 164, 166 and 168.
The rerouting operation performed by the enhance routers 130B146 to connect a high priority connection through an optimal route is similar to the rerouting operation performed by the enhanced routers 54860 20 of Fig. 2. The difference is that an optimal path for a connection in the system 110 may include more communication links. Therefore, additional communication links may be required to be examined by the enhanced routers 130B146 during a new connection set-up.
The rerouting operation performed by the enhanced routers 2s 130B146 will be described with an example of a high priority connection being initiated from the LAN 112 to the LAN 124. The high priority connection to be made requires 10% of the bandwidth capacity of the communication link 160. In this example, there is a sufficient amount of remaining bandwidth on the communication links 152 and 164. However, 30 95% of bandwidth available on the communication link 160 has been reserved by established connections between various networks.
Initially, a request signal for the new connection is received by the associated enhanced router 130 from the LAN 112. The enhanced router 130 computes the optimal path in response to the request signal, using the 3s routing protocol. The optimal path will be assumed to be through the com-munication links 152, 160 and 164. Since the communication link 160 cannot accommodate the new connection, the enhanced router 130 examines the established connections that have reserved bandwidth on the communication link 160. If there are established connections that have a lower priority status than the requested connection, one or more of these established connections are selected to be rerouted. The number of lower priority connections that are selected to be rerouted will depend on the required bandwidth of the new connection and the amount of bandwidth reserved by each of the lower priority connections. Assuming that a lower priority connection between the enhanced routers 132 and 144 has reserved 7% of the bandwidth capacity of the communication link 160, this connection may be selected by the enhanced router 130 to be rerouted.
1 o After the enhanced router 130 has selected the lower priority connection to be rerouted, the enhanced router 130 transmits reroute signals to appropriate enhanced routers. In one embodiment, the reroute signals are transmitted to the enhanced routers 136 and 140. The enhanced routers 136 and 140 then transmit acknowledgment signals to the enhanced router 130 in ~ 5 response to the reroute signals. In this embodiment, the enhanced routers 136 and 140 operate in conjunction to reroute a portion of the path of the selected lower priority connection, i.e., from the enhanced router 136 to the enhanced router 140, through the enhanced router 138 via the communication links 158 and 162. The rerouting may involve one of the 2o enhanced routers 136 and 140 sending a reservation signal to the enhanced router 138 to reserve bandwidth on the communication links 158 and 162.
After the reservation is made, the enhanced routers 136 and 140 establish the selected lower priority connection through the enhanced router 138.
In another embodiment, the enhanced router 130 transmits the 25 reroute signals to the end enhanced routers of the selected lower priority connection, i.e., the enhanced routers 132 and 144. The enhanced routers 132 and 144 then transmit acknowledgment signal to the enhanced router 130 in response to the reroute signals. Next, the enhanced routers 132 and 144 terminate the selected lower priority connection and then re-establish the so connection through the enhanced router 138, bypassing the communication link 160. For example, one of the enhanced routers 132 and 144 may reserve bandwidthwon the communication links 154, 158, 162 and 166. After the reservations, the terminated connection is re-established through the reserved communication links 154, 158, 162 and 166.
35 After the selected lower priority connection has been rerouted, the enhanced router 130 transmits reservation signals to the enhanced routers 136, 140 and 142 to reserve sufficient bandwidth on the communi-cation links 152, 160 and 164 to accommodate the new connection. Once the communication links 152, 160 and 164 have been reserved, the new high priority connection is established through the optimal route.
This process of rerouting selected lower priority connections to increase available bandwidth on a particular communication link can be repeated on other communication links on the optimal path, when required.
Therefore, in the above example, if the available bandwidth on the communi-cation link 152 was not sufficient to accommodate the new high priority connection, the above-described rerouting procedure would have been performed with respect to the communication link 152 to reroute one or o more lower priority connections that have reserved bandwidth on the communication link 152. The rerouting procedure ensures that high priority connections, such as voice connections, will be routed through an optimal path, even when communication links on the optimal path have been reserved by established lower priority connections.
~s In situations in which the enhanced router that is initiating the new connection is also one of the enhanced routers that is directly involved in the rerouting of an established connection, that enhanced router will perform the functions that are associated with both of the enhanced routers.
2s 3s

Claims (10)

WHAT IS CLAIMED IS:
1. A method of dynamically reallocating connectivity resources in a communications network (52; 110) to accommodate routing of a new connection through a primary path comprising steps of:
monitoring (62) a plurality of established connections that are routed through a communication link (36, 38, 40 and 42; 152, 154, 156, 158, 160, 162, 164, 166 and 168) that at least partially defines said primary path, said primary path being from a source node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) to a destination node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146);
receiving (64) a request to establish said new connection from said source node to said destination node;
selectively rerouting (90) a particular connection from said plurality of said established connections though a secondary path in response to said request such that said communication link is bypassed by said secondary path; and establishing (72) said new connection through said primary path via said communication link.
2. The method of claim 1 further comprising a step of selecting (74 and 80) said particular connection from said plurality of said established connections, said selection being at least partly determined by a priority status of said particular connection.
3. The method of claim 2 wherein said step of selecting (74 and 80) said particular connection includes determining (74) whether said particular connection is a data connection for said selection, and wherein said step of receiving (64) said request is a step of receiving said request to establish a voice connection.
4. The method of claim 1, 2 or 3 wherein said step of selectively rerouting (90) said particular connection includes redirecting a portion of said particular connection that had been routed through said communication link (36, 38, 40 and 42; 152, 154, 156, 158, 160, 162, 164, 166 and 168) such that said redirected portion circumvents said communication link.
5. The method of claim 1, 2, 3 or 4 further comprising a step of transmitting (88) a reroute signal from said source node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) to a node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) associated with said particular connection to request rerouting of said particular connection.
6. The method of claim 1, 2, 3, 4 or 5 further comprising a step of receiving (84) at said source node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) an acknowledgment signal from said node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) associated with said particular connection in response to said reroute signal.
7. A network node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) in a communications system (52; 110) comprising:
an interface (92) for receiving and transmitting data;
a processor (94) operatively associated with said interface for signal processing said data, said processor configured to compute a primary path through said system for a new connection when requested;
a monitoring device (96) operatively associated with said processor for monitoring a status of a communication link (36, 38, 40 and 42;
152, 154, 156, 158, 160, 162, 164, 166 and 168) on said primary path; and a signal generator (98) operatively coupled to said processor for producing a reroute signal in response to a request signal received by said processor to route said new connection, said signal generator configured to produce said reroute signal when available bandwidth on said communication link is insufficient to accommodate said new connection.
8. The node (54, 56, 58 and 60; 130, 132, 134, 136, 138, 140, 142, 144 and 146) of claim 17 further comprising memory (102) that is operatively associated with said processor (94) and said signal generator (98), said memory containing a prioritization protocol that is utilized by said processor to determine a priority status of said new connection.
9. The node of claim-8 wherein said prioritization protocol (102) is configured to identify (64) whether said new connection is a voice data connection to determine said priority status of said new connection.
10. The node of claim 7, 8 or 9 further comprising a reservation device (100) coupled to said processor (94), said reservation device configured to generate a reservation signal to reserve bandwidth on an associated communication link (36, 38, 40 and 42; 152, 154, 156, 158, 160, 162, 164, 166 and 168), when requested by said processor.
CA002292079A 1998-12-15 1999-12-13 System and method for enhanced routing and reservation protocol Abandoned CA2292079A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US09/212,513 US6657965B1 (en) 1998-12-15 1998-12-15 System and method for enhanced routing and reservation protocol
US09/212,513 1998-12-15

Publications (1)

Publication Number Publication Date
CA2292079A1 true CA2292079A1 (en) 2000-06-15

Family

ID=22791339

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002292079A Abandoned CA2292079A1 (en) 1998-12-15 1999-12-13 System and method for enhanced routing and reservation protocol

Country Status (4)

Country Link
US (1) US6657965B1 (en)
EP (1) EP1011230B1 (en)
CA (1) CA2292079A1 (en)
DE (1) DE69924345T2 (en)

Families Citing this family (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6747959B1 (en) 1998-10-07 2004-06-08 At&T Corp. Voice data integrated mulitaccess by self-reservation and blocked binary tree resolution
US6963545B1 (en) 1998-10-07 2005-11-08 At&T Corp. Voice-data integrated multiaccess by self-reservation and stabilized aloha contention
WO2001003380A1 (en) * 1999-07-02 2001-01-11 Fujitsu Limited Service allotting device
US6954739B1 (en) * 1999-11-16 2005-10-11 Lucent Technologies Inc. Measurement-based management method for packet communication networks
JP2001223744A (en) * 2000-02-09 2001-08-17 Nec Corp System and method for designing route
US6850981B1 (en) 2000-07-14 2005-02-01 At&T Corp. System and method of frame scheduling for QoS-driven wireless local area network (WLAN)
US6950397B1 (en) 2000-07-14 2005-09-27 At&T Corp. RSVP/SBM based side-stream session setup, modification, and teardown for QoS-driven wireless lans
US7068632B1 (en) 2000-07-14 2006-06-27 At&T Corp. RSVP/SBM based up-stream session setup, modification, and teardown for QOS-driven wireless LANs
US7031287B1 (en) 2000-07-14 2006-04-18 At&T Corp. Centralized contention and reservation request for QoS-driven wireless LANs
US7151762B1 (en) 2000-07-14 2006-12-19 At&T Corp. Virtual streams for QoS-driven wireless LANs
US6804222B1 (en) 2000-07-14 2004-10-12 At&T Corp. In-band Qos signaling reference model for QoS-driven wireless LANs
US6970422B1 (en) 2000-07-14 2005-11-29 At&T Corp. Admission control for QoS-Driven Wireless LANs
US7756092B1 (en) 2000-07-14 2010-07-13 At&T Intellectual Property Ii, L.P. In-band QoS signaling reference model for QoS-driven wireless LANs connected to one or more networks
US7039032B1 (en) 2000-07-14 2006-05-02 At&T Corp. Multipoll for QoS-Driven wireless LANs
US6999442B1 (en) 2000-07-14 2006-02-14 At&T Corp. RSVP/SBM based down-stream session setup, modification, and teardown for QOS-driven wireless lans
US7068633B1 (en) 2000-07-14 2006-06-27 At&T Corp. Enhanced channel access mechanisms for QoS-driven wireless lans
US6862270B1 (en) 2000-07-14 2005-03-01 At&T Corp. Architectural reference model for QoS-driven wireless LANs
DE10046583A1 (en) * 2000-09-20 2002-04-04 Siemens Ag Method for establishing connections with guaranteed quality of service for a communication network with a resource manager
US8219662B2 (en) 2000-12-06 2012-07-10 International Business Machines Corporation Redirecting data generated by network devices
US6978301B2 (en) 2000-12-06 2005-12-20 Intelliden System and method for configuring a network device
US7054946B2 (en) * 2000-12-06 2006-05-30 Intelliden Dynamic configuration of network devices to enable data transfers
US7180855B1 (en) 2001-04-19 2007-02-20 At&T Corp. Service interface for QoS-driven HPNA networks
US7142563B1 (en) 2001-02-20 2006-11-28 At&T Corp. Service interface for QoS-driven HPNA networks
US8296400B2 (en) 2001-08-29 2012-10-23 International Business Machines Corporation System and method for generating a configuration schema
GB0211286D0 (en) * 2002-05-16 2002-06-26 Nokia Corp Routing data packets through a wireless network
US8675493B2 (en) * 2002-07-02 2014-03-18 Alcatel Lucent Routing bandwidth guaranteed paths with local restoration in label switched networks
US7363387B1 (en) 2003-12-09 2008-04-22 Cisco Technology, Inc. System and method for reducing information being transmitted in a network environment
US7298707B2 (en) * 2004-01-21 2007-11-20 Cisco Technology, Inc. System and method for controlling the flooding of information in a network environment
FR2866497B1 (en) * 2004-02-18 2006-08-18 Cit Alcatel BANDWIDTH CONTROLLER, NETWORK AND METHOD FOR MANAGING IP SUB-NETWORK
US7457244B1 (en) 2004-06-24 2008-11-25 Cisco Technology, Inc. System and method for generating a traffic matrix in a network environment
US7391730B1 (en) 2004-07-21 2008-06-24 Cisco Technology System and method for synchronizing link state databases in a network environment
US20080155148A1 (en) * 2006-10-26 2008-06-26 Ozgur Oyman Cooperative communication of data
JP4810457B2 (en) * 2007-02-15 2011-11-09 富士通株式会社 Gateway device
US8903970B2 (en) * 2008-04-02 2014-12-02 Hewlett-Packard Development Company, L.P. Explicit logging of network user node/target node coupling

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5297137A (en) 1991-01-30 1994-03-22 International Business Machines Corporation Process for routing data packets around a multi-node communications network
US5684800A (en) 1995-11-15 1997-11-04 Cabletron Systems, Inc. Method for establishing restricted broadcast groups in a switched network
US5832196A (en) * 1996-06-28 1998-11-03 Mci Communications Corporation Dynamic restoration process for a telecommunications network
US6047006A (en) * 1997-05-12 2000-04-04 Siemens Information And Communication Networks, Inc. Method and apparatus for dynamically allocating bandwidth to independent data and audio devices
US6011780A (en) * 1997-05-23 2000-01-04 Stevens Institute Of Technology Transparant non-disruptable ATM network
JP3134808B2 (en) * 1997-06-04 2001-02-13 日本電気株式会社 Frame relay transmission equipment
US6424624B1 (en) * 1997-10-16 2002-07-23 Cisco Technology, Inc. Method and system for implementing congestion detection and flow control in high speed digital network

Also Published As

Publication number Publication date
DE69924345T2 (en) 2005-09-08
US6657965B1 (en) 2003-12-02
EP1011230B1 (en) 2005-03-23
DE69924345D1 (en) 2005-04-28
EP1011230A2 (en) 2000-06-21
EP1011230A3 (en) 2003-03-26

Similar Documents

Publication Publication Date Title
US6657965B1 (en) System and method for enhanced routing and reservation protocol
US8139478B1 (en) Recovery method for an optical network
US6144633A (en) Self-healing network, method for transmission line switching thereof, and transmission equipment thereof
US7852758B2 (en) Route control method of label switch path
JP3700596B2 (en) Communication network, path setting method, and path setting program
US7274869B1 (en) System and method for providing destination-to-source protection switch setup in optical network topologies
US5832197A (en) Alternate routing by increasing initially low QOS value of a selected alternate path during failure to user-specified value
US20130266317A1 (en) Optical switch and protocols for use therewith
JPH08163174A (en) Variable length data exchange, variable length data terminal housed in the same, and system and method for variable length data communication
US20040208547A1 (en) QoS based protection of mesh-based intelligent optical networks
US8761601B2 (en) 1:N sparing of router resources at geographically dispersed locations
US7009934B1 (en) Method and apparatus for rerouting an optical network upon fault
US7206281B2 (en) Calculating physical routes in a communication network
CN100373866C (en) Method of network fault recovery crossing over connections in multiple domains
US7123831B2 (en) Device and method for restoring connections in automatically switchable optical networks
US20030097471A1 (en) Routing in transmission networks
JP2003258886A (en) Method for establishing optical path
US7742403B2 (en) Deadlock detection in a telecommunication network
EP1309217B1 (en) Dynamic burst switch node, program product and network
CN109743112B (en) OTN networking method, device, equipment and computer readable storage medium
US20020141444A1 (en) Layer-structured path setup method and node apparatus for implementing same
US20010038480A1 (en) Immediate rerouting in data networks
JP3822518B2 (en) Backup optical path bandwidth securing method and optical path switching device
US8155515B2 (en) Method and apparatus for sharing common capacity and using different schemes for restoring telecommunications networks
JP4817143B2 (en) Path setting method and communication apparatus

Legal Events

Date Code Title Description
EEER Examination request
FZDE Discontinued