US5883881A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for selecting preferred nodes for distributed network restoration
Assignee: Verizon Patent and Licensing Inc
•
Filing: 1996-12-30
•
Granted: 1999-03-16
•
Expires: 2016-12-30
Abstract
Abstract A system for identifying preferred source nodes and preferred target nodes for nodes of a trunk within a telecommunications network. Each node is connected to an output link of the trunk. A preferred source node for a node is a source node of a restoral route to bypass the output link. A preferred target node for a node is a target node for a restoral route when that node is the source node of the restoral route. The system comprises a read restoration node topology component, a build restoral route table component, a build preferred node table component, and a download component. The read restoration node topology component that reads information describing the topology of the telecommunications network. The build restoral route table component builds a table of restoral routes for a trunk of the telecommunications network. The restoral routes are identified from the information describing the topology of the network. The build preferred node table component builds a preferred source node list and a preferred target node list for each node on the trunk based on the restoral route table. The download component downloads the preferred source node lists and the preferred target node list to the nodes of the trunk.
Inventors
- 👤 William D. Croslin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 21:43
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/28; H04L41/00; H04L41/06; H04L41/0677; H04L45/02; H04L41/0654
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
193 words
A method in a computer system for identifying a preferred source node and a preferred target node of a node, the node having an output link, the preferred source node being a source node of a restoral route to bypass the output link of the node, the preferred target node being a target node of a restoral route when the node is a source node of a restoral route to bypass the output link of the node, the method comprising: identifying restoral routes to bypass the output link of the node, each restoral route having a source node and a target node; assigning a cost to each identified restoral route; selecting as the preferred source node the source node of the identified restoral route with the assigned cost that is lowest; selecting as the preferred target node the target node of the identified restoral route with the assigned cost that is lowest and that has the node as its source node; and downloading an indication of the selected source node and the selected target node to the node for use as the preferred source node and the preferred target node for the node.
Claim 2
Independent Claim
193 words
A method in a computer system for identifying a preferred source node and a preferred target node of a node, the node having an output link, the preferred source node being a source node of a restoral route to bypass the output link of the node, the preferred target node being a target node of a restoral route when the node is a source node of a restoral route to bypass the output link of the node, the method comprising: identifying restoral routes to bypass the output link of the node, each restoral route having a source node and a target node; assigning a cost to each identified restoral route; selecting as the preferred source node the source node of the identified restoral route with the assigned cost that is lowest; selecting as the preferred target node the target node of the identified restoral route with the assigned cost that is lowest and that has the node as its source node; and downloading an indication of the selected source node and the selected target node to the node for use as the preferred source node and the preferred target node for the node.
Claim 3
Dependent Claim
40 words
The method of claim 1 wherein the selecting as the preferred source node includes generating a list of the source nodes of the identified restoral routes, wherein the list is ordered by the assigned cost of the identified restoral route.
Claim 4
Dependent Claim
48 words
The method of claim 1 wherein the selecting as the preferred target node includes generating a list of the target nodes of the identified restoral routes that have the node as their source node, wherein the list is ordered by the assigned cost of the identified restoral route.
Claim 5
Dependent Claim
21 words
The method of claim 1 wherein the identifying and selecting are performed for each node in a trunk of a network.
Claim 6
Dependent Claim
46 words
The method of claim 1 wherein the identifying includes generating restoral routes for each pair of nodes in a trunk of a network, the generated restoral routes for a pair of nodes having the nodes of the pair as the end nodes of the restoral route.
Claim 7
Dependent Claim
57 words
The method of claim 5 wherein the identified restoral routes to bypass the output link of the node includes those generated restoral routes that do not include the output link and with a source node that is not after the node in the trunk and with a target node that is after the node in the trunk.
Claim 8
Independent Claim
90 words
A method in a computer system for generating a preferred source node list for a node in a network, the node having an output link, the preferred source node list identifying source nodes of restoral routes to bypass the output link, the method comprising: identifying restoral routes that bypass the output link of the node, each restoral route having a source node; adding to the preferred source node list for the node each source node of an identified restoral route; and downloading the preferred source node list to the node.
Claim 9
Independent Claim
90 words
A method in a computer system for generating a preferred source node list for a node in a network, the node having an output link, the preferred source node list identifying source nodes of restoral routes to bypass the output link, the method comprising: identifying restoral routes that bypass the output link of the node, each restoral route having a source node; adding to the preferred source node list for the node each source node of an identified restoral route; and downloading the preferred source node list to the node.
Claim 10
Dependent Claim
34 words
The method of claim 7, including assigning a cost to each identified restoral route and ordering the preferred source node list based on the assigned costs for the restoral routes of the source nodes.
Claim 11
Dependent Claim
26 words
The method of claim 7 wherein the network has a trunk and wherein a preferred source node list is identified for each node of the trunk.
Claim 12
Dependent Claim
21 words
The method of claim 7 wherein each identified restoral route does not include any backhaul on a trunk of the network.
Claim 13
Dependent Claim
46 words
The method of claim 7 wherein the identifying includes generating restoral routes for each pair of nodes in a trunk of the network, the generated restoral routes for a pair of nodes having the nodes of the pair as the end nodes of the restoral route.
Claim 14
Dependent Claim
57 words
The method of claim 11 wherein the identified restoral routes to bypass the output link of the node include those generated restoral routes that do not include the output link and with a source node that is not after the node in the trunk and with a target node that is after the node in the trunk.
Claim 15
Independent Claim
104 words
A method in a computer system for generating a preferred target node list for a node in a network, the node having an output link, the preferred target node list identifying target nodes of restoral routes that start at the node and bypass the output link, the method comprising: identifying restoral routes that bypass the output link of the node and that has the node as its source node, each restoral route having a target node; adding to the preferred target node list for the node each target node of an identified restoral route; and downloading the preferred target node list to the node.
Claim 16
Independent Claim
104 words
A method in a computer system for generating a preferred target node list for a node in a network, the node having an output link, the preferred target node list identifying target nodes of restoral routes that start at the node and bypass the output link, the method comprising: identifying restoral routes that bypass the output link of the node and that has the node as its source node, each restoral route having a target node; adding to the preferred target node list for the node each target node of an identified restoral route; and downloading the preferred target node list to the node.
Claim 17
Dependent Claim
34 words
The method of claim 13, including assigning a cost to each identified restoral route and ordering the preferred target node list based on the assigned costs for the restoral routes of the target nodes.
Claim 18
Dependent Claim
26 words
The method of claim 13 wherein the network has a trunk and wherein a preferred target node list is identified for each node of the trunk.
Claim 19
Dependent Claim
19 words
The method of claim 15 wherein each identified restoral route does not include any backhaul on the original route.
Claim 20
Dependent Claim
46 words
The method of claim 13 wherein the identifying includes generating restoral routes for each pair of nodes in a trunk of the network, the generated restoral routes for a pair of nodes having the nodes of the pair as the end nodes of the restoral route.
Claim 21
Dependent Claim
57 words
The method of claim 17 wherein the identified restoral routes to bypass the output link of the node include those generated restoral routes that do not include the output link and with a source node that is not after the node in the trunk and with a target node that is after the node in the trunk.
Claim 22
Dependent Claim
183 words
A computer system for identifying preferred source nodes and preferred target nodes for nodes of a trunk within a telecommunications network, each node being connected to an output link of the trunk, a preferred source node for a node being a source node of a restoral route to bypass the output link, a preferred target node for a node being a target node for a restoral route when the node is the source node of the restoral route, comprising: a read restoration node topology component that reads information describing the topology of the telecommunications network; a build restoral route table component that builds a table of restoral routes for a trunk of the telecommunications network, the restoral routes being identified from the information describing the topology of the network; a build preferred node table component that builds a preferred source node list and a preferred target node list for each node of the trunk based on the restoral route table; and a download component that downloads the preferred source node lists and the preferred target node lists to the nodes of the trunk.
Claim 23
Dependent Claim
183 words
A computer system for identifying preferred source nodes and preferred target nodes for nodes of a trunk within a telecommunications network, each node being connected to an output link of the trunk, a preferred source node for a node being a source node of a restoral route to bypass the output link, a preferred target node for a node being a target node for a restoral route when the node is the source node of the restoral route, comprising: a read restoration node topology component that reads information describing the topology of the telecommunications network; a build restoral route table component that builds a table of restoral routes for a trunk of the telecommunications network, the restoral routes being identified from the information describing the topology of the network; a build preferred node table component that builds a preferred source node list and a preferred target node list for each node of the trunk based on the restoral route table; and a download component that downloads the preferred source node lists and the preferred target node lists to the nodes of the trunk.
Claim 24
Dependent Claim
35 words
The computer system of claim 19 wherein the build preferred node table component ranks the nodes in the preferred source node list and the preferred target node list according to cost of the restoral routes.
References Cited (Backward Citations)
US4577066A
Cited
US4920529A
Cited
US5058105A
Cited
EP0494513A2
Cited
US5187740A
Cited
US5706276A
Cited
US5335268A
Cited
WO1995010149A2
Cited
US5459716A
Cited
US5463615A
Cited
US5636203A
Cited
US5646936A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-03-15 | 2002-09-14 | 2003-03-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-15 | 2006-09-14 | 2007-03-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-15 | 2010-09-14 | 2011-03-16 | $7700.00 | Window Closed / Lapsed |