US5216591A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for efficient distributed data communications network backbone node location
Assignee: Sprint International Communications Corp
•
Filing: 1990-02-06
•
Granted: 1993-06-01
•
Expires: 2010-02-06
Abstract
Abstract A method for selecting the most cost-efficient locations for backbone nodes in a distributed data network is disclosed. The method iteratively evaluates candidate backbone node locations, adding in each iteration the candidate whose addition to the network would create the greatest savings in total network cost. After all candidates which produce savings are added to the network, the method iteratively evaluates the backbone node locations and removes those whose removal would create cost savings. Data terminals are reassigned among the backbone nodes in the least cost manner. The method also estimates total network cost based on the resulting network configuration.
Inventors
- 👤 Paul Nemirovsky
- 👤 Michael Ball
- 👤 Roy Dahl
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 15:00
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/64; H04Q3/66; G; G06; G06Q; G06Q10/00; G06Q10/06; G06Q10/063; G06Q10/0631; G06Q10/06316; H04L; H04L41/00; H04L41/12; H04L41/16; H04Q3/0016; H04Q3/0062; H04Q3/0083; H04Q2213/00; H04Q2213/13524; H04Q2213/13535; H04Q2213/13543; Y; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/903; Y10S706/909
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
172 words
A method for constructing a data communication network having; i) a local access network including a plurality of terminals; and ii) a backbone including backbone nodes for routing data traffic within the backbone and a plurality of first links connecting the backbone nodes, said method comprising steps of: (a) selecting mandatory backbone nodes related to various ones of said plurality of terminals; (b) selecting a new candidate backbone node for addition to the backbone; (c) evaluating the effect on the network of adding the new candidate backbone node to the backbone; (d) if the evaluation of step (c) indicates that effect on the network is positive, adding the new candidate backbone node to the backbone; (e) evaluating the effect of removing a backbone node from the backbone; (f) if evaluation of step (e) indicates that the effect on the network is positive, removing the backbone node from the backbone; and (g) reassigning terminals to backbone nodes included in the backbone to provide the lowest cost system to transmit data between said terminals.
Claim 2
Independent Claim
172 words
A method for constructing a data communication network having; i) a local access network including a plurality of terminals; and ii) a backbone including backbone nodes for routing data traffic within the backbone and a plurality of first links connecting the backbone nodes, said method comprising steps of: (a) selecting mandatory backbone nodes related to various ones of said plurality of terminals; (b) selecting a new candidate backbone node for addition to the backbone; (c) evaluating the effect on the network of adding the new candidate backbone node to the backbone; (d) if the evaluation of step (c) indicates that effect on the network is positive, adding the new candidate backbone node to the backbone; (e) evaluating the effect of removing a backbone node from the backbone; (f) if evaluation of step (e) indicates that the effect on the network is positive, removing the backbone node from the backbone; and (g) reassigning terminals to backbone nodes included in the backbone to provide the lowest cost system to transmit data between said terminals.
Claim 3
Dependent Claim
32 words
The method for constructing a data communication network according to claim 1 further comprising repeating the steps (a) through (g) and selecting the lowest cost system to transmit data between said terminals.
Claim 4
Dependent Claim
19 words
The method for constructing a data communication network according to claim 1 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
72 words
The method for constructing a data communication network according to claim 1 wherein said step of selecting a new candidate node includes substeps of: (i) measuring cost savings of the local access network; (ii) offsetting said measured savings by any increase in the cost of the backbone attributed to adding a new backbone node and adding a switch associated with the new backbone node; and (iii) evaluating cost savings of the network.
Claim 8
Dependent Claim
31 words
The method for constructing a data communication network according to claim 6 wherein the savings in local access network costs includes the savings associated with reassigning terminals to the candidate node.
Claim 9
Dependent Claim
180 words
A computer system for constructing a data communication network having; i) a local access network including a plurality of terminals; and ii) a backbone including backbone nodes for routing data traffic within the backbone and a plurality of first links connecting the backbone nodes, said computer system comprising: (a) means for selecting mandatory backbone nodes related to various ones of said plurality terminals; (b) means for selecting a new candidate backbone node for addition to the backbone; (c) means for evaluating the effect on the network of adding the new candidate backbone node to the backbone; (d) means for adding the new candidate backbone node if said means for evaluating determines that the effect on the network is positive; (e) second means for evaluating the effect of removing a backbone node from the backbone; (f) means for removing the backbone node if said second means for evaluating determines that the effect on the network is positive; and (g) means for reassigning terminals to backbone nodes to the backbone to provide the lowest cost system to transmit data between said terminals.
Claim 10
Dependent Claim
180 words
A computer system for constructing a data communication network having; i) a local access network including a plurality of terminals; and ii) a backbone including backbone nodes for routing data traffic within the backbone and a plurality of first links connecting the backbone nodes, said computer system comprising: (a) means for selecting mandatory backbone nodes related to various ones of said plurality terminals; (b) means for selecting a new candidate backbone node for addition to the backbone; (c) means for evaluating the effect on the network of adding the new candidate backbone node to the backbone; (d) means for adding the new candidate backbone node if said means for evaluating determines that the effect on the network is positive; (e) second means for evaluating the effect of removing a backbone node from the backbone; (f) means for removing the backbone node if said second means for evaluating determines that the effect on the network is positive; and (g) means for reassigning terminals to backbone nodes to the backbone to provide the lowest cost system to transmit data between said terminals.
Claim 11
Dependent Claim
20 words
The computer system for constructing a data communication network according to claim 8 wherein said backbone modes include data switches.
Claim 12
Dependent Claim
22 words
The computer system for constructing a data communication network according to claim 8 wherein said first links are high volume data lines.
Claim 13
Dependent Claim
23 words
The computer system for constructing a data communication network according to claim 10 wherein said high volume data lines are fiber optic lines.
References Cited (Backward Citations)
US4956835A
Cited
US5014262A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-05-31 | 1996-11-30 | 1997-06-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-05-31 | 2000-11-30 | 2001-06-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-05-31 | 2004-11-30 | 2005-06-01 | $7700.00 | Window Closed / Lapsed |