Method for efficient distributed data communications network access network configuration

• US 5,079,760 A
• Filed: 02/06/1990
• Issued: 01/07/1992
• Est. Priority Date: 02/06/1990
• Status: Expired due to Term

• Current Assignee: Michael Ball, Paul Nemirovsky, Roy Dahl
• Original Assignee: Michael Ball, Paul Nemirovsky, Roy Dahl
• Inventors: Ball, Michael, Dahl, Roy, Nemirovsky, Paul
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Marcelo, Melvin
• Application Number:
  US07/475,886
• Time in Patent Office: 700 Days
• Field of Search: 370/13, 370/17, 370/56, 370/58.1, 370/60, 370/60.1, 370/94.1, 370/94.3
• US Class Current: 370/238
• CPC Class Codes: H04L 41/0803 Configuration setting
• CPC Class Codes: H04L 41/0826 for reduction of network costs H04L41/0833 takes precedence
• CPC Class Codes: H04L 41/16 using machine learning or artificial intelligence
• CPC Class Codes: H04Q 2213/13524 cost management least cost H04Q2213/13138
• CPC Class Codes: H04Q 2213/13535 distributed systems - also domains in service creation
• CPC Class Codes: H04Q 2213/13543 network planning, configuration management, e.g. for growth
• CPC Class Codes: H04Q 3/0083 Network planning or design; Modelling of planned or existing networks

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.

Claims

1. 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.

2. 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.

3. The method according to claim 1 for constructing a data communication network wherein said concentrators are statistical multiplexers with protocol conversion capabilities.

4. The method according to claim 1 for constructing a data communication network wherein said backbone nodes include data switches.

8. 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.

5. 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.

6. The computer system for constructing a data communication network according to claim 5 wherein said concentrators are statistical multiplexors with protocol conversion capabilities.

7. The computer system for constructing a data communication network according to claim 5 wherein said backbone nodes include data switches.