Telecommunications network distributed restoration method and system
AssigneeAlcatel
InventorsPaul T. Baniewicz, Ashley W. Brimmage, Sridhar Alagar, S. Hal Badt, Sr., Frederick R. Ellefson, Bryan J. McGlade
Life of this patent
Estimating the term…
Abstract
A network wherein a plurality of links connects a plurality of nodes such as cross-connects in a communication circuit network with paths interconnecting the nodes, and with there being spare capacity between a sufficient number of nodes to accommodate at least some rerouting of traffic immediately upon detection of a break in a traffic span in the network so as to restore circuit continuity within a predetermined maximum time using an improved failure detection, isolation, and recovery
Claims23
A method for identifying a pair of neighboring nodes in a telecommunications network having at least one distributed restoration subnetwork, comprising:
- identifying a level of quality associated with each of a plurality of spare links;
- selecting one of the spare links based upon the level of quality associated with each of the plurality of spare links;
- constructing a first C-bit keep alive message for a first node in a neighboring node pair connected by the selected spare link;
- embedding the first C-bit keep alive message within the C-bit of a first DS-3 signal;
- and
- transmitting the first DS-3 signal from the first node to a second node in the neighboring node pair over the selected spare link, wherein the first C-bit keep alive message identifies the first node to the second node.
A telecommunications network comprising a plurality of nodes interconnected by a plurality of links, and a distributed restoration subnetwork, comprising:
- a first node having a first unique identifier;
- a second node having a second unique identifier;
- a first spare link connecting the first node to the second node, wherein the first spare link is selected from a plurality of spare links based upon a level of quality associated with each of the plurality of spare links;
- and
- a DS-3 signaling channel within the first spare link, wherein the first node and second node are operable to send a DS-3 signal having a keep alive message embedded within a C-bit to one another.
A method for identifying a pair of neighboring nodes in a telecommunications network:having at least one distributed restoration subnetwork, comprising:
- identifying a level of quality associated with each of a plurality of spare links;
- selecting one of the spare links based upon the level of quality associated with each of the plurality of spare links;
- constructing a first keep alive message for a first node in a neighboring node pair connected by the selected spare link;
- embedding the first keep alive message within a C-bit of a first DS-3 signal;
- and
- transmitting the first DS-3 signal from the first node to a second node in the neighboring node pair over the selected spare link, wherein the first keep alive message identifies the first node to the second node.
Dependencies are inferred from the claim text.