Multiplex communications – Fault recovery – Bypass an inoperative channel
Reexamination Certificate
1999-06-11
2004-11-02
Yao, Kwang Bin (Department: 2667)
Multiplex communications
Fault recovery
Bypass an inoperative channel
C370S248000
Reexamination Certificate
active
06813240
ABSTRACT:
BACKGROUND
The present invention relates to a telecommunications network provisioned with a distributed restoration algorithm (DRA) and, more particularly, to ascertaining the quality of certain links cross-connecting adjacent nodes in the network.
In a telecommunications network provisioned with a distributed restoration algorithm (DRA), when a fault occurs at any one of the links of the network, the DRA algorithm within each node would try to find an alternate route that circumvents the failed link, or node, by using the spare links that interconnect the nodes of the network. Normally, to find an alternate path or paths, the DRA process first determines the availability of any spare links after the failure is detected. As spare links that form the alternate paths are found, all of those spare links are presumed to be equivalents in terms of their reliability.
When there is a failure, the DRA process has to act quickly, so as to minimize the disruption to the network. Accordingly, the DRA process usually does not have the time to monitor the integrity of the spare links for any length of time before the disrupted traffic is switched onto the available spare links that form the alternate route(s). As a consequence, some of the spare links that the DRA process selects may fail subsequent to the switch. Such subsequent failure is undesirable insofar as it compounds the disruptive effects of a failure.
Therefore, a method is required for a DRA process to readily identify any links that are seemingly intact but are susceptible to failure shortly after the restoration process, i.e., the switching of the disrupted traffic onto the spare link, is completed. By being able to identify those links that are susceptible to failure shortly after restoration, i.e., low quality links, the DRA process can make a better selection of the alternate paths for rerouting the disrupted traffic.
Some known methods are based partly on a determination of whether a spare link is part of a span where other links have failed. The assumption of these methods is that within a span where some links have failed, the failure of the remaining links is also likely. Such a characterization relies mostly upon identifying the custodial nodes adjacent a failed span so that any seemingly intact spare link(s) between the custodial nodes may be assigned a lower quality rating. Thus, each node in a network that has observed a failed link would emanate a message along all of the spare links. But there is no way for a node to know which spare links corresponds to a given working link. In other words, there is no communications means within the working links to allow for node identification. Thus, the message is sent out indiscriminately along all spare links rather than only the selected few where failure had actually occurred. Consequently, this technique gives rise to inefficiency in communication.
A method is therefore required for more reliably identifying low quality spare links and, more specifically, for identifying the particular pair of custodial nodes that are associated with each span failure so that the proper quality value may be assigned to those spare links associated with the failed span.
SUMMARY
When a portion of a path through a telecommunications network is interrupted due to a failure of the link(s) along the path, the failure is detected by the nodes on either side of the failure. The detecting nodes adjacent the failure, i.e., the custodial nodes, each independently output a special message towards the respective end nodes of the failed path. The special message includes, among other things, information about which portion, i.e. the links, of the failed path, remain functional or intact. This information is provided to the various nodes of the network using the functioning or intact links of the path.
When each end node of the failed path receives the special message, it extracts the identity of the custodial node from the route information portion of the message. Each end node, in turn, informs the other end node of the location of the custodial node from which the special message was received by means of a data communications network independent of the telecommunications network, such as a wide area network (WAN). Then the end nodes, collectively or individually, communicate over the independent communications network custodial node information to each custodial node of the failed link to inform that custodial node of the identity of the other custodial node. With each custodial node cognizant of its opposing custodial node, any failed link that cross-connects custodial nodes can be identified. The quality of such identified link is then presumed to be lower than those links that are not associated with both custodial nodes. This presumption is based on the fact that those functional links that cross-connect the custodial nodes of the failed link may very well be rendered non-functional shortly because whatever caused the failure to occur at the failed link will most likely also affect those remaining functional links.
An objective of the present invention is to eliminate the propagation of unnecessary “I am a custodial node” messages to the various nodes of the network by providing to each of the custodial nodes of a failed link the knowledge of which of its adjacent nodes is the other custodial node.
It is another objective of the present invention to readily determine the quality of the links interconnecting the nodes of the network by readily segregating those functional links that cross-connect the custodial nodes of a failed link from other functional links.
It is moreover another objective of the present invention to more accurately determine which spare links lie along a failed link and, more particularly, which functional links are associated with the failed link and should therefore be considered to be of lower quality.
REFERENCES:
patent: 4466060 (1984-08-01), Riddle
patent: 4648088 (1987-03-01), Cagle et al.
patent: 4825206 (1989-04-01), Brice, Jr. et al.
patent: 4853927 (1989-08-01), Wenzel
patent: 4884263 (1989-11-01), Suzuki
patent: 4941089 (1990-07-01), Fischer
patent: 4956835 (1990-09-01), Grover
patent: 5070497 (1991-12-01), Kleine-Altekamp
patent: 5146452 (1992-09-01), Pekarske
patent: 5173689 (1992-12-01), Kusano
patent: 5189662 (1993-02-01), Kleine-Altekamp
patent: 5212475 (1993-05-01), Thoma
patent: 5218601 (1993-06-01), Chujo et al.
patent: 5233600 (1993-08-01), Pekarske
patent: 5235599 (1993-08-01), Nishimura et al.
patent: 5241534 (1993-08-01), Omuro et al.
patent: 5253248 (1993-10-01), Dravida et al.
patent: 5319632 (1994-06-01), Iwasaki
patent: 5325366 (1994-06-01), Shinbashi
patent: 5435003 (1995-07-01), Chng et al.
patent: 5455832 (1995-10-01), Bowmaster
patent: 5457556 (1995-10-01), Shiragaki
patent: 5479608 (1995-12-01), Richardson
patent: 5493273 (1996-02-01), Smurlo et al.
patent: 5495471 (1996-02-01), Chow et al.
patent: 5499237 (1996-03-01), Richetta et al.
patent: 5537532 (1996-07-01), Chng et al.
patent: 5548639 (1996-08-01), Ogura et al.
patent: 5572512 (1996-11-01), Cutler et al.
patent: 5581689 (1996-12-01), Slominski et al.
patent: 5586112 (1996-12-01), Tabata
patent: 5590118 (1996-12-01), Nederlof
patent: 5590119 (1996-12-01), Moran et al.
patent: 5598403 (1997-01-01), Tatsuki
patent: 5623481 (1997-04-01), Russ et al.
patent: 5636203 (1997-06-01), Shah
patent: 5636206 (1997-06-01), Amemiya et al.
patent: 5646936 (1997-07-01), Shah et al.
patent: 5657320 (1997-08-01), Russ et al.
patent: 5680326 (1997-10-01), Russ et al.
patent: 5710777 (1998-01-01), Gawne
patent: 5721727 (1998-02-01), Ashi et al.
patent: 5734687 (1998-03-01), Kainulainen
patent: 5748611 (1998-05-01), Allen et al.
patent: 5748617 (1998-05-01), McLain, Jr.
patent: 5757774 (1998-05-01), Oka
patent: 5768256 (1998-06-01), Allen et al.
patent: 5781535 (1998-07-01), Russ et al.
patent: 5796736 (1998-08-01), Suzuki
patent: 5802144 (1998-09-01), Laird et al.
patent: 5812524 (1998-09-01), Moran et al.
patent: 5832196 (1998-11-01), Croslin et al.
patent: 5832197 (1998-11-01), Houji
patent: 5838660
MCI Inc.
Yao Kwang Bin
LandOfFree
Method of identifying low quality links in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of identifying low quality links in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of identifying low quality links in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3299791