CA2239032A1 - Operator directed routing of soft permanent virtual circuits in a connection-orientated network - Google Patents

Operator directed routing of soft permanent virtual circuits in a connection-orientated network Download PDF

Info

Publication number
CA2239032A1
CA2239032A1 CA002239032A CA2239032A CA2239032A1 CA 2239032 A1 CA2239032 A1 CA 2239032A1 CA 002239032 A CA002239032 A CA 002239032A CA 2239032 A CA2239032 A CA 2239032A CA 2239032 A1 CA2239032 A1 CA 2239032A1
Authority
CA
Canada
Prior art keywords
connection
node
path
source
network
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
CA002239032A
Other languages
French (fr)
Inventor
Shawn Mcallister
Mark Tooker
Ron Veeneman
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
Newbridge Networks Corp
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=4162490&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=CA2239032(A1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Newbridge Networks Corp filed Critical Newbridge Networks Corp
Priority to CA002239032A priority Critical patent/CA2239032A1/en
Priority to US09/321,195 priority patent/US6697329B1/en
Priority to ES99109317T priority patent/ES2320186T3/en
Priority to EP99109317A priority patent/EP0961518B1/en
Priority to AT99109317T priority patent/ATE413785T1/en
Priority to DE69939856T priority patent/DE69939856D1/en
Publication of CA2239032A1 publication Critical patent/CA2239032A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/28Routing or path finding of packets in data switching networks using route fault recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0811Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/10Routing in connection-oriented networks, e.g. X.25 or ATM
    • 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
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478Provisions for broadband connections
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5619Network Node Interface, e.g. tandem connections, transit switching
    • H04L2012/562Routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5619Network Node Interface, e.g. tandem connections, transit switching
    • H04L2012/5621Virtual private network [VPN]; Private-network - network-interface (P-NNI)
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5625Operations, administration and maintenance [OAM]
    • H04L2012/5627Fault tolerance and recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/563Signalling, e.g. protocols, reference model
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04SSYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S40/00Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Exchange Systems With Centralized Control (AREA)
  • Telephonic Communication Services (AREA)

Abstract

An operator-directed soft-permanent virtual circuit (ODR SPVC) is established by manually provisioning a preferred path for the connection, including a source node, destination node, and intermediate nodes or subnetworks therebetween.
The source network creates an SPVC Call Setup message which is signalled along the preferred path, whereby the intermediate nodes along the preferred path establish the bearer channel cross-sections. The operator also specifies a re-routing scheme for the ODR
SPVC in the event the connection setup is blocked or the connection becomes inoperative.
The re-routing scheme includes one of (a) the preferred path only; (b) a manually provisioned alternate path; and (c) any path. The ODR SPVC provides the benefits of a permanent virtual circuit (PVC) in terms of the ability to consciously route a connection with the benefits of a soft permanent virtual circuit (SPVC) in terms of the capability to efficiently re-route connections by the network as opposed to a central management authority.

Description

OPERATOR DIRECTED ROUTING OF SOFT PERMANENT VIRTUAL CIRCUITS
IN A CONNECTION-ORIENTATED NETWORK
Field of the Invention The invention generally relates to the art of establishing connections in a connection-orientated data network; and more specifically to the establishment of a soft permanent virtual circuit in an asynchronous transfer mode (ATM) network using an operator-directed routing path.
Background of the Invention A permanent virtual circuit (PVC) provides a bearer channel path across a network which comprises a series of bearer channel links that are interconnected by "permanent" bearer channel cross-connections established on network elements or nodes under the direction of a central network management authority. This authority can be a human operator which decides the route and manually configures each cross-connection individually through a network management terminal Interface (NMTI).
Alternatively, the authority can be a network management system (NMS), which automatically selects the route through the network according to some algorithm or objective when requested by one or more human operators. The NMS is connected to each network node typically through an independent control channel and thereby automatically establishes the cross connections.
For each PVC thus established, the central network management authority can choose a route through the network which meets criteria based on network-wide policies rather than single-element policies. One example of a network-wide routing policy 20477149.2 y r
-2-is a policy of using the most efficient route through the network, for example, by minimizing the number of network elements traversed; or by minimizing the cumulative costs of links which are traversed; or, by balancing the number of traversed elements and the cost of the traversed links. Another example is balancing network usage across different network elements, or the links between network elements, such that no one network element or link is carrying a large proportion of all PVCs traversing the network.
This approach to establishing connections provides various benefits. For instance, since there is only one central network management authority, i.e.
an expert human network operator or a powerful computer running sophisticated network management software, the cost of provisioning the authority is inexpensive relative to the overall cost of a network. In addition, whenever network management policy is changed with respect to the routing of circuits, it is easy to implement the policy changes because they only need to be made in one place, in the central management authority.
This approach also has various shortcomings. One shortcoming is the relatively high cost of maintaining an exact and up-to-date picture of network conditions in the central network management authority in order to enable routing and re-routing decisions to be made with accuracy. Another shortcoming is the slow speed at which the central network management authority can re-route PVCs in the event of a network failure.
This is due to the time required for the central authority to (i) become aware of the network failure, (ii) find new routes through the network for all affected PVCs which satisfy all of the various network element and network-wide criteria, and (iii) re-establish all affected PVCs along the chosen routes.
20477149.2
-3-A soft permanent virtual circuit (SPVC) provides a bearer channel path across a network which comprises a series of bearer channel links that are interconnected through "switched" (i.e. on-demand) bearer channel cross-connections made across a series of network elements. More specifically, the ingress and egress network elements are provisioned by an operator (either through the NMTI or NMI) but the cross-connects are commissioned via signalling, like a switched virtual connection (SVC), as the SPVC is signalled and routed across the network from the ingress network element to the egress network element. An SVC is a path that is signalled from user side UNI to user side UNI
whereby the route section is chosen by the network nodes as the path is signalled from the source endpoint towards the destination endpoint. The individual cross-connects for the SVC path are configured and connected by call control software running on each node along the path as the path steers itself through the network using routing tables resident on each node (i.e., hop-by-hop routing) or according to a predetermined route specified in the connection request (i.e., source-routing). Thus, SPVCs are a kind of hybrid between PVCs and SVCs since SPVCs, like PVCs, are initiated by the central network management authority and, require no UNI signalling between the user and the network, but, like SVCs, the cross-connects are routed through the network and maintained by the network node themselves.
One of the benefits of this approach to establishing connections is that SPVCs can be re-routed more efficiently because the network elements which are closest to a network failure can quickly detect the failure and initiate the re-routing procedures.
Hence, the virtual circuits can be re-established more quickly and at less cost than PVCs can be re-established by a central network management authority. Indeed, it is estimated that SPVCs improve the fault restoration re-route performance for connections by an order 20477149.2
-4-of magnitude because the processing is distributed within the network rather than being centrally managed by the NMS.
The are also various disadvantages with this approach. First, it is not possible for an expert human operator to intervene and influence the network elements to use routes through the network that differ from the routes that would be automatically chosen by the network elements, or to modify routes chosen automatically by the network elements, for example, in order to impose routing criteria for which the network elements have not been designed or configured. Second, due to the large number of network elements, it is difficult and costly to employ powerful computing devices for each network element; therefore, the sophistication of the routing algorithms implemented by the network elements cannot, at reasonable expense, approach the sophistication of the routing algorithms that can be implemented by a central network management authority which comprises of a smaller number of computing devices. Third, again due to the large number of network elements, it is difficult and costly to upgrade or reconfigure each network element whenever a network-wide policy has changed with respect to the routing and re-routing of virtual circuits, for example, when a new virtual network has been created out of available resources on many different elements across the network, or when network management policies change with respect to the weighting of different criteria such as the number of elements traversed versus cumulative cost of links traversed.
To further elaborate upon the disadvantages provided by both PVCs and SPVCs, consider for example, the reference network shown in Fig. 1. A customer wishes to connect customer premise equipment (CPE) 20 from Toronto to Montreal, and purchases two (2) connections or virtual circuits 24a and 24b therebetween to ensure redundancy.
20477149.2
-5-If the connections 24a and 24b between Montreal and Toronto are established using SPVCs, then, since the path, i.e. intermediate nodes 28 and links 26, of the connections are not preconfigured, a situation such as illustrated in Fig. 1 could occur, wherein the network nodes select the shortest path between the CPEs. Thus, the paths of both connections 24a and 24b are identical, traversing node A, link 26ag, node G, link 26dg, and node D. This result would thus destroy the sought after redundancy. In order to ensure that the path of each connection does not follow a common link or share the same physical interface of the other, it is possible to provision the connections as PVCs in order to manually configure the cross-connections and predetermine the followed links. However, this strategy brings with it the above described disadvantages of PVCs, in particular, the relatively slow re-route performance of the centralized NMS in the event of a service disruption such as a failed link.
For customers who have demanding maximum permissible service disruption requirements, e.g., one second per year, the re-route performance of PVCs by the NMS is unacceptable.
For example, it may take the NMS two hundred (200) seconds to re-route a severed OC-3 cable carrying ten thousand (10,000) connections at fifty (50) re-routes per second.
Summaryr of the Invention The invention seeks to avoid the limitations of the prior art by providing a hybrid type of connection which features the fast, distributed processing re-route capabilities of SPVCs, yet enables a human operator to direct the routing of the path across the network like a PVC. Broadly speaking, one aspect of the invention relates to a data network comprising a user interface means for enabling a human operator to manually provision a source or ingress network node, a destination or egress network node, as well as the intermediate nodes and, optionally, the intermediate ports or links, in the path of an SPVC-20477149.2
-6-like connection. The user interface means is connected to the ingress node which encapsulates the manually provisioned path in a source-routed connection request message that is signalled over a signalling network to the nodes along the manually provisioned path.
The network nodes include call processing means to ensure that the SPVC-like connection traverses these intermediate nodes and the specified intermediate links as the connection request is signalled from the ingress node to the egress node.
Another aspect of the invention relates to a method of establishing an SPVC-like connection in a source-routed, connection-orientated, data network which comprises a signalling network for forwarding connection requests to network nodes. The method comprises the steps of:
(a) manually provisioning a preferred path for the connection, including a source node, a destination node, and intermediate nodes therebetween;
(b) storing the preferred path in a memory associated with the source node;
(c) creating a source-routed connection request which specifies the preferred path;
(d) successively signalling the connection request over the signalling network from the source node to each other node along the preferred path and commissioning a bearer channel cross-connection on each said node in order to connect adjacent nodes along the preferred path; and (e) connecting end-user equipment to the source and destination nodes.
20477149.2 -The SPVC-like or hybrid type of connection is termed herein an "operator directed route, soft permanent virtual circuit" or ODR SPVC
In the preferred embodiment, the network is a P-NNI network, as described in greater detail below, and the source routed connection request is a call setup message which carries a designated transit list (DTL) specifying the preferred path for routing the connection.
In the preferred embodiment, the operator provisions not only the preferred or primary path, but also an alternate path for the ODR SPVC. The primary path comprises the nodes and specified links an operator prefers the ODR SPVC to traverse as it is routed across the network. The alternate path comprises alternate nodes and links for the ODR
SPVC, in the event the primary path is blocked and is re-routed. An operator preferably also specifies re-route restrictions, that is, whether the ODR SPVC is restricted to traversing the network along the specified primary and/or alternate paths whenever the ODR
SPVC is re-routed, or whether any available path may be traversed.
ODR SPVCs, having paths provisioned by a human operator, offer the same services as the prior art SPVCs, and provide various other additional benefits. For instance, ODR SPVCs allow the operator to deliberately control the distribution of connections across a network. Additionally, the operator can include or exclude certain nodes(s) from the path of an ODR SPVC for security reasons. For example, a connection may need to traverse certain nodes to ensure the connection is protected from unauthorized access.
This offers some degree of information security for the customer. In addition, the operator can setup ODR SPVCs to ensure a network failure will not disrupt all of a customer's connections by 20477149.2 -g_ requiring a certain portion of the customers' connections to traverse a certain path while the remainder traverse completely unrelated path(s). If any of the paths) experiences failure, the failure would not disrupt all of the customer's connections. Furthermore, ODR SPVCs can be provisioned across a network to ensure that the network is efficient.
For example, the operator can direct certain ODR SPVCs to traverse the network over the least amount of hops, thereby guaranteeing that a connection will take the most direct path to its destination. The operator may even direct ODR SPVCs to avoid certain nodes to free up resources and avoid congestion in those nodes.
Brief Description of Drawings The foregoing and other aspects of the invention will become more apparent from the following description of the preferred embodiment thereof and the accompanying drawings which illustrate, by way of example, the principles of the invention.
In the drawings:
Fig. 1 is a diagram of reference network;
Fig. 2A is a diagram of an P-NNI reference network having the same topology as the network shown in Fig. 1;
Fig. 2B is a diagram of the P-NNI reference network illustrating desired ODR
SPVC paths;
Fig. 3 is a diagram illustrating the logical portioning of the bandwidth provided by a physical interface, in accordance with the preferred embodiment;
Fig. 4 is a diagram of a P-NNI control plane; and 20477149.2 _g_ Fig. 5 is a database relationship diagram illustrating how an ODR SPVC is represented in a database on a source node in accordance with the preferred embodiment.
Detailed Description of Preferred Embodiments Fig. 2A illustrates a reference connection-orientated ATM network 30 having a similar topography to the reference network shown in Fig. 1. The network 30 comprises a plurality of interconnected network elements or nodes 32. For ease of reference, individual nodes are identified by an alphabetical suffix, e.g., A, B or C and referenced elements of a given node are also generally labelled with the same suffix used to identify the node. The nodes 32 include various ports (not shown) which are interconnected through standard physical interfaces 34, such as well known OC-3, OC-12 and DS3 fibre optic or electrical interfaces.
In the preferred embodiment, the nodes 32 interface with another using the Private Network-to-Network Interface (P-NNI) protocol which is described in the reference "Private Network-Network Interface Specification Version 1.0 (P-NNI 1.0)", doc. no. af-p-nni-0055.00, March 1996, published by the ATM Forum, and which is incorporated herein by reference in its entirety. The nodes 32 are interconnected by data links 36, each of which represents a pre-allocated portion of the bandwidth provided by the corresponding physical interface 34. (Note that multiple links can be associated with each physical interface spanning adjacent nodes.) In the preferred embodiment, each data link 36 is associated with a P-NNI signalling link 38 and a P-NNI routing link 40, alternatively termed routing control channel (RCC), which span adjacent nodes. Fig. 3 shows more accurately the relationship between a physical port or interface, data links 36 (which are alternatively 20477149.2 referred to as "trunk groups"), P-NNI signalling links 38, P-NNI routing links 40, SVCs and SPVCs. It will be seen from the foregoing that the data link 36 represents a P-NNI
connectivity between two nodes 32.
More specifically, each node 32 comprises a P-NNI signalling module 42 for carrying out a P-NNI signalling protocol, which is based on ATM Forum UNI
signalling with extensions to support P-NNI functions. Signalling module 42 communicates over the P-NNI
signalling link 38, which may be a designated PVC or SVC associated with the data link 36.
Collectively, the signalling modules 42 of the network nodes and associated signalling links 38 therebetween provide a signalling network for forwarding or carrying P-NNI
signalling protocol messages, including connection-orientated messages such as the Setup, Connect and Release messages defined in the P-NNI reference, to and between network nodes 32. Similarly, each network node 32 comprises a P-NNI routing module 44 for carrying out a P-NNI routing protocol wherein nodes exchange topology information with one another over the P-NNI routing links 40 in order to dynamically compute paths through the network. The P-NNI routing links 40, which also may be PVCs or SVCs associated with the corresponding data link 36, carry P-NNI routing protocol messages such as Hello, PTSP, Database Summary, PTSE request and PTSPs acknowledgement messages to and from neighbour nodes. Further information regarding the P-NNI routing and signalling protocols may be found in the above-noted P-NNI reference.
The network 30 is also connected to a centralized network management system (NMS) 46 such as described above. In the preferred embodiment, the NMS
46 is connected to the network nodes 32 through a virtual control channel 47 (not entirely shown), 20477149.2 but in alternative embodiments the NMS 46 can be connected to the nodes 32 through an overlay control network, e.g., the public telephone network.
The objective of the preferred embodiment is to establish or set up a connection between customer premise equipment (CPE) 20A and 20B, which may not support signalling, through the network 30. As previously described, the NMS
46 enables a human operator to establish a prior art PVC or SPVC. In the preferred embodiment, however, the NMS 46 merely provides a user interface means to enable a human operator to manually provision the ODR SPVC of the invention. The ODR SPVC according to the preferred embodiment comprises at least two attributes: (a) a manually provisioned preferred or primary path for the connection; and (b) a manually provisioned re-routing restriction or scheme for re-routing the connection in the event the preferred or primary path is blocked or a data link 36 thereof fails therein. In the preferred embodiment the re-routing scheme may, as explained in greater detail below, includes an alternate preferred path which must also be manually provisioned by the operator.
Each path which is manually provisioned by the operator, comprises a list of all of the nodes and, optionally, the operator-specified links, the ODR SPVC
must traverse to reach its destination endpoint, i.e., the egress node.
The network 30 is associated with an addressing scheme, and thus each node is represented by a node identifier, and each data link is represented by a link identifier, which may be local to the node. An example of a node identifier is the high 13 order bytes of . The format of the link identifer varies depending upon the specific scheme 20477149.2 chosen by the manufacturer of the node, but typically represents some sort of numerical identifier with respect to a given node.
For example, referring to Fig. 2B, in order to ensure redundancy it may be desired to provide one ODR SPVC connection 48 between CPE 20A and CPE 20B
through path [node 32A; node 32G; and node 32D], and another ODR SPVC connection 49 between CPE 20A and CPE 20B through path [node 32A; node 32B, link 36BC; node 32C, node 32G]. Thus, the operator uses the NMS 46 to select or confirm the appropriate node and link identifers for these paths. The operator may also specify or confirm alternate preferred paths for these connections in the event the preferred paths or routes are inoperative. For example, the operator could specify an alternate route for connection 48 as [node 32A, node 32E, node 32F, and node 32D]. Similarly, the alternate route for connection 49 could be [node 32A, node 32B, link 36BC, node 32C; node 32D].
The user interface means provided by the NMS facilitates the input of the ODR SPVC, including the preferred or primary path, the optional alternate path, and the re-routing scheme thereof. The user interface means for specifying paths can comprise any of the following methods:
2p (1 ) Manual Entry. Here node identifiers and optional link identifers are manually typed into a terminal separated by predefined demarcation symbols.
(2) Manual with Point-and-Click Assistance. The NMS provides a graphical representation of the network as known in the art per se, 20477149.2 and the operator performs "paste" operations to create a list of nodes and optional links for the ODR SPVC path. The actual node and link identifers are typically hidden from view and replaced by mnemonics which are more readily understood by the operator; nevertheless, the resulting list is specified in the terms of the node identifiers and optional link identifiers.
(3) Automatic Route Generation with Manual Editing. The NMS, in a manner similar to the production of a prior art PVC, can automatically generate a path based on predetermined algorithms, such as the shortest path or least cost. This path is displayed, either textually or graphically, to the operator, who may then confirm or edit the path chosen by the software running on the NMS.
Similarly, the operator also selects a re-routing restriction or scheme through the user interface means, thereby indicating how strictly an ODR SPVC is restricted to routes along the nodes and links provisioned by the operator when circumstances dictate the ODR SPVC must be re-routed. The prefer-ed re-routing schemes, which are discussed in greater detail below, include:
(a) primary path;
(b) primary path-alternate path;
(c) primary path-any path; and (d) primary path-alternate path-any path.
20477149.2 The user interface means may alternatively be provided through the NMTI
of a source node, although such interfaces tend to be only textually based.
Irrespective of whether the user-interface means is provided by the NMS or NMTI, the particular user interface methods specified above are all instances of manual provisioning.
Once the operator has manually provisioned the preferred or primary path, the optional alternate path, and the re-routing scheme for the ODR SPVC (i.e.
the configuration data), the NMS 46 sends the configuration data and a message over the control channel 47 instructing the ingress node 32A to set up or establish the ODR SPVC.
The ingress node 32A stores the ODR SPVC configuration data as described in greater detail below. The signalling module of the ingress node 32A creates a call establishment or connection request message, such as an SPVC Call Setup message specified in Annex C of the P-NNI reference. However, unlike the situation corresponding to the establishment of a prior art SPVC, the ingress node 32A does not automatically compute the designated transit list (DTL) (specifying the source-routed path of an SVC or SPVC) using its P-NNI
routing tables. Instead, the ingress node creates a DTL using the ODR SPVC
primary path provisioned by the operator. The DTL, of course, is included as an information element (IE) in the SPVC Call Setup message.
The SPVC Call Setup message is signalled by the ingress node over the signalling link to the next or following node in the DTL, which in turn forwards the SPVC Call Setup message to a succeeding node listed in the DTL. This process continues until the egress or destination node receives the SPVC Call Setup message. Each node which receives the SPVC Call Setup message proceeds in the conventional manner to establish 20477149.2 or commission a bearer channel cross-connection 51 between an incoming data link 36 and an outgoing link 36.
If a link between two nodes has been provisioned by the operator and thus is specified in the DTL, then, subject to local connection admission control (CAC) verification, the nodes establish the bearer channel cross-connections 51 so as to use the specified link or trunk group, and call processing means 50 operating on the nodes (which comprises the signalling module 42 and routing module 44) needs to only select a free VPI
and optionally a VCI on the specified data link or trunk group. If, however, the DTL does not specify any data link or trunk group between nodes, then a local routing function in the call processing means 50 selects an available data link or trunk group to carry the ODR SPVC
bearer channel thereon. In either event, it will be seen that since the preferred embodiment uses source-routing, as opposed to hop-by-hop routing, to establish a connection, the path assumed by the connection matches the primary or preferred specified by the operator, provided that path is not blocked, as discussed in greater detail below.
Once the destination or egress node 32D receives the SPVC Call Setup message, it returns an acknowledgement message back over the signalling network to inform the ingress or source node 32A that the ODR SPVC connection has been successfully established. The source or ingress node 32A then sends a message back over the control channel 49 to the NMS 46 which informs the human operator that the ODR SPVC has been successfully established. Thereafter, the operator may configure the CPE 20A and 20B and ingress and egress network nodes as known in the art per se to transmit data over the recently established ODR SPVC. It will be seen that since the ingress or source node 32A stores the configuration data for and initiates the ODR SPVC, 20477149.2 the nature of the ODR SPVC is transparent to the remainder of the network 30 and it appears thereto that a conventional SPVC has been requested and established.
The re-route restrictions associated with the ODR SPVC are enforced whenever the network 30 detects that the preferred or primary path of the ODR
SPVC is blocked or inoperative. This may occur when (a) the ODR SPVC is being initially established, or (b) once the ODR SPVC is up and running. In the first case, it is possible, for example, that the CAC processing of an intermediate node in the primary path of the ODR SPVC reports insufficient node resources to progress the ODR SPVC through the intermediate node or a specified link thereon. In such circumstances, the P-NNI signalling protocol provides a crankback procedure wherein a connection request which is blocked along a selected path is rolled back to a DTL-creating node, which in the preferred embodiment is the source node 32A, in order to compute another path to an SPVC
destination endpoint. The P-NNI crankback procedure is initiated by the network node which detects the block path. This node sends a signal indicative of a blocked path, such as a connection clearing message having a crankback IE, back to the source node over the signalling network. The protocol allows a DTL-originating node, such as the source node 32A, which receives this message to re-route the connection using a different path.
In the second case, the blockage of the ODR SPVC preferred path may be detected by the normal operation of the P-NNI links 38 and 40. For example, the P-NNI
signalling protocol uses the services of the UNI signalling ATM adaption layer 2 (SAAL) (layer 2 in the P-NNI Control Plane shown in Fig. 4) for ensuring a reliable signalling link 38 between nodes. The SAAL protocol constantly sends some protocol messages or data units (PDUs) to a node on the other side of the link which must be acknowledged by the 20477149.2 other node. These messages may be sequenced data PDUs, i.e. PDUs which carry layer 3 P-NNI signalling messages for all virtual connections associated with a data link 36, or separately sequenced "poll" and "stat" PDUs. In combination, these messages implement a keep-alive or heartbeat polling process associated with each successive pair of nodes along the path of a call or virtual connection in order to inform each node in the path that the links to neighbour nodes are alive and functioning. Similarly, the P-NNI
routing protocol employs mechanisms such as flooding, sequence number exchange, "lock step"
acknowledgements and check sums to ensure reliable and timely delivery of P-NNI topology state packets (PTSPs). Collectively, these mechanism can detect whenever a P-NNI
routing link 40, and by implication, the associated data link is inoperative.
When a blockage is detected, the P-NNI protocols dictate that the functioning part of the network transmit a signal indicative of a blocked path, such as one of the P-NNI connection clearing messages, to the source or ingress node, specifying the cause for the release. Upon receipt of this signal, the source node may attempt to re-route the connection along a different path.
In the preferred embodiment, when the source node 32A receives a signal indicative of a blocked path, such as one of the P-NNI connection clearing messages, the source node first determines whether the blocked path is associated with ODR
SPVCs managed by the node. If so, the source node attempts to re-initiate the establishment of each such ODR SPVC in accordance with its associated re-routing restriction, as follows:
Primary Path Under the primary path re-routing scheme, the ODR SPVC is restricted to being re-routed only along the nodes and links in its primary path. Failure to route the ODR
SPVC along this path will result in the crankback of the connection to its source node. At 20477149.2 m, this point the source node either immediately attempts to re-route, i.e., re-initiate the connect request of, the ODR SPVC along the nodes and links in its primary path or waits an interval of time before attempting to re-establish the ODR SPVC.
If the failure is due to a link not specified by the operator, the source node immediately re-routes the ODR SPVC along the nodes and links in the primary path. This is done to give the network nodes another opportunity to immediately setup the connection along the nodes and links in the primary path whenever parallel links exist in the area of the link failure. If parallel links exist in the area of the link failure, the appropriate node's call processing means selects a link other than the failed link. The node attempts to commission its cross-connect to ensure the ODR SPVC traverses this new link as it is signalled to the next node in the primary path. If this re-route fails, the connection is cranked back to the source node. At this point the source node waits an interval of time before re-routing the ODR SPVC.
After the waiting interval elapses, the source node re-initiates the ODR SPVC
using the sequence of events described above. Successive attempts to re-route the ODR SPVC using the primary path will result in the source node increasing the interval of time before repeating this sequence. The source node strives to setup the ODR
SPVC
along the nodes and specified links in its primary path until it is successful.
It should be noted that a node failure along the specified path results in the source node attempting to re-route the ODR SPVC along its primary path.
However, the re-route will not succeed unless the failed node is restored. The network nodes are unable to re-route the ODR SPVC on nodes not explicitly specified by the operator because this re-20477149.2 routing scheme restricts the ODR SPVC to routes along the nodes in the primary path. A
link failure along this path results in the source node re-routing the ODR
SPVC along its primary path. However, the success of the re-route depends on the configuration of the primary path of the ODR SPVC; the configuration of the network in the area of the failure;
and the status of the failed link at the time of the re-route.
The re-route may succeed if the operator explicitly selected the failed link as part of the primary path and the failed link is restored when the appropriate node re-routes the ODR SPVC over the link. If the link is not restored and parallel links exist between the adjacent nodes, the node will not re-route the ODR SPVC around this link failure because this re-routing scheme restricts the ODR SPVC to the links specified by the operator.
The re-route may succeed if the link is the sole link between adjacent nodes in the primary path and it is restored when the appropriate node re-routes the ODR SPVC
over the link. In this case it does not matter whether the operator explicitly selected the link as part of the primary path. Since this link is the only link between the adjacent nodes (i.e., parallel links do not exist between the adjacent nodes), the re-route will not succeed until the failed link is restored.
The re-route may succeed if the operator did not select the failed link as part of the primary path and parallel links exist between the adjacent nodes. If the failed link is not restored, the appropriate node's call control software will select a link other than the failed link and attempt to commission its cross connects to ensure the ODR
SPVC traverses this new link as it is signalled to the next node in the primary path.
20477149.2 ~ Primary Path-Alternate Path Under the primary path-alternate path re-routing scheme, an ODR SPVC is restricted to being re-routed only along the nodes and specified links in its primary path or alternate path. Since the primary path is the preferred path of an ODR SPVC, the source node will attempt to set up the ODR SPVC on this path first. Failure to route the ODR SPVC
along the nodes and links in this path will result in the crankback of the connection to its source node. At this point the source node either immediately re-routes the connection along the nodes and links in its primary path or immediately re-routes the connection along the nodes and links in its alternate path.
If the failure is due to a link not specified by the operator, the source node immediately re-routes the ODR SPVC along its primary path. This is done to give the network nodes another opportunity to immediately setup the connection along the nodes and links in the primary path whenever parallel links exist in the area of the link failure. If parallel links exist in the area of the link failure, the appropriate node's call processing means selects a link other than the failed link. The node attempts to commission its cross connect to ensure the ODR SPVC traverses this new link as it is signalled to the next node in the primary path. If the re-route fails, the connection is cranked back to the source node. At this point the source code immediately re-routes the connection along the nodes and links in its alternate path.
Failure to re-route the ODR SPVC along the nodes and links in its alternate path will result in the crankback of the connection to its source node. At this point the source node either immediately re-routes the ODR SPVC along the nodes and links in its alternate path or waits an interval of time before re-routing the ODR SPVC. If the failure is 20477149.2 due to a link not specified by the operator, the source node immediately re-routes the ODR
SPVC along its alternate path. This is done to give the network elements another opportunity to immediately setup the connection along the nodes and links in the alternate path wherever parallel links exist in the area of the link failure. If parallel links exist in the area of the link failure, the appropriate node's call control software selects a link other than the failed link. The node attempts to commission its cross connect to ensure the ODR
SPVC traverses this new link as it is signalled to the next node in the alternate path. If this re-route fails, the connection is cranked back to the source node. At this point the source node waits an interval of time before re-routing the ODR SPVC.
After the waiting interval elapses, the source node re-routes the ODR SPVC
using the sequence of events described above. Successive attempts to re-route the ODR
SPVC using the primary path-alternate path sequence will result in the source node increasing the interval of time before repeating the sequence. The source node strives to setup the connection along the nodes and links in its primary path or alternate path until it is successful.
~ Primary Path-Any Path Under the primary path-any path re-routing scheme, the source node attempts to route an ODR SPVC along the nodes and links in its primary path first. Failure to route the ODR SPVC along this path will result in the crankback of the connection to its source node. At this point the source node either immediately re-routes the ODR SPVC
along the nodes and links in its primary path or immediately re-routes the ODR
SPVC using conventional SPVC routing (i.e., using SVC routing).
20477149.2 If the failure is due to a link not specified by the operator, the source node immediately re-routes the ODR SPVC along its primary path. This is done to give the network elements another opportunity to immediately setup the connection along the nodes and links in the primary path whenever parallel links exist in the area of the link failure. If parallel links exist in the area of the link failure, the appropriate node's call control software selects a link other than the failed link. The node attempts to commission its cross connect to ensure the ODR SPVC traverses this new link as it is signalled to the next node in the primary path. If the re-route fails, the connection is cranked back to the source node. At this point the source node immediately re-routes the ODR SPVC via conventional SPVC or SVC routing.
If SVC routing fails, the source node waits an interval of time before re-routing the ODR SPVC. After the time elapses, the source node re-routes the ODR SPVC
using the sequence of events described above. Successive attempts to re-route the ODR
SPVC using the primary path-any path sequence will result in the source node increasing the interval of time before repeating the sequence. The source node strives to setup the connection until it is successful.
~ Primary Path-Alternate Path-Any Path Under the primary path-alternate path-any path re-routing scheme, the source node will attempt to setup the UDR SPVC on the primary path first.
Failure to route the ODR SPVC along the nodes and links in this path will result in the crankback of the connection to its source node. At this point the source node either immediately re-routes the connection along the nodes and links in its primary path or immediately re-routes the connection along the nodes and links in its alternate path.
20477149.2 If the failure is due to a link not specified by the operator, the source node immediately re-routes the ODR SPVC along its primary path. This is done to give the network nodes another opportunity to immediately setup the connection along the nodes and links in the primary path whenever parallel links exist in the area of the link failure. If parallel links exist in the area of the link failure, the call processing means of appropriate node selects a link other than the failed link. The node attempts to commission its cross connect to ensure the ODR SPVC traverses his new link as it is signalled to the next node in the primary path. If the re-route fails, the connection is cranked back to the source node. At this point the source node immediately re-routes the connection along the nodes and links in its alternate path.
Failure to re-route the ODR SPVC along the nodes and links in its alternate path will result in the crankback of the connection to its source node. At this point the source node either immediately re-routes the ODR SPVC along the nodes and links in its alternate path or immediately re-routes the ODR SPVC via SVC routing. If the failure is due to a link not specified by the operator, the source node immediately re-routes the ODR
SPVC along its alternate path. This is done to give the network nodes another opportunity to immediately setup the connection along the nodes and links in the alternate path whenever parallel links exist in the area of the link failure. If parallel links exist in the area of the link failure, the appropriate node's call processing means selects a link other than the failed link. The node attempts to commission its cross connect to ensure the ODR SPVC
traverses this new link as it is signalled to the next node in the alternate path. If the re-route fails, the connection is cranked back to the source code. At this point the source node immediately re-routes the ODR SPVC via conventional SPVC or SVC routing.
20477149.2 If SVC routing fails, the source node waits an interval of time before re-routing the ODR SPVC. After the waiting interval elapses, the source node re-routes the ODR SPVC using the sequence of events described above. Successive attempts to re-route the ODR SPVC using the primary path-alternate path-any path sequence will result in the source node increasing the interval of time before repeating the sequence. The source node strives to setup the connection unit it is successful.
Fig. 5 illustrates a preferred relational database structure 52 used by a given network node 32 to keep track of ODR SPVCs managed thereby. The node database structure includes the following tables: (a) an indexed table 54 of P-NNI
network node identifiers; (b) an indexed table 56 of "compressed" ODR SPVC DTLs, as explained in greater detail below, and an ODR SPVC list 58, part 59 of which is stored in random access memory. The ODR SPVC database includes one record for each ODR SPVC which has originated from or is managed by the node. Each ODR SPVC record includes:
(a) an "operatorDrtRtng" field 60 which specifies whether the corresponding ODR SPVC is a conventional SPVC or an ODR SPVC;
(b) a "prmNtwrkPathlndex" field 62 which points to an entry in the compressed DTL table that represents the primary path of an ODR
SPVC;
(c) a "altNtwrkPathlndex" field 64 which points to the alternate path entry in the compressed DTL table for the ODR SPVC; and (d) a "re-route scheme" field 66 which stores the re-route scheme for the ODR SPVC.
20477149.2 In this manner, the source node of an SPVC can determine whether the SPVC is an ODR SPVC, and, if so, determine the attributes associated with the ODR SPVC
in order to take appropriate action in the event of link failure.
The compressed DTL table 54 has a "compressedDTL" field 68 for storing network paths in a compressed format. A compressed network path is illustrated in greater detail at reference no. 68' and comprises a sequence of link identifiers (i.e.
P-NNIPortldfield 70), and pointers 72 to the node table 54. In the preferred embodiment, P-NNIPortld=0 signifies that no link has been specified by the operator, whereby intermediate nodes in the path of the ODR SPVC are free to select whichever link is available on the node.
Those skilled in the art will appreciate that in the P-NNI routing protocol a "node" can in fact represent an entire subnetwork or "peer group". For example, a node identifer may be a sub-prefix of an ATM node address (itself a prefix of an end system ATM
address) which summarizes the reachability of all nodes in the subnetwork or peer group.
The NMS 46, however, is typically connected to each node in an entire network, including the nodes in the subnetworks thereof, so that the operator can be made aware of and manually select each physical switching element, and optionally, the links, in each subnetwork along the path of an ODR SPVC. In this case, the DTL in SPVC Call Setup message will specify the complete path (i.e., at least each and every physical switch) to the SPVC destination end point. In this embodiment, since the complete path is specified in the DTL, in the event of a link failure, the crankback procedures discussed previously operate to crank back the connection request back to the originating source node.
20477149.2 Alternatively, however, the operator may specify a subnetwork in the path of the ODR SPVC, without detailing the specific nodes to be traversed in the subnetwork. In this case, the peer group leader node (hereinafter the "lead node") in the subnetwork computes the path the subnetwork to a following node or subnetwork specified in the DTL
of the SPVC Call Setup message. In such an alternative embodiment, in the event of a link failure in the subnetwork, the aforementioned P-NNI crankback procedures operate to crankback the connection request to the peer group leader node of subnetwork (since it is a DTL originator), whereby the lead node may compute an alternate path through the subnetwork to reach the following node or subnetwork specified in the DTL of the connection request. If the reroute is unsuccessful, the lead node then cranks the connection request back to the originating source node so that it may apply the ODR SPVC
reroute scheme.
The preferred embodiments have been described with a certain degree of particularity. Those skilled in the art will appreciate that numerous modifications and variations may be made to the preferred embodiments without departing from the spirit and scope of the invention.
20477149.2

Claims (41)

Claims:
1. A method of establishing a connection in a source-routed, connection-orientated, data network which comprises a signalling network for forwarding connection requests to network nodes, said method comprising the steps of:
(a) manually provisioning a preferred path for the connection, including a source node, a destination node, and intermediate nodes therebetween;
(b) storing the preferred path in a memory associated with the source node;
(c) creating a source-routed connection request message which specifies the preferred path;
(d) successively signalling the connection request message over the signalling network from the source node to each other node along the preferred path and commissioning a bearer channel cross-connection on each said node in order to connect adjacent nodes along the preferred path; and (e) connecting end-user equipment to the source and destination nodes.
2. The method according to claim 1, including the optional steps of manually provisioning a link in the preferred path and specifying the link in the source-routed connection request message, prior to step 1 (d).
3, The method according to claim 2, wherein the nodes commission the bearer channel cross-connections so as to use those links specified in the source-routed connection request message.
4. The method according to claim 3, wherein adjacent nodes automatically select a link in the event the source-routed connection request message does not identify the link to be used between adjacent nodes.
5. The method according to claim 1, including the steps of manually selecting a re-routing scheme and storing the re-routing scheme on the source node, prior to step 1(d).
6. The method according to claim 5, including the steps of manually provisioning an alternate path of nodes and optional links for the connection and storing the alternate path on the source node.
7, The method according to claim 6, wherein the re-routing scheme constrains the path along which the connection may be re-routed in the event of a link failure along the preferred path, said constraint being one of (i) the preferred path only; (ii) the alternative path; (iii) any possible path from the source node to the destination node;
and (iv) the alternative path, and if the alternative path is not available, any possible path from the source node to the destination node.
8. The method according to claim 7, wherein the network is a P-NNI network and the source-routed connection message is an SPVC Call Setup message which includes a designated transit list (DTL) specifying each intermediate node between the source node and the destination node.
9. The method according to claim 8, including the step of cranking back the connection request to the source node for re-routing the connection in the event the link failure occurs during the establishment of the connection.
10. The method according to claim 8, including the step of signalling the source node over the signalling network to re-route the connection in the event the link failure occurs after the establishment of the connection.
11. A method of establishing a connection in a source-routed, connection-orientated, data network which comprises a signalling network for forwarding connection requests to network nodes, said method comprising the steps of:
(a) manually provisioning a preferred path for the connection, including a source node, a destination node, and intermediate nodes therebetween;
(b) manually provisioning a re-routing restriction for the connection;
(c) storing the preferred path and the re-routing restriction in a memory associated with the source node;
(d) creating a source-routed connection request message which specifies the preferred path;
(e) each node along the preferred path successively signalling the connection request message over the signalling network to a following node along the preferred path and commissioning a bearer channel cross-connection on each said node in order to connect adjacent nodes along the preferred path;
signalling source node in the event of a blockage in the preferred path and, in such event, re-initiating steps (d) and (e) using a path permitted by the manually provisioned re-routing restriction; and (g) connecting end-user equipment to the source and destination nodes in the event the connection is successfully established.
12. The method according to claim 11, including the optional steps of manually provisioning a link in the preferred path and specifying the link in the source-routed connection request message, prior to step 1 (d).
13. The method according to claim 12, wherein the nodes commission the bearer channel cross-connections so as to use those links specified in the source-routed connection request message.
14. The method according to claim 3, wherein adjacent nodes automatically select a link in the event the source-routed connection request message does not identify the link to be used between adjacent nodes.
15. The method according to claim 11, wherein the re-routing scheme comprises one of (i) the preferred path only; (ii) a manually provisioned alternative path; (iii) any possible path from the source node to the destination node.
16. The method according to claim 11, wherein the network is a P-NNI network and the source-routed connection request message includes a designated transit list (DTL) specifying each intermediate node between the source node and the destination node.
17. The method according to claim 16, including the step of cranking back the connection request to the source node for re-routing the connection in the event the preferred path is blocked during the establishment of the connection.
18. The method according to claim 17, including the step of signalling the source node over the signalling network to re-route the connection in the event connection becomes inoperative after its establishment.
19. A method of establishing a connection in a source-routed, connection-orientated, data network which comprises a signalling network for forwarding connection requests to network nodes, said method comprising the steps of:
(a) manually provisioning a preferred path for the connection, including a source node, a destination node, and intermediate nodes or subnetworks therebetween;
(b) storing the preferred path in a memory associated with the source node;
(c) creating a source-routed connection request message which specifies the preferred path;
(d) successively signalling the connection request message over the signalling network from the source node to each other node or subnetwork along the preferred path and commissioning a bearer channel cross-connection on each said node, or on nodes located in said subnetworks, in order to connect adjacent nodes along the preferred path; and (e) connecting end-user equipment to the source and destination nodes.
20. The method according to claim 19, including the steps of manually provisioning a link in the preferred path and specifying the link in the source-routed connection request message, prior to step 19(d).
21. The method according to claim 20, wherein the nodes commission the bearer channel cross-connections so as to use those links specified in the source-routed connection request message.
22. The method according to claim 19, wherein adjacent nodes automatically select a link in the event the source-routed connection request message does not identify the link to be used between adjacent nodes or subnetworks.
23. The method according to claim 19, including the steps of manually selecting a re-routing scheme and storing the re-routing scheme on the source node, prior to step 1(d).
24. The method according to claim 23, including the steps of manually provisioning an alternative path of nodes or subnetworks for the connection and storing the alternate path on the source node.
25. The method according to claim 24, wherein the re-routing scheme constrains the path along which the connection may be re-routed in the event of a link failure along the preferred path, said constraint being one of (i) the preferred path only; (ii) the alternative path; (iii) any possible path from the source node to the destination node;
and (iv) the alternative path, and if the alternative path is not available, any possible path from the source node to the destination node.
26. The method according to claim 25, wherein the network is a P-NNI network and the source-routed connection message is an SPVC Call Setup message which includes a designated transit list (DTL) specifying each intermediate node or subnetwork between the source node and the destination node.
27, The method according to claim 26, including the step of cranking back the connection request to the source node for re-routing the connection in the event the link failure occurs during the establishment of the connection.
28. The method according to claim 26, including the step of signalling the source node over the signalling network to re-route the connection in the event the link failure occurs after the establishment of the connection.
2g. The method according to claim 19, including the steps of cranking back the connection request to a peer group leader node of a given subnetwork in the manually provisioned path in the event of a link failure in the given subnetwork and re-routing the connection through the given subnetwork to a following node or subnetwork specified in the manually provisioned path.
30. A method of establishing a connection in a sourced-routed, connection-orientated, data network which comprises a signalling network for forwarding connection requests to network nodes, said method comprising the steps of:
(a) manually provisioning a preferred path for the connection, including a source node, a destination node, and intermediate nodes or subnetworks therebetween;
(b) manually provisioning a re-routing restriction for the connection;
(c) storing the preferred path and the re-routing restriction in a memory associated with the source node;
(d) creating a source-routed connection request message which specifies the preferred path;
(e) each node or subnetwork along the preferred path successively signalling the connection request message over the signalling network to a following node or subnetwork along the preferred path and commissioning a bearer channel cross-connection on each said specified node, or on nodes located in said subnetwork which have been identified by the subnetworks themselves, in order to connect adjacent nodes or subnetworks along the preferred path;
(f) signalling source node in the event of a blockage in the preferred path and, in such event, re-initiating steps (d) and (e) using a path permitted by the manually provisioned re-routing restriction; and (g) connecting end-user equipment to the source and destination nodes in the event the connection is successfully established.
31. The method according to claim 30, including the steps of manually provisioning a link between nodes or subnetworks in the preferred path and specifying the link in the source-routed connection request message, prior to step 1 (d).
32. The method according to claim 31, wherein the nodes commission the bearer channel cross-connections so as to use those links specified in the source-routed connection request message.
33. The method according to claim 32, wherein adjacent nodes automatically select a link therebetween in the event the source-routed connection request message does not identify the link to be used between adjacent nodes.
34. The method according to claim 30, wherein the re-routing scheme comprises one of (i) the manually provisioned preferred path only; (ii) a manually provisioned alternative path; (iii) any possible path from the source node to the destination node.
35. The method according to claim 30, wherein the network is a P-NNI network and the source-routed connection request message is an SPVC Call Setup message which includes a designated transit list (DTL) specifying each intermediate node between the source node or subnetwork and the destination node.
36. The method according to claim 30, including the step of cranking back the connection request to the source node for re-routing the connection in the event the preferred path is blocked during the establishment of the connection.
37. The method according to claim 36, including the step of signalling the source node over the signalling network to re-route the connection in the event connection becomes inoperative after its establishment.
38, The method according to claim 35, including the steps of cranking back the connection request to a peer group leader of a given subnetwork located along the path of the connection in the event the connection is blocked or becomes inoperative and re-routing the connection through the given subnetwork to a following node or subnetwork specified in the DTL.
39. A connection-orientated data network, comprising:
user interface means for manually provisioning a network path specifying at least a source node, a destination node, and each intermediate node therebetween for a connection;
a plurality of interconnected network nodes, each comprising calf processing means for receiving a source-routed connection request message incorporating a transit list, establishing a bearer channel cross-connection linking the node to a previous node and a following node in the transit list, and forwarding the connection request message to the following node in the transit list, wherein the user interface means is connected to the source node and signals the source node to create and signal a source routed connection request message having its transit list specifying the manually provisioned network path.
40. A connection-orientated data network, comprising:
user interface means for manually provisioning a preferred network path for a connection and a rerouting scheme therefor, said preferred network path specifying at least a source node, a destination node, and each intermediate node therebetween;
a plurality of interconnected network nodes, each comprising call processing means for (a) receiving a source-routed connection request message incorporating a transit list, (b) establishing a bearer channel cross-connection linking the node to a previous node and a following node in the transit list, (c) forwarding the connection request message to the following node in the transit list, and (d) cranking back the connection request to the source node in the event the preferred network path is blocked and re-routing the connection in accordance with the re-routing scheme, wherein the user interface means is connected to the source node and signals the source node to create and signal a source routed connection request message having its transit list specifying the manually provisioned network path.
41. The connection-orientated data networkaccording to claim 40, wherein the rerouting scheme comprises one of (a) the preferred network path only, (b) an alternate manually provisioned network path, and (c) any available network path to the destination node.
CA002239032A 1998-05-28 1998-05-28 Operator directed routing of soft permanent virtual circuits in a connection-orientated network Abandoned CA2239032A1 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CA002239032A CA2239032A1 (en) 1998-05-28 1998-05-28 Operator directed routing of soft permanent virtual circuits in a connection-orientated network
US09/321,195 US6697329B1 (en) 1998-05-28 1999-05-27 Operator directed routing of connections in a digital communications network
ES99109317T ES2320186T3 (en) 1998-05-28 1999-05-28 CONNECTION ROAD DIRECTED BY COMPUTER IN A DIGITAL COMMUNICATIONS NETWORK.
EP99109317A EP0961518B1 (en) 1998-05-28 1999-05-28 Operator directed routing of connections in a digital communications network
AT99109317T ATE413785T1 (en) 1998-05-28 1999-05-28 CONNECTION CONTROL (ROUTING) PERFORMED BY AN OPERATOR IN A DIGITAL COMMUNICATIONS NETWORK
DE69939856T DE69939856D1 (en) 1998-05-28 1999-05-28 Operator-led connection control (routing) in a digital communication network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CA002239032A CA2239032A1 (en) 1998-05-28 1998-05-28 Operator directed routing of soft permanent virtual circuits in a connection-orientated network

Publications (1)

Publication Number Publication Date
CA2239032A1 true CA2239032A1 (en) 1999-11-28

Family

ID=4162490

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002239032A Abandoned CA2239032A1 (en) 1998-05-28 1998-05-28 Operator directed routing of soft permanent virtual circuits in a connection-orientated network

Country Status (6)

Country Link
US (1) US6697329B1 (en)
EP (1) EP0961518B1 (en)
AT (1) ATE413785T1 (en)
CA (1) CA2239032A1 (en)
DE (1) DE69939856D1 (en)
ES (1) ES2320186T3 (en)

Families Citing this family (62)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6816454B1 (en) * 1998-10-26 2004-11-09 Marconi Communications, Inc. Method and system for manipulating the order permanent connections are released
US7457233B1 (en) 1999-07-15 2008-11-25 Juniper Networks, Inc. Method and apparatus for fast reroute in a connection-oriented network
US7151775B1 (en) * 1999-09-23 2006-12-19 Pluris, Inc. Apparatus and method for forwarding data on multiple label-switched data paths
US7796504B1 (en) * 1999-10-21 2010-09-14 Tellabs Operations, Inc. Method for establishing an MPLS data network protection pathway
US7298693B1 (en) 1999-10-21 2007-11-20 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
JP2001156798A (en) * 1999-11-29 2001-06-08 Hitachi Ltd Vc changeover method and atm switch
JP3356145B2 (en) * 1999-12-22 2002-12-09 日本電気株式会社 Transmission line failure relief method, transmission line failure relief system, storage medium, and router
JP2001251351A (en) * 2000-03-02 2001-09-14 Nec Corp Input packet processing system for packet switch
JP3790655B2 (en) * 2000-03-06 2006-06-28 富士通株式会社 Label switch network system
IL137082A (en) * 2000-06-29 2004-08-31 Eci Telecom Ltd Method for forwarding a data packet within an mpls domain
US7016379B2 (en) * 2000-07-21 2006-03-21 Lucent Technologies Inc. Integrated network element
CA2327918A1 (en) * 2000-12-08 2002-06-08 Alcatel Canada Inc. System and method of operating a communication network associated with an mpls implementation on an atm platform
US20030014516A1 (en) * 2001-07-13 2003-01-16 International Business Machines Corporation Recovery support for reliable messaging
DE10138715A1 (en) * 2001-08-07 2003-02-20 Siemens Ag Setting up connections in connection sequence involves setting up sequence of several connection paths using signaling of single signaling information item
US7289441B1 (en) * 2002-07-22 2007-10-30 Cisco Technology, Inc. Flexible WAN protocol call admission control algorithm
US7835266B2 (en) * 2002-10-29 2010-11-16 Fujitsu Limited Node apparatus and maintenance and operation supporting device
US20040109428A1 (en) * 2002-12-09 2004-06-10 Srikanth Krishnamurthy Method and apparatus for resource allocation for multiple traffic classes in wireless ad-hoc networks
US8150018B2 (en) 2002-12-18 2012-04-03 Cisco Technology, Inc. System and method for provisioning connections as a distributed digital cross-connect over a packet 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
US7701860B2 (en) * 2003-02-21 2010-04-20 Alcatel Lucent Control plane stability in communications networks
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
US7698456B2 (en) * 2003-09-29 2010-04-13 Cisco Technology, Inc. Methods and apparatus to support routing of information
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
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
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
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
US7630302B2 (en) * 2003-12-23 2009-12-08 At&T Intellectual Property I, L.P. Method and system for providing a failover circuit for rerouting logical circuit data in a data network
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
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
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
ITMI20040293A1 (en) 2004-02-20 2004-05-20 Marconi Comm Spa PROTECTION SYSTEMS FOR COMMUNICATION NETWORKS
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
US7768904B2 (en) * 2004-04-22 2010-08-03 At&T Intellectual Property I, L.P. Method and system for fail-safe renaming of logical circuit identifiers for rerouted logical circuits in a data network
US7623535B2 (en) * 2004-09-09 2009-11-24 Cisco Technology, Inc. Routing protocol support for half duplex virtual routing and forwarding instance
US9014181B2 (en) * 2004-11-01 2015-04-21 Alcatel Lucent Softrouter separate control network
US9100266B2 (en) * 2004-11-01 2015-08-04 Alcatel Lucent SoftRouter protocol failovers
US8953432B2 (en) * 2004-11-01 2015-02-10 Alcatel Lucent Softrouter dynamic binding protocol
KR100705566B1 (en) * 2004-12-23 2007-04-10 삼성전자주식회사 Apparatus and method of performance managing in mpls network
WO2006077462A1 (en) * 2005-01-20 2006-07-27 Nortel Networks Limited Dynamic establishment of virtual circuits using multi-segment pseudowires
US7953096B2 (en) * 2005-11-23 2011-05-31 Ericsson Ab Method and system for communication using a partial designated transit list
US8295162B2 (en) 2006-05-16 2012-10-23 At&T Intellectual Property I, L.P. System and method to achieve sub-second routing performance
US7715309B2 (en) * 2006-05-24 2010-05-11 At&T Intellectual Property I, L.P. Method and apparatus for reliable communications in a packet network
US7782790B1 (en) * 2006-06-16 2010-08-24 Cisco Technology, Inc. Extensions to the path verification protocol to support link bundling constructs
JP5088020B2 (en) * 2007-07-04 2012-12-05 日本電気株式会社 Node device, optical transmission network, label management method used therefor, and program thereof
US8711676B2 (en) 2007-08-02 2014-04-29 Foundry Networks, Llc Techniques for determining optimized local repair paths
US8040792B2 (en) 2007-08-02 2011-10-18 Foundry Networks, Llc Techniques for determining local repair connections
US8358576B2 (en) * 2007-10-03 2013-01-22 Foundry Networks, Llc Techniques for determining local repair paths using CSPF
US8036118B2 (en) * 2008-02-01 2011-10-11 Cisco Technology, Inc. Inducing symmetry via multi topology routing
JP2013511857A (en) 2009-09-23 2013-04-04 エアロバイロメント,インコーポレイテッド Multipath network regular redundancy using performance monitoring
US8665752B2 (en) * 2011-07-05 2014-03-04 Ciena Corporation Network modeling, service provisioning, and service management
US9356859B2 (en) 2011-08-16 2016-05-31 Brocade Communications Systems, Inc. Techniques for performing a failover from a protected connection to a backup connection
US8854955B2 (en) * 2012-11-02 2014-10-07 Ciena Corporation Mesh restoration and bandwidth allocation systems and methods for shared risk connection groups
US9405445B2 (en) 2012-12-21 2016-08-02 Navionics Spa Apparatus and methods for routing
US9086278B2 (en) * 2012-12-21 2015-07-21 Navionics Spa Apparatus and methods for routing
US9253097B1 (en) 2012-12-28 2016-02-02 Juniper Networks, Inc. Selective label switched path re-routing
US8913490B1 (en) * 2012-12-28 2014-12-16 Juniper Networks, Inc. Selective notification for label switched path re-routing
WO2021166015A1 (en) * 2020-02-17 2021-08-26 日本電信電話株式会社 Optical communication network management device

Family Cites Families (6)

* 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
JPH09233089A (en) * 1996-02-26 1997-09-05 Fujitsu Ltd Fixed length cell processing exchange and private line connection control method in fixed length cell processing exchange
US5781529A (en) * 1996-03-27 1998-07-14 General Datacomm, Inc. Systems and methods for routing ATM switched virtual circuit calls
US6078575A (en) * 1996-10-01 2000-06-20 Lucent Technologies Inc. Mobile location management in ATM networks
US6243384B1 (en) * 1998-03-23 2001-06-05 Telefonaktiebolaget Lm Ericsson Address analysis for asynchronous transfer mode node with PNNI protocol
US6434619B1 (en) * 1998-04-29 2002-08-13 Alcatel Canada Inc. Internet-enabled service management system and method

Also Published As

Publication number Publication date
EP0961518A3 (en) 2002-06-12
EP0961518B1 (en) 2008-11-05
DE69939856D1 (en) 2008-12-18
EP0961518A2 (en) 1999-12-01
US6697329B1 (en) 2004-02-24
ATE413785T1 (en) 2008-11-15
ES2320186T3 (en) 2009-05-19

Similar Documents

Publication Publication Date Title
EP0961518B1 (en) Operator directed routing of connections in a digital communications network
US7313087B2 (en) Distributed protection switching
EP1213881B1 (en) System and a method for establishing a communication path on an ATM platform
US8018939B2 (en) MPLS implementation of an ATM platform
US6069895A (en) Distributed route server
US6292463B1 (en) Method and apparatus for recovering from a signalling failure in a switched connection data transmission network
US6275493B1 (en) Method and apparatus for caching switched virtual circuits in an ATM network
EP1215857A2 (en) System and method for operating a communication network on an ATM platform
US20030090995A1 (en) Pre-provisioning a light path setup
USRE40398E1 (en) ATM telecommunications systems and method for routing narrow band traffic
US7200110B1 (en) Method and apparatus for prioritized release of connections in a communications network
US6594235B1 (en) Method of triggering reroutes in an asynchronous transfer mode network
US8547849B2 (en) ATM telecommunications systems and method for routing narrow band traffic
US20040208191A1 (en) SVC/SPVC with L3 IP forwarding
US7855949B1 (en) Method and apparatus for bundling signaling messages for scaling communication networks
JP2972677B2 (en) Asynchronous transfer mode communication network
Yurcik Providing ATM multipoint survivability via disjoint VC mesh backup groups
Zavialov Distributed Failure Restoration for Asynchronous Transfer Mode (ATM) Tactical Communication Networks

Legal Events

Date Code Title Description
FZDE Discontinued
FZDE Discontinued

Effective date: 20040528