Patent US5079760A successfully refreshed from Google Patents.
US5079760A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for efficient distributed data communications network access network configuration
Assignee: Individual
•
Filing: 1990-02-06
•
Granted: 1992-01-07
•
Expires: 2010-02-06
Abstract
Abstract A method for locating and selecting concentrators and local access links in a distributed data network in the most cost-efficient way is disclosed. The method first identifies a median concentrator from among a set of candidate concentrators to which all of the data terminals are initially assigned. The method then iteratively evaluates and adds to the network those concentrators which produce savings in the network's cost. The method first adds all of a set of concentrators specified to be mandatory and then adds from among a set of candidate concentrators those which produce cost savings. The method then evaluates concentrators in the network and removes those concentrators whose removal produces savings in the network cost.
Inventors
- 👤 Paul Nemirovsky
- 👤 Michael Ball
- 👤 Roy Dahl
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 09:11
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/0016; H04Q3/0062; H04Q3/0083; H04L; H04L41/00; H04L41/08; H04L41/0803; H04L41/0823; H04L41/0826; H04L41/16; H04Q2213/00; H04Q2213/13524; H04Q2213/13535; H04Q2213/13543
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
258 words
A method for constructing a data communication network having a number of terminals comprising: i. backbone nodes for routing data traffic within the backbone; ii. concentrators connected between said terminals and said backbone nodes; and iii. a plurality of links for connecting said terminals with said concentrators; said method comprising the steps of: a. identifying a site for a median concentrator from among a plurality of candidate concentrator sites, said candidate concentrator sites comprising a mandatory concentrator site and an optional concentrator site, which median concentrator is located at that candidate concentrator site to which all of said terminals can be connected by said links at the lowest cost and adding said concentrator to the network; b. adding a mandatory concentrator to the network, said mandatory concentrator being a concentrator located at said mandatory concentrator site, and assigning said terminals to said mandatory concentrator so as to minimize the cost of the network; c. evaluating the effect on the network of adding an optional concentrator at each of said optional concentrator sites to the network, adding that optional concentrator that most reduces the cost of the network, and reassigning terminals to said added optional concentrator so as to minimize the cost of the network; and d. evaluating the effect on the network of removing optional concentrators from the network, removing that optional concentrator whose removal reduces the cost of the network, and reassigning those terminals previously assigned to the that optional concentrator removed from the network to remaining concentrators so as to minimize the cost of the network.
Claim 2
Independent Claim
258 words
A method for constructing a data communication network having a number of terminals comprising: i. backbone nodes for routing data traffic within the backbone; ii. concentrators connected between said terminals and said backbone nodes; and iii. a plurality of links for connecting said terminals with said concentrators; said method comprising the steps of: a. identifying a site for a median concentrator from among a plurality of candidate concentrator sites, said candidate concentrator sites comprising a mandatory concentrator site and an optional concentrator site, which median concentrator is located at that candidate concentrator site to which all of said terminals can be connected by said links at the lowest cost and adding said concentrator to the network; b. adding a mandatory concentrator to the network, said mandatory concentrator being a concentrator located at said mandatory concentrator site, and assigning said terminals to said mandatory concentrator so as to minimize the cost of the network; c. evaluating the effect on the network of adding an optional concentrator at each of said optional concentrator sites to the network, adding that optional concentrator that most reduces the cost of the network, and reassigning terminals to said added optional concentrator so as to minimize the cost of the network; and d. evaluating the effect on the network of removing optional concentrators from the network, removing that optional concentrator whose removal reduces the cost of the network, and reassigning those terminals previously assigned to the that optional concentrator removed from the network to remaining concentrators so as to minimize the cost of the network.
Claim 3
Dependent Claim
39 words
The method for constructing a data communication network according to claim 1 further comprising iteratively repeating step (c) and adding each optional concentrator for which the addition the said optional concentrator produces savings in the cost of the network.
Claim 4
Dependent Claim
22 words
The method according to claim 1 for constructing a data communication network wherein said concentrators are statistical multiplexers with protocol conversion capabilities.
Claim 5
Dependent Claim
19 words
The method according to claim 1 for constructing a data communication network wherein said backbone nodes include data switches.
Claim 6
Dependent Claim
265 words
A computer system for constructing a data communication network having a number of terminals comprising: i. backbone nodes for routing data traffic within the backbone; ii. concentrators connected between said terminals and said backbone nodes; and iii. a plurality of links for connecting said terminals with said concentrators; said computer system having: a. means for identifying a site for a median concentrator from among a plurality of candidate concentrator sites, said candidate concentrator sites comprising a mandatory concentrator site and an optional concentrator site, which median concentrator is located at that candidate concentrator site to which all of said terminals can be connected by said links at the lowest cost and adding said concentrator to the network; b. means for adding a mandatory concentrator to the network, said mandatory concentrator being a concentrator located at said mandatory concentrator site, and assigning said terminals to said mandatory concentrator so as to minimize the cost of the network; c. means for evaluating the effect on the network of adding an optional concentrator at each of said optional concentrator sites to the network, adding that optional concentrator that most reduces the cost of the network, and reassigning terminals to said added optional concentrator so as to minimize the cost of the network; and d. means for evaluating the effect on the network of removing optional concentrators from the network, removing that optional concentrator whose removal reduces the cost of the network, and reassigning those terminals previously assigned to the that optional concentrator removed from the network to remaining concentrators so as to minimize the cost of the network.
Claim 7
Dependent Claim
265 words
A computer system for constructing a data communication network having a number of terminals comprising: i. backbone nodes for routing data traffic within the backbone; ii. concentrators connected between said terminals and said backbone nodes; and iii. a plurality of links for connecting said terminals with said concentrators; said computer system having: a. means for identifying a site for a median concentrator from among a plurality of candidate concentrator sites, said candidate concentrator sites comprising a mandatory concentrator site and an optional concentrator site, which median concentrator is located at that candidate concentrator site to which all of said terminals can be connected by said links at the lowest cost and adding said concentrator to the network; b. means for adding a mandatory concentrator to the network, said mandatory concentrator being a concentrator located at said mandatory concentrator site, and assigning said terminals to said mandatory concentrator so as to minimize the cost of the network; c. means for evaluating the effect on the network of adding an optional concentrator at each of said optional concentrator sites to the network, adding that optional concentrator that most reduces the cost of the network, and reassigning terminals to said added optional concentrator so as to minimize the cost of the network; and d. means for evaluating the effect on the network of removing optional concentrators from the network, removing that optional concentrator whose removal reduces the cost of the network, and reassigning those terminals previously assigned to the that optional concentrator removed from the network to remaining concentrators so as to minimize the cost of the network.
Claim 8
Dependent Claim
23 words
The computer system for constructing a data communication network according to claim 5 wherein said concentrators are statistical multiplexors with protocol conversion capabilities.
Claim 9
Dependent Claim
20 words
The computer system for constructing a data communication network according to claim 5 wherein said backbone nodes include data switches.
Claim 10
Dependent Claim
39 words
The method for constructing a data communication network according to claim 1 further comprising iteratively repeating step (d) and removing each optional concentrator for which the removal of said optional concentrator produces savings in the cost of the network.
References Cited (Backward Citations)
US4974224A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-01-06 | 1995-07-08 | 1996-01-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-01-06 | 1999-07-08 | 2000-01-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-01-06 | 2003-07-08 | 2004-01-07 | $7700.00 | Window Closed / Lapsed |