US5404451A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for identifying candidate link, determining underutilized link, evaluating addition of candidate link and removing of underutilized link to reduce network cost
Assignee: Individual
•
Filing: 1993-03-29
•
Granted: 1995-04-04
•
Expires: 2013-03-29
Abstract
Abstract A method for selecting the most cost-efficient configuration for backbone links in a distributed data network is disclosed. The method identifies candidate links between pairs of backbone nodes, evaluates the effect on the network of adding each candidate link to the network, and adds to the network those candidate links which produce a cost savings in the network. The method also routes data through the backbone to minimize transmission delays, and eliminates redundant lines from underutilized links, and removes from the network those links whose removal reduces the cost of the backbone.
Inventors
- 👤 Paul Nemirovsky
- 👤 Michael Ball
- 👤 Michael Post
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 12:32
CPC Classifications
H; H04; H04L; H04L41/00; H04L41/08; H04L41/0803; H04L41/0823; H04L41/083; H04L41/0826
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
176 words
A computer implemented method for constructing a data communication network having a number of terminals comprising: i) backbone nodes for routing data traffic within a backbone; and ii) a plurality of first links connecting the backbone nodes; said method comprising steps of: (a) finding a shortest path between pairs of said backbone nodes; (b) identifying a candidate link between each pair of backbone nodes for which a length of said candidate link is shorter than the shortest path between the pair of backbone nodes; (c) evaluating an effect on the network of adding each candidate link to the network and adding those candidate links which reduce a cost of the network; (d) determining routing paths along said first links which produce a minimum delay for traffic between said backbone nodes and reducing a capacity of first links that are underutilized; and (e) evaluating an effect of removal of a first link on the network and removing the first link if the effect of removal of the first link is to reduce the cost of the network.
Claim 2
Dependent Claim
176 words
A computer implemented method for constructing a data communication network having a number of terminals comprising: i) backbone nodes for routing data traffic within a backbone; and ii) a plurality of first links connecting the backbone nodes; said method comprising steps of: (a) finding a shortest path between pairs of said backbone nodes; (b) identifying a candidate link between each pair of backbone nodes for which a length of said candidate link is shorter than the shortest path between the pair of backbone nodes; (c) evaluating an effect on the network of adding each candidate link to the network and adding those candidate links which reduce a cost of the network; (d) determining routing paths along said first links which produce a minimum delay for traffic between said backbone nodes and reducing a capacity of first links that are underutilized; and (e) evaluating an effect of removal of a first link on the network and removing the first link if the effect of removal of the first link is to reduce the cost of the network.
Claim 3
Dependent Claim
31 words
The method for constructing a data communication network according to claim 1 further comprising repeating steps (a) through (e) and selecting a lowest cost system to transmit data between said terminals.
Claim 4
Dependent Claim
19 words
The method according to claim 1 for constructing a data communication network wherein said backbone nodes include data switches.
Claim 5
Dependent Claim
21 words
The method for constructing a data communication network according to claim 1 wherein said first links are high volume data lines.
Claim 6
Dependent Claim
22 words
The method for constructing a data communication network according to claim 4 wherein said high volume data lines are fiber optic lines.
Claim 7
Dependent Claim
76 words
The method for constructing a data communication network according to claim 1 wherein said step of evaluating and adding candidate links to the network comprises identifying a best candidate link to add to the network, adding the best candidate link to the network, calculating the cost of the network with the added best candidate link, and repeating the step until a savings produced by the addition of the best candidate link is below a specified threshold.
Claim 8
Dependent Claim
184 words
A computer system for constructing a data communication network having a number of terminals comprising: i) backbone nodes for routing dam traffic within the backbone; and ii) a plurality of first links connecting the backbone nodes; said computer system including: (a) means for finding a shortest path between pairs of said backbone nodes; (b) means for identifying a candidate link between each pair of backbone nodes for which a length of said candidate link is shorter than the shortest path between the pair of backbone nodes; (c) means for evaluating the effect on the network of adding each candidate link to the network and adding those candidate links which reduce a cost of the network; (d) means for determining routing paths along said first links which produce a minimum delay for traffic between said backbone nodes and reducing a capacity of first links that are underutilized; and (e) means for evaluating an effect of removal of a first link on the network and removing the first link if the effect of removal of the first link is to reduce the cost of the network.
Claim 9
Dependent Claim
184 words
A computer system for constructing a data communication network having a number of terminals comprising: i) backbone nodes for routing dam traffic within the backbone; and ii) a plurality of first links connecting the backbone nodes; said computer system including: (a) means for finding a shortest path between pairs of said backbone nodes; (b) means for identifying a candidate link between each pair of backbone nodes for which a length of said candidate link is shorter than the shortest path between the pair of backbone nodes; (c) means for evaluating the effect on the network of adding each candidate link to the network and adding those candidate links which reduce a cost of the network; (d) means for determining routing paths along said first links which produce a minimum delay for traffic between said backbone nodes and reducing a capacity of first links that are underutilized; and (e) means for evaluating an effect of removal of a first link on the network and removing the first link if the effect of removal of the first link is to reduce the cost of the network.
Claim 10
Dependent Claim
19 words
The computer system for constructing a data communication network to claim 7 wherein said backbone nodes include data switches.
Claim 11
Dependent Claim
22 words
The computer system for constructing a data communication network according to claim 7 wherein said first links are high volume data lines.
Claim 12
Dependent Claim
23 words
The computer system for constructing a data communication network according to claim 9 wherein said high volume data lines are fiber optic lines.
References Cited (Backward Citations)
US3579191A
Cited
US3626375A
Cited
US4771424A
Cited
US5029075A
Cited
US4905233A
Cited
US5115495A
Cited
US5163042A
Cited
US5095444A
Cited
US5218676A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-04-03 | 1998-10-03 | 1999-04-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-04-03 | 2002-10-03 | 2003-04-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-04-03 | 2006-10-03 | 2007-04-04 | $7700.00 | Window Closed / Lapsed |