US5067127A — Congestion avidance control system and method for…

Claim 1

Independent Claim 229 words

A congestion avoidance control system for a communication network having a plurality of exchanges interconnected by a plurality of lines for deciding one of communication routes leading from outgoing one of said plurality of exchanges including an outgoing terminal to incoming one thereof including an incoming terminal, each of said exchanges comprising: every-line residual-capacity minimum-cost memory means for storing one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of tis own exchange minus a line capacity being now used thereof as a residual line capacity, minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, and a minimum cost value; retrieval means, when a calling request having a request use capacity as an application data is issued from said outgoing terminal, for retrieving said minimum cost line of one of the line residual capacity classes satisfying said request use capacity from said every-line residual-capacity minimum-cost memory means; decision means for deciding one of the communication routes on the basis of the minimum cost line retrieved by said retrieval means; and correction means for correcting the minimum cost value of said every-line residual-capacity minimum-cost memory means with use of a reciprocal of a ratio of the own residual line capacity to an intra-network line full capacity multiplied by a line fixed load value.

Claim 2

Dependent Claim 229 words

A congestion avoidance control system for a communication network having a plurality of exchanges interconnected by a plurality of lines for deciding one of communication routes leading from outgoing one of said plurality of exchanges including an outgoing terminal to incoming one thereof including an incoming terminal, each of said exchanges comprising: every-line residual-capacity minimum-cost memory means for storing one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of tis own exchange minus a line capacity being now used thereof as a residual line capacity, minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, and a minimum cost value; retrieval means, when a calling request having a request use capacity as an application data is issued from said outgoing terminal, for retrieving said minimum cost line of one of the line residual capacity classes satisfying said request use capacity from said every-line residual-capacity minimum-cost memory means; decision means for deciding one of the communication routes on the basis of the minimum cost line retrieved by said retrieval means; and correction means for correcting the minimum cost value of said every-line residual-capacity minimum-cost memory means with use of a reciprocal of a ratio of the own residual line capacity to an intra-network line full capacity multiplied by a line fixed load value.

Claim 3

Dependent Claim 63 words

A congestion avoidance control system for a communication network as set forth in claim 1, wherein said every-line residual-capacity minimum-cost memory means stores therein the minimum cost values of lines of routes leading from its own exchange to the incoming exchange and minimum cost line numbers providing said minimum cost values with respect to said line residual capacity classes and said incoming exchange.

Claim 4

Dependent Claim 41 words

A congestion avoidance control system for a communication network as set forth in claim 1, wherein said every-line residual-capacity minimum-cost memory means stores therein minimum cost lines in association with said line residual capacity classes with respect to the incoming exchange.

Claim 5

Dependent Claim 132 words

A congestion avoidance control system for a communication network as set forth in claim 1, wherein said correction means includes vector preparation means for preparing a minimum cost vector for control of line residual capacity by multiplying a reciprocal of a ratio of its own residual line capacity to said intra-network full line capacity by a line fixed load value to obtain a multiplication value and by adding said multiplication value to the minimum cost value stored in said every-line residual-capacity minimum-cost memory means, update means for updating the minimum cost value of said every-line residual-capacity minimum-cost memory means on the basis of said line residual-capacity control minimum-cost vector received from an adjacent exchange, and vector transmission means for transmitting the line residual-capacity control minimum-cost vector prepared by said vector preparation means.

Claim 6

Dependent Claim 41 words

A congestion avoidance control system for a communication network as set forth in claim 4, wherein said vector transmission means transmits said line residual-capacity control minimum-cost vector to said adjacent exchange when the residual capacity class or minimum cost is changed.

Claim 7

Dependent Claim 37 words

A congestion avoidance control system for a communication network as set forth in claim 4, wherein said vector transmission means transmits said line residual-capacity control minimum-cost vector to said adjacent exchange at intervals of a predetermined period.

Claim 8

Dependent Claim 73 words

A congestion avoidance control system for a communication network as set forth in claim 1, wherein said application data at the time of issuing said calling request includes one of cost values allowable for a route between the outgoing and incoming terminals, and said retrieval means retrieves a minimum cost line of maximum one of said line residual capacity classes having a minimum cost value in a range of said allowable cost values.

Claim 9

Dependent Claim 175 words

A congestion avoidance control system for a communication network as set forth in claim 1, wherein said application data at the time of issuing said calling request includes one of a plurality of use priority levels preset for the respective terminals as decision indexes of whether to preferentially use relay lines of the route leading to the incoming exchange, each of said exchanges has a use priority level memory means in which said plurality of use priority levels as the decision indexes of whether to allow call setting to lines of its own exchange are stored in association with the line residual capacities of the lines of the exchange, said every-line residual-capacity minimum-cost memory means stores therein the minimum cost lines of the incoming exchanges arranged according to said use priority levels, and said retrieval means retrieves minimum cost one of the lines of the line residual capacity classes associated with the use priority levels by making reference to the minimum cost lines of the use priority levels in said use priority level memory means.

Claim 10

Dependent Claim 205 words

A congestion avoidance control system for a communication network having a plurality of exchanges interconnected by a plurality of lines for deciding one of communication routes leading from outgoing one of said plurality of exchanges including an outgoing terminal to incoming one thereof including an incoming terminal, each of said exchanges comprising: an every-line residual-capacity minimum-cost table for storing one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of its own exchange minus a line capacity being now used thereof as a residual line capacity, minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, and a minimum cost value; retrieval means, when a calling request having a cost value allowable for a route between said outgoing and incoming terminals as an application data is issued from said outgoing terminal, for retrieving said minimum cost line of maximum one of the line residual capacity classes corresponding to a minimum cost value in a range of said allowable cost value from said every-line residual-capacity minimum-cost table; and decision means for deciding one of the communication routes on the basis of the minimum cost line retrieved by said retrieval means.

Claim 11

Dependent Claim 205 words

A congestion avoidance control system for a communication network having a plurality of exchanges interconnected by a plurality of lines for deciding one of communication routes leading from outgoing one of said plurality of exchanges including an outgoing terminal to incoming one thereof including an incoming terminal, each of said exchanges comprising: an every-line residual-capacity minimum-cost table for storing one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of its own exchange minus a line capacity being now used thereof as a residual line capacity, minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, and a minimum cost value; retrieval means, when a calling request having a cost value allowable for a route between said outgoing and incoming terminals as an application data is issued from said outgoing terminal, for retrieving said minimum cost line of maximum one of the line residual capacity classes corresponding to a minimum cost value in a range of said allowable cost value from said every-line residual-capacity minimum-cost table; and decision means for deciding one of the communication routes on the basis of the minimum cost line retrieved by said retrieval means.

Claim 12

Dependent Claim 265 words

A congestion avoidance control system for a communication network having a plurality of exchanges interconnected by a plurality of lines for deciding one of communication routes leading from outgoing one of said plurality of exchanges including an outgoing terminal to incoming one thereof including an incoming terminal, each of said exchanges comprising: means for preparing a use priority level table in which a plurality of use priority levels as the decision index of whether to allow call setting to lines of its own exchange are stored in association with the line residual capacities of the lines of the exchange, an every-line residual-capacity minimum-cost table for storing one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of its own exchange minus a line capacity being now used thereof as a residual line capacity, minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, a minimum cost value, and also the minimum cost lines of the incoming exchanges arranged according to said use priority levels; retrieval means, when a calling request having one of said use priority levels as an application data is issued from said outgoing terminal, for retrieving minimum cost one of the lines of the line residual capacity classes associated with the use priority levels by making reference to the minimum cost lines of the use priority levels in said use priority level table; and decision means for deciding one of the communication routes on the basis of the minimum cost line retrieved by said retrieval means.

Claim 13

Dependent Claim 265 words

A congestion avoidance control system for a communication network having a plurality of exchanges interconnected by a plurality of lines for deciding one of communication routes leading from outgoing one of said plurality of exchanges including an outgoing terminal to incoming one thereof including an incoming terminal, each of said exchanges comprising: means for preparing a use priority level table in which a plurality of use priority levels as the decision index of whether to allow call setting to lines of its own exchange are stored in association with the line residual capacities of the lines of the exchange, an every-line residual-capacity minimum-cost table for storing one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of its own exchange minus a line capacity being now used thereof as a residual line capacity, minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, a minimum cost value, and also the minimum cost lines of the incoming exchanges arranged according to said use priority levels; retrieval means, when a calling request having one of said use priority levels as an application data is issued from said outgoing terminal, for retrieving minimum cost one of the lines of the line residual capacity classes associated with the use priority levels by making reference to the minimum cost lines of the use priority levels in said use priority level table; and decision means for deciding one of the communication routes on the basis of the minimum cost line retrieved by said retrieval means.

Claim 14

Dependent Claim 277 words

In a route decision system for a communication network wherein a plurality of exchanges are interconnected by a plurality of lines, each of a plurality of exchanges stores, in an every-line residual-capacity minimum-cost table, one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of its own exchange minus a line capacity being now used thereof as a residual line capacity, a line number of minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, and a minimum cost value, and, when a calling request having a request use capacity as an application data is issued from said outgoing terminal, each of the exchanges retrieves said every-line residual-capacity minimum-cost table to sequentially extract said minimum cost line of one of the line residual capacity classes satisfying said request use capacity and determines one of relay routes for tandem connection between the incoming and outgoing terminals minimizing a sum of the costs of the relay route lines; a congestion avoidance control method wherein each of said exchanges calculates an addition value to a previous minimum cost value at the time of updating the minimum cost value in said every-line residual-capacity minimum-cost table according to a calculation equation by multiplying a line resistive value indicative of a reciprocal of a ratio of the residual capacity value of its own line to an intra-network capacity value by a fixed load value of the line to make relatively low a cost of a line having a relatively large residual capacity and thereby to make it difficult to select the line having a small residual capacity.

Claim 15

Dependent Claim 277 words

In a route decision system for a communication network wherein a plurality of exchanges are interconnected by a plurality of lines, each of a plurality of exchanges stores, in an every-line residual-capacity minimum-cost table, one of a plurality of line residual capacity classes of line capacity units corresponding to a full line capacity of its own exchange minus a line capacity being now used thereof as a residual line capacity, a line number of minimum cost one of lines forming the routes leading from its own exchange to the incoming exchange, and a minimum cost value, and, when a calling request having a request use capacity as an application data is issued from said outgoing terminal, each of the exchanges retrieves said every-line residual-capacity minimum-cost table to sequentially extract said minimum cost line of one of the line residual capacity classes satisfying said request use capacity and determines one of relay routes for tandem connection between the incoming and outgoing terminals minimizing a sum of the costs of the relay route lines; a congestion avoidance control method wherein each of said exchanges calculates an addition value to a previous minimum cost value at the time of updating the minimum cost value in said every-line residual-capacity minimum-cost table according to a calculation equation by multiplying a line resistive value indicative of a reciprocal of a ratio of the residual capacity value of its own line to an intra-network capacity value by a fixed load value of the line to make relatively low a cost of a line having a relatively large residual capacity and thereby to make it difficult to select the line having a small residual capacity.

Claim 16

Dependent Claim 150 words

A congestion avoidance control method as set forth in claim 11, wherein each terminal has a function of informing an outgoing exchange of, at the time of issuing said calling request, an application data including said request use capacity and one of cost values allowable for a route between the outgoing and incoming terminals, and when the calling request having said application data is issued from the outgoing terminal, each of the exchanges up to the incoming terminal and associated with route decision retrieves said every-line residual-capacity minimum-cost table with respect to the minimum cost lines of all the line residual capacity classes satisfying said request use capacity, and selects one of the routes forming minimum cost lines of maximum one of said line residual capacity classes having a minimum cost value in a range of said allowable cost values contained in the application data issued from the outgoing terminal.

Claim 17

Dependent Claim 248 words

A congestion avoidance control method as set forth in claim 11, wherein each terminal has a function of informing an outgoing exchange of, at the time of issuing said calling request, said application data including said request use capacity and one of a plurality of use priority levels preset for the respective terminals as decision indexes of whether to preferentially use relay lines of the route leading to the incoming exchange, each of said exchanges has a use priority level table in which said plurality of use priority levels as the decision index of whether to allow call setting to lines of its own exchange are stored in association with the line residual capacities of the lines of the exchange, said every-line residual-capacity minimum-cost table stores therein the minimum cost lines of the incoming exchanges arranged according to said use priority levels, and when a calling request having said application data is issued from said outgoing terminal, each of the exchanges associated with route decision to the incoming terminal selects one of the routes forming minimum cost lines of maximum one of said line residual capacity classes associated with the use priority levels by making reference to the minimum cost lines of the use priority levels of said use priority level table contained in the application data issued from the outgoing terminal to prevent a calling request having the request use capacity exceeding a predetermined value to flow through a relay line having a decreased line residual capacity.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1994-11-18	1995-05-20	1995-11-19	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1998-11-18	1999-05-20	1999-11-19	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2002-11-18	2003-05-20	2003-11-19	$7700.00	Window Closed / Lapsed

Congestion avidance control system and method for communication network

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag