Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
91 words
A method of recovering a failed communication link between first and second terminus nodes in a telecommunication network which comprises: a) identifying one or more multi-link network paths extending between said first and second terminus nodes wherein each of said links affords spare bandwidth equal to all or a portion of the communication bandwidth lost in said failure; b) selecting the one of said network paths that affords the largest minimum bandwidth link; and c) establishing said one network path as the communication line between said first and second terminus nodes.
Claim 2
Independent Claim
91 words
A method of recovering a failed communication link between first and second terminus nodes in a telecommunication network which comprises: a) identifying one or more multi-link network paths extending between said first and second terminus nodes wherein each of said links affords spare bandwidth equal to all or a portion of the communication bandwidth lost in said failure; b) selecting the one of said network paths that affords the largest minimum bandwidth link; and c) establishing said one network path as the communication line between said first and second terminus nodes.
Claim 3
Dependent Claim
136 words
A method according to claim 1 wherein said identifying of a multi-link path comprises: a) transmitting from the first of said terminus nodes to a recipient node connected thereto by a link affording spare bandwidth a message specifying a bandwidth which is the lesser of the bandwidth required to recover said failure and the maximum spare bandwidth afforded on said link; b) transmitting from a recipient node to a subsequent node connected thereto by a link affording spare bandwidth a revision of said message specifying a bandwidth which is the lesser of the bandwidth specified in the message received by the recipient node and the maximum spare bandwidth afforded on said link; and c) repeating step b) up to a predetermined maximum number of times at each recipient node except the second of said terminus nodes.
Claim 4
Dependent Claim
137 words
A method according to claim 1 wherein said identifying of multi-link paths comprises: a) broadcasting from the first of said terminus nodes to each recipient node connected thereto by a link affording spare bandwidth a message specifying a bandwidth which is the lesser of the bandwidth required to recover said failure and the maximum spare bandwidth afforded on said link; b) broadcasting from each recipient node to each subsequent node connected thereto by a link affording spare bandwidth a revision of the received message specifying a bandwidth which is the lesser of the bandwidth specified in the message received by the respective recipient node and the maximum spare bandwidth afforded on said link; and c) repeating step b) up to a predetermined maximum number of times at each recipient node except the second of said terminus nodes.
Claim 5
Dependent Claim
89 words
A method according to claim 3 wherein said selecting of one network path comprises: a) selecting at the second of said terminus nodes the adjacent node from which was received the message specifying the maximum bandwidth; b) selecting at said adjacent node the next adjacent node from which was received the message specifying the maximum bandwidth; c) repeating step b) at each said next adjacent node except the first of said terminus nodes; and d) selecting as said one network path the links extending respectively between said adjacent nodes.
Claim 6
Dependent Claim
27 words
A method according to claim 4 wherein said establishing of one network path as the communication line comprises cross-connecting said selected path links at said adjacent nodes.
Claim 7
Independent Claim
317 words
A method of recovering a failed communication link between first and second terminus nodes in a telecommunication network which comprises: a) broadcasting from the first of said terminus nodes to each recipient node connected thereto by a link affording spare bandwidth a message comprising the identity of the first broadcasting node and the specification of a bandwidth which is the lesser of the bandwidth required to recover said failure and the maximum spare bandwidth afforded on said link; b) recording at each recipient node the bandwidth specified in each respective message received at said recipient node and the identity of the node from which said message was received; c) broadcasting from each recipient node to each subsequent node connected thereto by a link affording spare bandwidth a revision of the received message comprising the identity of the then broadcasting node and the specification of a bandwidth which is the lesser of the maximum bandwidth then on record at the respective recipient node and the maximum spare bandwidth afforded on said link; d) repeating up to a predetermined maximum number of times step b) and, except at the second of said terminus nodes, step c); e) after a predetermined period of time following said failure, identifying from the data recorded at the second of said terminus nodes the adjacent node from which was received the message specifying the maximum bandwidth; f) transmitting from said second terminus node to the identified adjacent node a message acknowledging said maximum bandwidth; g) identifying from the data recorded at the adjacent node the next adjacent node from which was received the message specifying the maximum bandwidth; h) transmitting from the adjacent node to the identified next adjacent node a message comprising the initial bandwidth acknowledgement; i) repeating steps g) and h), except at the first of said terminus nodes; and j) cross-connecting the respective acknowledged bandwidth links at the identified nodes therebetween.
Claim 8
Independent Claim
317 words
A method of recovering a failed communication link between first and second terminus nodes in a telecommunication network which comprises: a) broadcasting from the first of said terminus nodes to each recipient node connected thereto by a link affording spare bandwidth a message comprising the identity of the first broadcasting node and the specification of a bandwidth which is the lesser of the bandwidth required to recover said failure and the maximum spare bandwidth afforded on said link; b) recording at each recipient node the bandwidth specified in each respective message received at said recipient node and the identity of the node from which said message was received; c) broadcasting from each recipient node to each subsequent node connected thereto by a link affording spare bandwidth a revision of the received message comprising the identity of the then broadcasting node and the specification of a bandwidth which is the lesser of the maximum bandwidth then on record at the respective recipient node and the maximum spare bandwidth afforded on said link; d) repeating up to a predetermined maximum number of times step b) and, except at the second of said terminus nodes, step c); e) after a predetermined period of time following said failure, identifying from the data recorded at the second of said terminus nodes the adjacent node from which was received the message specifying the maximum bandwidth; f) transmitting from said second terminus node to the identified adjacent node a message acknowledging said maximum bandwidth; g) identifying from the data recorded at the adjacent node the next adjacent node from which was received the message specifying the maximum bandwidth; h) transmitting from the adjacent node to the identified next adjacent node a message comprising the initial bandwidth acknowledgement; i) repeating steps g) and h), except at the first of said terminus nodes; and j) cross-connecting the respective acknowledged bandwidth links at the identified nodes therebetween.
Claim 9
Dependent Claim
30 words
A method according to claim 6 which further comprises deleting said recorded data and repeating the recited steps until all bandwidth lost in said failed communication link has been recovered.
Claim 10
Dependent Claim
56 words
A method according to claim 6 which further comprises: a) including in each broadcast message the specification of the number of internodal broadcast hops said message then represents; and b) retaining on record at any node only the one message which, as between two messages specifying the same bandwidth, specifies the lesser number of said hops.
Claim 11
Independent Claim
215 words
A method of recovering a failed communication link between first and second terminus nodes in a telecommunication network wherein the first of said terminus nodes broadcasts on links to neighboring nodes a path restoration request message which is further broadcast by subsequent neighboring nodes, the second of said terminus nodes receives various of said broadcast messages from neighboring nodes and returns messages to said first terminus node on path links utilized for said broadcast messages, and network recovery paths are established on said return message paths characterized in that a) the initial broadcast messages identify the then broadcasting node and specify a bandwidth which is the lesser of the bandwidth required to recover said failure and the maximum spare bandwidth afforded on the broadcast link; b) each further broadcast message identifies the then broadcasting node and specifies a bandwidth which is the lesser of the bandwidth specified in the message received by said broadcasting node and the maximum spare bandwidth afforded on the broadcast link; c) said second terminus node returns a message to said first terminus node only on the path whose initial link is to the second terminus neighboring node whose request message specified the maximum bandwidth; and d) a network recovery path is thereby established which affords the largest minimum bandwidth link.
Claim 12
Independent Claim
215 words
A method of recovering a failed communication link between first and second terminus nodes in a telecommunication network wherein the first of said terminus nodes broadcasts on links to neighboring nodes a path restoration request message which is further broadcast by subsequent neighboring nodes, the second of said terminus nodes receives various of said broadcast messages from neighboring nodes and returns messages to said first terminus node on path links utilized for said broadcast messages, and network recovery paths are established on said return message paths characterized in that a) the initial broadcast messages identify the then broadcasting node and specify a bandwidth which is the lesser of the bandwidth required to recover said failure and the maximum spare bandwidth afforded on the broadcast link; b) each further broadcast message identifies the then broadcasting node and specifies a bandwidth which is the lesser of the bandwidth specified in the message received by said broadcasting node and the maximum spare bandwidth afforded on the broadcast link; c) said second terminus node returns a message to said first terminus node only on the path whose initial link is to the second terminus neighboring node whose request message specified the maximum bandwidth; and d) a network recovery path is thereby established which affords the largest minimum bandwidth link.
Claim 13
Dependent Claim
31 words
A method according to claim 9 characterized in that the steps of establishing a network recovery path are repeated until all bandwidth lost in said failed communication link has been recovered.
Claim 14
Dependent Claim
65 words
A method according to claim 9 characterized in that a) each broadcast message includes the specification of the number of internodal broadcast hops said message then represents; and b) said return message path is further limited to subsequent links to neighboring nodes whose request message specified the maximum bandwidth and, as between two messages specifying the same bandwidth, specified the lesser number of said hops.