Multiplex communications – Fault recovery – Bypass an inoperative station
Patent
1998-02-23
2000-11-14
Hsu, Alpus H.
Multiplex communications
Fault recovery
Bypass an inoperative station
370225, 370228, 370249, 709239, G06F 1100, G06F 15173
Patent
active
061479667
DESCRIPTION:
BRIEF SUMMARY
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to a method of finding, or determining, a route in a communication network; to a node arranged to perform the method; and to a network comprising such nodes. A route may be needed to replace an existing route which has failed, and such a route is referred to as a restoration route, or a route may be required to supplement an existing route which is becoming congested. As used herein, the term "additional route" embraces both restoration routes and supplementary routes.
2. Description of Related Art
It is known, for example from the article "The Self-Healing Network: A Fast Distributed Restoration Technique For Networks Using Digital Cross-Connect Machines", W. D. Grover, IEEE Globecom 87, and from U.S. Pat. No. 4,956,835 (Wayne D. Grover) to respond at the two nodes (known as failure nodes) connected to a failed span to receipt of a span failure alarm to initiate a real-time restoration process.
The failure nodes determine on the basis of their unique network identities (IDs) which node acts as Sender and which node acts as Chooser (also known as Master and Slave, respectively).
For each of the links of the failed span the Sender repeatedly transmits (floods) respective route-finder signatures to its neighbouring nodes (known as Tandem nodes) which forward flood the signatures to their neighbouring nodes. In one embodiment in the abovementioned US patent a node knows only its own identity (ID) and learns the ID of the node to which connectivity has been lost by reading the last valid contents of a receive signature register on the affected port(s) corresponding to the failed link(s), and in an alternative embodiment, a node stores and maintains a neighbour node ID table.
The node which decides to act as Chooser now enters a waiting state and remains in it until it receives a route-finder signature. Then it responds by transmitting a respective complementary reverse-linking signature (also known as a confirmation or return signature) to the Tandem node from which the route-finder signature was received. The confirmation signature travels back through the Tandem nodes establishing the required switch connections between node input and output ports, and eventually arrives at the Sender node, which then ceases transmitting the respective route-finder signatures, and proceeds to transmit on that newly established restoration route the traffic which would have been transmitted on the corresponding link of the failed span.
The abovementioned US patent also discloses that the restoration mechanism can be used for automatic provisioning of new circuit routes in a network by placing two nodes, between which it is desired to provision additional (i.e. Supplementary circuit routes, directly into Sender and Chooser states with regard to an artificial fault between the selected nodes. The nodes would be supplied with artificial fault information including the number of circuit routings that are being sought.
SUMMARY OF THE INVENTION
According to a first aspect of the present invention, there is provided a method of determining an additional route in a fully or partly meshed communications network of nodes, the method comprising the steps of: accordance with a respective predetermined master/slave relationship, at each of a pair of the nodes between which there is an existing route, the one node of said pair which is to act as master end node with respect to said existing route and the other node which is to act as slave end node; signature for said existing route; whether such receiving node is the slave end node for said existing route and, in the event that it is not, forwarding such received forward route-finder signature to its neighbouring nodes;
determining at said other node in response to a second predetermined circumstance a potential additional route and sending from said other node on said potential additional route a route confirmation signature identifying said potential additional route; and
storing details of said potential r
REFERENCES:
patent: 4956835 (1990-09-01), Grover
patent: 5065399 (1991-11-01), Hasegawa et al.
patent: 5435003 (1995-07-01), Chng et al.
patent: 5841759 (1998-11-01), Russ et al.
patent: 6026073 (2000-02-01), Brown et al.
IEEE Military Communications Conference, vol. 1, Oct. 15, 1989, Boston US, pp. 210-213, XP000130735 Corson et al: "A distributed routing algorithm for mobile radio networks" see p. 211, left-hand column, paragraph 1-paragraph 4.
Patent Abstracts of Japan vol. 17, No. 546 (P-1623), Sep. 30, 1993 & JP, A,05 151292 (Fujitsu), Jun. 18, 1993, see abstract.
Chng Raymond Soo Khiaw
Johnson David
British Telecommunications public limited company
Hsu Alpus H.
Qureshi Afsar M.
LandOfFree
Route finding in communications networks does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Route finding in communications networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Route finding in communications networks will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2072200