CA2235857C - Svc routing in network with static routing tables - Google Patents

Svc routing in network with static routing tables Download PDF

Info

Publication number
CA2235857C
CA2235857C CA002235857A CA2235857A CA2235857C CA 2235857 C CA2235857 C CA 2235857C CA 002235857 A CA002235857 A CA 002235857A CA 2235857 A CA2235857 A CA 2235857A CA 2235857 C CA2235857 C CA 2235857C
Authority
CA
Canada
Prior art keywords
node
call
network
setup message
route
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
CA002235857A
Other languages
French (fr)
Other versions
CA2235857A1 (en
Inventor
Shawn Mcallister
Nutan Behki
Richard Chan
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.)
Nokia Canada Inc
Original Assignee
Alcatel Canada 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 Alcatel Canada Inc filed Critical Alcatel Canada Inc
Publication of CA2235857A1 publication Critical patent/CA2235857A1/en
Application granted granted Critical
Publication of CA2235857C publication Critical patent/CA2235857C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/10—Routing in connection-oriented networks, e.g. X.25 or ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/18—Loop-free operations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
    • H04L2012/5621—Virtual private network [VPN]; Private-network - network-interface (P-NNI)
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/563—Signalling, e.g. protocols, reference model
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13141—Hunting for free outlet, circuit or channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13144—Searching path through number of switching stages or nodes, e.g. revertive blocking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13145—Rerouting upon failure
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13146—Rerouting upon blocking/overload, rearrangement
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13166—Fault prevention
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13217—Cranckback in routing, trombone connection, loopback circuit
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13272—Premature release
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1329—Asynchronous transfer mode, ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13296—Packet switching, X.25, frame relay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13352—Self-routing networks, real-time routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13353—Routing table, map memory
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13399—Virtual channel/circuits

Abstract

A method is disclosed for establishing a switched virtual circuit in a digital network having network nodes with static routing tables. The static routing tables contain at least primary and alternate routing data. When a node is unable to forward a call over its outgoing primary route due to congestion or physical failure and its alternate route is the same as the route on which a call setup request arrived, it clears the call at that node and sends a crankback message to the preceding node, which responds to the crankback message to attempt to dynamically re-route the call over the alternate route stored in the routing table of the preceding node. If the attempt is unsuccessful, it sends the message back to the next preceding node and so on.

Description

SVC ROUTING IN NETWORK WITH STATIC ROUTING TABLES
BACKGROUND OF THE INVENTION
This invention relates to a method of establishing a switched virtual circuit in digital networks with static routing tables. The invention is applicable to any technology in which switched virtual circuits are set up through a packet switched network, for example, ATM and Frame Relay networks.
Congestion may occur on a network link if many incoming streams of traffic all terminate on the same outbound link, or the outbound link may busy or down due to a failure. Congestion is a problem in all networks. In packet switched networks, congestion is handled by end to end applications. There are no methods for handling congestion at the packet routing level. In circuit switched networks, bandwidth is reserved for each circuit by the network operator. Once again, there are no methods for handling congestion.
In networks which use switched virtual circuits (SVCs), a method is needed to reroute around congested or failed links. In the P-NNI protocol, which applies to dynamically routed SVC networks, a crankback IE (Information Element) is used for rerouting. When a node receives a call set-up request with which it is unable to comply, it sends a crankback IE back through the network. This IE passes through several nodes until it reaches a node which is programmed to respond to a crankback IE. This node, which is equipped to respond to a crankback element, then attempts to re-route the call on the basis of its current routing table.
This method, however, cannot been used in statically routed SVC networks, where the nodes contain manually pre-configured routing tables, which predetermine the path through the network that a call between any two endpoints will take.
Furthermore, there is no mechanism to prevent continuous crankback attempts. In a network with static routing tables, failure in one of the configured links will result in failure of the call set-up process.
Routing loops may occur due to configuration errors, the use of alternate routes when failures occur, or transient routing tables after a failure in the network. Routing loops are also a problem in all networks. In statically routed packet and circuit switched networks, loops are assumed to be detected by the network operator. No loop detection mechanisms are present in these networks.
In networks which use switched virtual circuits, both transient loops and permanent loops are a problem. A reliable method of loop detection is therefore needed in these networks. The P-NNI protocol uses source routing to avoid loops. This adds unnecessary complexity to SVC routing.
The article "An Alternate Path Routing Scheme Supporting QOS and Fast Connection Setup in ATM Networks". Proceedings of the Global Conference, San Francisco, Nov. 28 - Dec 2, I 994, vol. 2 of 3, by E. M. Spiegel et. al discloses to an alternate path routing scheme based on a combination of progressive control and source routing for use within a connection-oriented data communications network, namely an ATM network. Spiegel teaches that a source node, which is to setup a connection through the network to an endpoint, computes a primary (first) path from its routing table information. Source routing is utilized to effect this path computation which typically is a function of link cost and quality of service requirements. The source node also computes a cost threshold and crankback limit which, together with the computed primary path, are included in a connection setup message generated at the source node.
Additionally, the setup message includes fields for accumulating the cost of a path fragment already established and for accumulating the number of crankbacks already completed.
The setup message is propagated along the primary path until either the network endpoint is reached or until the connection setup message encounters a blocked link at an intermediate node. The intermediate node, responsive to encountering the blocked link, then computes an alternate path as a new path tail through the network to the endpoint.
Again this path computation is effected using source routing, but in this instance the node must take into consideration the re-route guidelines contained in the connection setup message. The total cost of the path, comprising the accumulated cost of the established path fragment together with the cost ofthe new path tail, must be less than or equal to the cost threshold specified in the setup message.
If no path tail that satisfies the cost threshold can be found by the node, and the connection setup message has not yet been cranked back the limit specified therein, then crankback proceeds to the previous node in the path fragment and that node in turn attempts to compute an alternate path using source routing and complying with the constraints specified in the setup message.
SUMMARY OF THE INVENTION
According to the present invention there is provided A method of establishing a switched virtual circuit call in a digital communications network comprising a plurality of network nodes, each network node having a local static routing table providing next hop routing information to adjacent nodes, comprising the steps of defining in said routing table a primary route and an alternate route to adjacent nodes; sending a setup message for said call through said network; receiving said setup message at a network node, said network node on receipt of said setup message searching its routing table for corresponding routing information; and said network node, based on the corresponding routing information, attempting to forward the setup message on the primary route; and if the primary route is not usable due to congestion or physical failure, said network node then attempting to forward the setup message on the alternate route; and if the alternate route is the same route on which the setup message is received, the network node then cranking the call back to a preceding node which either forwards the setup message over the alternate route defined in said preceding node's routing table or again cranks the call back to a further preceding node, and such process being repeated until the call setup message has been returned to a source thereofe.
Preferably, the crankback IE has a predetermined lifetime to prevent continuous crankback attempts.
BRIEF DESCRIPTION OF THE DRAWINGS
The invention will now be described in more detail, by way of example only, with reference to the accompanying drawings, in which:-Figure 1 shows a portion of a digital network showing how the system routes SVCs around failures; and Figure 2 illustrates the network with a different trunk group down and showing an extra node.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Figure 1 shows a digital network comprising three switching nodes A, B, C, referred to as node A, node B, and node C, for example, ATM switches, and four users 5, 6, 7, 8, referred to as user I, user 2, user 3, and user 4. User I and user 4 are connected to Node A, user 2 is connected to node C, and user 3 is connected to through a "foreign"
network 9 to Node B. The nodes are connected via trunks I carrying SVCs (Switched Virtual Circuits).
Each node contains a local routing table I I which is manually preconfigured when the network is setup to store the routes to adjacent nodes for reaching possible endpoints from that node. This is known as hop-by-hop routing. The routing tables 1 I
contain information pertaining to a primary route and an alternate route to use in the event that there is a failure or congestion on the primary route.
Suppose that the Primary Route for Node A, as stored in its routing table 1 I, to reach User 2 is via Node B and the Alternate Route is via Node C. On Node B , the Primary Route to User 2 is via Node C and an Alternate Route is via Node A.
In this example, all Trunk Groups between Node B and Node C are assumed to be down. A Setup message from User I to User 2 is routed by Node A to Node B in accordance with the information stored in its routing table I 1. Node B
detects that the Trunk Group in its Primary Route (via Node C) is down, so its Primary Route cannot be used. Node B also detects that its Alternate Route to User 2 is the same Route on which the setup message was received. Routing the call out the Alternate Route would therefore cause a loop and Node B therefore determines that it cannot forward the call to User 2 and clears the call back to Node A with a Release message indicating Crankback.
Node A receives the Crankback message, notes that its Primary Route didn't work and forwards the call on its Alternate Route, as stored in its routing table I
I, to Node C.
Node C then forwards the call to User 2. .Without Crankback, the Trunk Group failure between Node B and Node C would prevent User I from establishing an SVC to User 2.

Crankback operates by regressing a call in progress back to a previous node in the call setup path to try an alternate route from that point. When a node cannot forward a call along its configured path, it sends a Release message to the previous node (called the Crankback destination) and includes a Crankback Information Element in the Release message to indicate Crankback (as opposed to normal call clearing). The Crankback destination has a record of the Route and Route List it used to forward this call. Upon receiving the Crankback, the Crankback destination knows that the Route it chose cannot be used to establish this call. It therefore chooses the next best Route from the Route List to forward the call. This newly-selected Route will take the call to a different node in an attempt to route around the failure. If there are no other Routes to chose from in the Route List, then the call is cranked back one more hop. If Crankback reaches the originating node and an alternate Route cannot be found, then the call is cleared back to the calling party.
In order to bound the number of SVC re-routing attempts, Crankback will be attempted only up to a maximum number of times before the call is cleared back to the originator. This is controlled using a hop count or time-to-live field in the signalling message. This field starts at a specific value and is decremented each time the signalling message is forwarded by an intermediate switch. When the field reaches zero, the call is cleared.
The use of static routing with alternate routes may also cause routing loops during failure conditions. Manually configuring SVC routing tables node by node, can also cause routing loops to be erroneously introduced. Loop detection is used to detect a looped Set-up or Add Party message and will either clear the call or use Crankback to indicate to previous nodes in the setup path that an alternate route must be chosen.
In the network shown in Figure 2, and additional node 10, referred to as node D is located between node C and user 2. If we assume that user I is establishing an SVC to User 2, node A's Primary Route to User 2 is via Node C, with its Alternate Route via Node B. The Primary Route from Node C to User 2 is via Node D with an Alternate Route via Node B.

When the Setup message arrives at Node C from Node A, Node C determines that tits Primary Route is inoperative, and forwards the call along its Alternate Route, to Node B. Node B sends the call along its primary route to Node A. Node A detects the routing loop and clears the call back to Node B in a Release message indicating Crankback. Node B then chooses its Alternate Route and forwards the call to Node D, who delivers the call to User 2.
Looping of SVC Setup or Add Party messages can occur due to routing configuration errors or due to the use of alternate routes when failures occur. SVC looping in case 2 is detected with the use of a proprietary Transit List Information Element (IE) in the signalling messages. This IE (Information Element) records the nodes visited during the call setup. Upon detection of SVC looping, the detecting node cranks the call back to the previous node to allow rerouting to occur.
The described method enhances the crankback mechanism and allows its use in both dynamically and statically routed SVC networks.

Claims (22)

Claims:
1. A method of establishing a switched virtual circuit call in a digital communications network comprising a plurality of network nodes, each network node having a local static routing table providing next hop routing information to adjacent nodes, comprising the steps of:
defining in said routing table a primary route and an alternate route to adjacent nodes;
sending a setup message for said call through said network;
receiving said setup message at a network node, said network node on receipt of said setup message searching its routing table for corresponding routing information; and said network node, based on the corresponding routing information, attempting to forward the setup message on the primary route; and if the primary route is not usable due to congestion or physical failure, said network node then attempting to forward the setup message on the alternate route; and if the alternate route is the same route on which the setup message is received, the network node then cranking the call back to a preceding node which either forwards the setup message over the alternate route defined in said preceding node's routing table or again cranks the call back to a further preceding node, and such process being repeated until the call setup message has been returned to a source thereof.
2. A method as claimed in claim 1, wherein the step of cranking the call back to said preceding node includes sending a release message having a crankback indication from the network node to the preceding node; and, responsive to the crankback indication, the preceding node either forwards the setup message over an alternate route, if it can do so, or again cranks the call back to another preceding node until the call setup message has been returned to the source.
3. A method as claimed in claim 2, wherein the call setup message and crankback indication have a predetermined lifetime to prevent continuous attempts of cranking back the call.
4. A method as claimed in claim 3, wherein the predetermined lifetime is a count of nodes that can still be visited during the call setup, said count is decremented each time the setup message is forwarded by a network node, and the call is cleared when the count reaches zero.
5. A method as claimed in claim 2, wherein said call is cleared when the release message with the crankback indication reaches the source.
6. A method as claimed in claim 1, wherein the primary or alternate routes are not usable due to congestion or physical failure, or looping is detected.
7. A method as claimed in claim 6, wherein looping is detected when the primary route or the secondary route is the same as the route on which the setup message is received by the node.
8. A method of establishing a call in a virtual circuit based communications network comprising a plurality of network nodes and employing hop-by-hop routing, each network node having a preconfigured routing table which contains next hop information to adjacent nodes for routes leading to endpoints of the network, comprising the steps of:
preconfiguring in said routing table of each individual network node next hop information associated respectively with a primary route and an alternate route to respective network endpoints;
sending a setup message having a destination endpoint for said call through said network;
receiving said setup message at a network node, said network node on receipt of said setup message searching its routing table based on the destination endpoint for corresponding next hop information identifying the next node on the primary route to the destination endpoint;
said network node attempting to forward the setup message on the primary route defined in the corresponding next hop information retrieved from said routing table for the primary route for said network node; and if the primary route is not usable, said network node ten attempting to forward the setup message on the alternate route defined in the corresponding next hop information stored in said routing table for the alternate route for said network node or cranking the call back to a preceding node which either forwards the setup message over the alternate route defined using the next hop information stored in its routing table for the alternate route or again cranks the call back to a further preceding node.
9. A method as claimed in claim 8, wherein the step of cranking the call back to said preceding node includes sending a release message having a crankback indication from the network node to the preceding node; and the preceding node, responsive to the crankback indication, either forwards the setup message over its alternate route, if it can do so, or again cranks the call back by sending release message having the crankback indication to the further preceding node.
10. A method as claimed in claim 9, wherein the call setup message and crankback indication have a predetermined lifetime to prevent continuous attempts of cranking back the call.
11. A method as claimed in claim 10, wherein the predetermined lifetime is a count of nodes that can still be visited during the call setup, said count is decremented each time the setup message is forwarded by a network node, and the call is cleared when the count reaches zero.
12. A method as claimed in claim 9, wherein said setup message is sent from a source endpoint and said call is cleared when the release message with the crankback indication reaches the source endpoint.
13. A method as claimed in claim 8, wherein said network node performs the step of cranking the call back to the preceding node if the alternate route is not usable.
14. A method as claimed in claim 13, wherein the primary or alternate routes are not usable due to congestion or physical failure, or looping is detected.
15. A method as claimed in claim 14, wherein looping is detected when the primary route or the secondary route is the same as the route on which the setup message is received by the node.
16. A method of controlling a network node for use in establishing a call in a virtual circuit based communications network comprising a plurality of network nodes and employing hop-by-hop routing, the network node having a routing table which contains next hop information to adjacent nodes for routes leading to endpoints of the network, comprising the steps of:
predefining a primary route and an alternate route for respective network endpoints as the next hop information in said routing table;
receiving a setup message including a destination endpoint;
searching the routing table based on the destination endpoint for corresponding next hop information; and attempting to forward the setup message on the primary route defined in the corresponding next hop information for the primary route; and if the primary route is not usable, then attempting to forward the setup message on the alternate route defined in the corresponding next hop information for the alternate route or cranking the call back to a preceding node in the communications network.
17. A method as claimed in claim 16, wherein the step of cranking the call back to said preceding node includes sending a release message having a crankback indication from the network node to the preceding node.
18. An apparatus used in a network node for establishing a call in a virtual circuit based communications network employing hop-by-hop routing, comprising:
a routing table which contains next hop information to adjacent nodes corresponding to endpoints of the network, the routing table predefining for respective endpoints a primary route and an alternate route to the next hop;
means for receiving a setup message having a destination endpoint;
means for searching the routing table based on the destination endpoint for corresponding next hop routing information for the primary route;
means for attempting to forward the setup message on the primary route defined in the corresponding next hop information for the primary route; and means, if the primary route is not usable, for attempting to forward the setup message on the alternate route defined in the corresponding next hop information for the alternate route or for cranking the call back to a preceding node in the communications network.
19. An apparatus as claimed in claim 16, wherein the means for cranking the call back to said preceding node includes means for sending a release message having a crankback indication from the network node to the preceding node.
20. A method for establishing of a call in a virtual circuit based communications network having a plurality of network nodes and employing hop-by-hop routing, comprising the steps of:

sending a setup message for said call through said network on a hop by hop basis, said setup message including an indication of hop count;
adjusting the indication of hop count at each network node receiving said setup message, whereby that node effectively is counted as a hop traversed by the message;
and clearing the call back through the network when the indication of hop count has reached a predetermined count.
21. A method as claimed in claim 20, wherein the indication of hop count is a number of nodes that can still be visited during the call setup, said number is decremented each time the setup message is forwarded by a network node, and the call is cleared when the count reaches zero.
22. A method of establishing a call in a virtual circuit based communications network comprising a plurality of network nodes and employing hop by hop routing, each network node having a routing table which contains next hop information to adjacent nodes corresponding to endpoints of the network, comprising the steps of:
sending a setup message having a destination endpoint for said call through said network, said setup message including an indication of hop count;
receiving said setup message at a network node;
adjusting the indication of hop count, whereby the network node effectively is counted as a hop traversed by the message;
clearing the call back through the network when the indication of hope count reaches a predetermined count; and otherwise forwarding the setup message another hop to an adjacent node in accordance with the next hop information for the destination endpoint contained in its routing table.
CA002235857A 1995-10-25 1996-10-25 Svc routing in network with static routing tables Expired - Lifetime CA2235857C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
GB9521831.9 1995-10-25
GBGB9521831.9A GB9521831D0 (en) 1995-10-25 1995-10-25 Crankback and loop detection in ATM SVC routing
PCT/CA1996/000710 WO1997016005A1 (en) 1995-10-25 1996-10-25 Svc routing in network with static routing tables

Publications (2)

Publication Number Publication Date
CA2235857A1 CA2235857A1 (en) 1997-05-01
CA2235857C true CA2235857C (en) 2006-08-15

Family

ID=10782877

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002235857A Expired - Lifetime CA2235857C (en) 1995-10-25 1996-10-25 Svc routing in network with static routing tables

Country Status (7)

Country Link
US (2) US6215765B1 (en)
EP (1) EP0857384B1 (en)
AU (1) AU7272996A (en)
CA (1) CA2235857C (en)
DE (1) DE69631153T2 (en)
GB (1) GB9521831D0 (en)
WO (1) WO1997016005A1 (en)

Families Citing this family (92)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB9521831D0 (en) * 1995-10-25 1996-01-03 Newbridge Networks Corp Crankback and loop detection in ATM SVC routing
US6747761B1 (en) 1996-10-29 2004-06-08 Captaris, Inc. Delivery expert system and method
US8462366B2 (en) 1996-10-29 2013-06-11 Open Text S.A. Delivery expert system, method and computer program product
US6172973B1 (en) * 1997-09-17 2001-01-09 Nortel Networks Limited Apparatus and method for reducing delay for voice over ATM using co-located switches
US6498779B1 (en) * 1998-05-22 2002-12-24 Alcatel Canada Inc. Multiple endpoint paths
CA2239032A1 (en) 1998-05-28 1999-11-28 Newbridge Networks Corporation Operator directed routing of soft permanent virtual circuits in a connection-orientated network
US6785277B1 (en) * 1998-08-06 2004-08-31 Telefonaktiebolget Lm Ericsson (Publ) System and method for internodal information routing within a communications network
US7002906B1 (en) * 1998-08-28 2006-02-21 Cisco Technology, Inc. Method for extending the crankback procedure to any Asynchronous Transfer Mode system
JP3070588B2 (en) * 1998-11-20 2000-07-31 日本電気株式会社 ATM SVC duplex system
JP3114715B2 (en) * 1999-01-08 2000-12-04 日本電気株式会社 Dual call control device
FI113822B (en) * 1999-01-19 2004-06-15 Nokia Corp Controlled recovery for data network errors
DE60039684D1 (en) * 1999-03-31 2008-09-11 British Telecomm PROGRESSIVE ROADWAY CONTROL IN A COMMUNICATION NETWORK
US6813242B1 (en) * 1999-05-07 2004-11-02 Lucent Technologies Inc. Method of and apparatus for fast alternate-path rerouting of labeled data packets normally routed over a predetermined primary label switched path upon failure or congestion in the primary path
US6580693B1 (en) * 1999-05-24 2003-06-17 3Com Corporation Methods and apparatus for detecting leaks in ATM networks
US7457233B1 (en) 1999-07-15 2008-11-25 Juniper Networks, Inc. Method and apparatus for fast reroute in a connection-oriented network
US6693877B1 (en) * 1999-09-07 2004-02-17 Motorola, Inc. Data discard avoidance method
US6970451B1 (en) * 1999-10-12 2005-11-29 At&T Corp. Smart routers-simple optics: network architecture for IP over WDM
US7298693B1 (en) 1999-10-21 2007-11-20 Tellabs Operations, Inc. Reverse notification tree for data networks
AU1340201A (en) 1999-10-21 2001-04-30 Tellabs Operations, Inc. Reverse notification tree for data networks
US7315510B1 (en) * 1999-10-21 2008-01-01 Tellabs Operations, Inc. Method and apparatus for detecting MPLS network failures
US7804767B1 (en) 1999-10-25 2010-09-28 Tellabs Operations, Inc. Protection/restoration of MPLS networks
US6674748B1 (en) * 1999-12-21 2004-01-06 Telefonaktiebolaget Lm Ericsson (Publ) Methods, apparatuses and systems for transitioning from a signaling system 7 network to a data network at a signaling system 7 gateway
US6747980B1 (en) 1999-12-21 2004-06-08 Ericsson Inc. Methods, apparatuses and systems for managing multiple signaling end points in a signaling system 7 network
JP3356145B2 (en) * 1999-12-22 2002-12-09 日本電気株式会社 Transmission line failure relief method, transmission line failure relief system, storage medium, and router
US6901053B1 (en) * 1999-12-29 2005-05-31 Nortel Networks Limited Connectionless network express route
JP2001197114A (en) * 2000-01-14 2001-07-19 Fujitsu Ltd Frame repeater
US6977899B1 (en) * 2000-01-20 2005-12-20 Lucent Technologies Inc. Method and apparatus for message-based overload control in a distributed call-processor communication system
US6668051B1 (en) * 2000-03-28 2003-12-23 Sevis Systems, Inc. Intelligent communications point platform
US6792472B1 (en) * 2000-03-31 2004-09-14 International Business Machines Corporation System, method and computer readable medium for intelligent raid controllers operating as data routers
US6671819B1 (en) * 2000-04-06 2003-12-30 Bbnt Solutions Llc System and methods routing packets on alterate paths
US6744984B1 (en) * 2000-05-24 2004-06-01 Nortel Networks Limited Method and system for alternative transmission traffic routing in dense wavelength division multiplexing optical networks
US6996065B2 (en) * 2000-07-06 2006-02-07 Lucent Technologies Inc. Dynamic backup routing of network tunnel paths for local restoration in a packet network
FR2813003B1 (en) * 2000-08-10 2002-10-11 Cit Alcatel METHOD FOR ENSURING A POSSIBILITY OF OBTAINING PRIVILEGED DETERMINED COMMUNICATIONS FOR CERTAIN USERS OF A COMMUNICATION NETWORK
US6791940B1 (en) * 2000-08-28 2004-09-14 International Business Machines Corporation Method and apparatus for data transmission control in a computer network environment
US20030177263A1 (en) * 2000-09-29 2003-09-18 Robinson Gerald A Routing in a communications network
JP2002158670A (en) * 2000-11-21 2002-05-31 Fujitsu Ltd Atm switchboard
US7012887B2 (en) * 2001-05-08 2006-03-14 Sycamore Networks, Inc. Method for restoring diversely routed circuits
US7428209B1 (en) * 2001-06-12 2008-09-23 Roberts Lawrence G Network failure recovery mechanism
KR100427762B1 (en) * 2001-07-23 2004-04-28 엘지전자 주식회사 Method of Servicing a SVC in the ATM Exchange
US7126907B2 (en) * 2001-08-31 2006-10-24 Tropic Networks Inc. Label switched communication network, a method of conditioning the network and a method of data transmission
JP4041944B2 (en) * 2001-10-18 2008-02-06 日本電気株式会社 Network congestion control system, congestion control node, and congestion control program
US7853643B1 (en) * 2001-11-21 2010-12-14 Blue Titan Software, Inc. Web services-based computing resource lifecycle management
US7296061B2 (en) * 2001-11-21 2007-11-13 Blue Titan Software, Inc. Distributed web services network architecture
US20030118170A1 (en) * 2001-12-21 2003-06-26 Wilson Anthony David Communications call routing
US7471692B1 (en) * 2002-01-17 2008-12-30 Utstarcom, Inc. Method and apparatus for maximizing call connect rate in a remote access application
US7283467B2 (en) * 2002-12-11 2007-10-16 Alcatel Canada Inc. Procedures for improving call routing in PNNI networks
US7983239B1 (en) 2003-01-07 2011-07-19 Raytheon Bbn Technologies Corp. Systems and methods for constructing a virtual model of a multi-hop, multi-access network
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
US10476619B2 (en) * 2003-04-23 2019-11-12 Apple Inc. Routing quality-of-service traffic in a wireless system
US7639664B2 (en) * 2003-05-30 2009-12-29 Alcatel-Lucent Usa Inc. Dynamic management of trunk group members
US7313087B2 (en) * 2003-06-20 2007-12-25 Ericsson Ab Distributed protection switching
GB0315745D0 (en) * 2003-07-04 2003-08-13 Novartis Ag Organic compounds
US7881229B2 (en) * 2003-08-08 2011-02-01 Raytheon Bbn Technologies Corp. Systems and methods for forming an adjacency graph for exchanging network routing data
US7606927B2 (en) * 2003-08-27 2009-10-20 Bbn Technologies Corp Systems and methods for forwarding data units in a communications network
US8166204B2 (en) 2003-08-29 2012-04-24 Raytheon Bbn Technologies Corp. Systems and methods for automatically placing nodes in an ad hoc network
US7668083B1 (en) 2003-10-28 2010-02-23 Bbn Technologies Corp. Systems and methods for forwarding data in a communications 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
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
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
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
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
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
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
US7532623B2 (en) * 2004-03-24 2009-05-12 Bbn Technologies Corp. Methods for wireless mesh multicasting
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
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
US7660241B2 (en) * 2004-07-20 2010-02-09 Alcatel Lucent Load balancing in a virtual private network
US7583593B2 (en) * 2004-12-01 2009-09-01 Cisco Technology, Inc. System and methods for detecting network failure
US7551551B2 (en) * 2004-12-10 2009-06-23 Cisco Technology, Inc. Fast reroute (FRR) protection at the edge of a RFC 2547 network
US7468984B1 (en) 2004-12-29 2008-12-23 At&T Corp. Method and apparatus for providing disaster recovery using network peering arrangements
US7990888B2 (en) * 2005-03-04 2011-08-02 Cisco Technology, Inc. System and methods for network reachability detection
US8903074B2 (en) * 2005-03-04 2014-12-02 Tekelec Global, Inc. Methods, systems, and computer program products for congestion-based routing of telecommunications signaling messages
US20060215577A1 (en) * 2005-03-22 2006-09-28 Guichard James N System and methods for identifying network path performance
EP1708426A1 (en) * 2005-04-01 2006-10-04 BRITISH TELECOMMUNICATIONS public limited company Resource reservation in network routing
US8018844B2 (en) * 2005-08-24 2011-09-13 International Business Machines Corporation Reliable message transfer over an unreliable network
US7983174B1 (en) 2005-12-19 2011-07-19 Cisco Technology, Inc. Method and apparatus for diagnosing a fault in a network path
US7912934B1 (en) 2006-01-09 2011-03-22 Cisco Technology, Inc. Methods and apparatus for scheduling network probes
US8295162B2 (en) 2006-05-16 2012-10-23 At&T Intellectual Property I, L.P. System and method to achieve sub-second routing performance
CN101212783B (en) * 2006-12-28 2011-04-13 华为技术有限公司 Sub-routing method and device
JP2008193543A (en) * 2007-02-07 2008-08-21 Fujitsu Ltd Apparatus and method of controlling ad hoc network route
US8111627B2 (en) * 2007-06-29 2012-02-07 Cisco Technology, Inc. Discovering configured tunnels between nodes on a path in a data communications network
US20090182893A1 (en) * 2008-01-11 2009-07-16 Anand Vaijayanthimala K Cache coherence in a virtual machine managed system
JP5303985B2 (en) * 2008-03-27 2013-10-02 富士通セミコンダクター株式会社 Semiconductor memory device, semiconductor memory device operating method, and memory system
US8139504B2 (en) * 2009-04-07 2012-03-20 Raytheon Bbn Technologies Corp. System, device, and method for unifying differently-routed networks using virtual topology representations
KR101636582B1 (en) * 2009-06-24 2016-07-06 엘지전자 주식회사 Apparatus and method of setting up radio bearer in wireless communication system
US8995633B2 (en) * 2009-08-19 2015-03-31 Level 3 Communications, Llc System and method for creating a routing matrix for routing local calls
EP2830268B1 (en) * 2012-03-19 2017-11-15 Nec Corporation Communication node, packet processing method and program
US9509593B2 (en) * 2014-04-22 2016-11-29 Ciena Corporation Systems and methods for diverse connection signaling from disparate source nodes in distributed connection-oriented networks
US10291539B2 (en) 2016-09-22 2019-05-14 Oracle International Corporation Methods, systems, and computer readable media for discarding messages during a congestion event
US11102138B2 (en) 2019-10-14 2021-08-24 Oracle International Corporation Methods, systems, and computer readable media for providing guaranteed traffic bandwidth for services at intermediate proxy nodes
US11425598B2 (en) 2019-10-14 2022-08-23 Oracle International Corporation Methods, systems, and computer readable media for rules-based overload control for 5G servicing

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4345116A (en) * 1980-12-31 1982-08-17 Bell Telephone Laboratories, Incorporated Dynamic, non-hierarchical arrangement for routing traffic
CA2015248C (en) * 1989-06-30 1996-12-17 Gerald R. Ash Fully shared communications network
JP2856050B2 (en) * 1993-11-30 1999-02-10 日本電気株式会社 Routing control method
US5659544A (en) * 1994-10-17 1997-08-19 Lucent Technologies Inc. Method and system for distributed control in wireless cellular and personal communication systems
US5805593A (en) * 1995-09-26 1998-09-08 At&T Corp Routing method for setting up a service between an origination node and a destination node in a connection-communications network
GB9521831D0 (en) * 1995-10-25 1996-01-03 Newbridge Networks Corp Crankback and loop detection in ATM SVC routing

Also Published As

Publication number Publication date
CA2235857A1 (en) 1997-05-01
WO1997016005A1 (en) 1997-05-01
US6560218B2 (en) 2003-05-06
DE69631153D1 (en) 2004-01-29
AU7272996A (en) 1997-05-15
DE69631153T2 (en) 2004-06-03
US20010010681A1 (en) 2001-08-02
EP0857384A1 (en) 1998-08-12
EP0857384B1 (en) 2003-12-17
US6215765B1 (en) 2001-04-10
GB9521831D0 (en) 1996-01-03

Similar Documents

Publication Publication Date Title
CA2235857C (en) Svc routing in network with static routing tables
US6222820B1 (en) Method of VCC/VPC redundancy for asynchronous transfer mode networks
US5450482A (en) Dynamic network automatic call distribution
US5953312A (en) Method and apparatus for determining alternate routes in a network using a connection-oriented protocol
EP0961518B1 (en) Operator directed routing of connections in a digital communications network
JP2856050B2 (en) Routing control method
US4862496A (en) Routing of network traffic
US6963926B1 (en) Progressive routing in a communications network
EP0859491B1 (en) Method for rerouting in hierarchically structured networks
US6538987B1 (en) Rapid ring protection switching system
US7200110B1 (en) Method and apparatus for prioritized release of connections in a communications network
JPH09261338A (en) Method and device for establishing call to use virtual transfer server for communication network
USRE40398E1 (en) ATM telecommunications systems and method for routing narrow band traffic
US7730201B1 (en) Method and apparatus for congestion avoidance in source routed signaling protocol communication networks
US7957274B2 (en) Intelligent routing for effective utilization of network signaling resources
US6807170B1 (en) System and method for implementing user-to-user information transfer services
US8547849B2 (en) ATM telecommunications systems and method for routing narrow band traffic
JP2001507187A (en) Communication network
WO1999002009A2 (en) Loop detection
KR0173206B1 (en) Call control method using low bandwidth first
US6754327B1 (en) Standalone ACD system with native signaling system 7 capability
WO1999030511A1 (en) Traffic filtering based on destination address
JPH04217149A (en) Autonomous setting system for communication channel in decentralized exchange network
JP2003087315A (en) Pnni connection restriction system and method
JPS59103456A (en) Line selecting control system

Legal Events

Date Code Title Description
EEER Examination request
MKEX Expiry

Effective date: 20161025