Patent US5233204A successfully refreshed from Google Patents.
Patent US5119367A successfully refreshed from Google Patents.
US5119367A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and a node circuit for routing bursty data
Assignee: Oki Electric Industry Co Ltd
•
Filing: 1989-10-25
•
Granted: 1992-06-02
•
Expires: 2009-10-25
Abstract
Abstract A node circuit for connecting a plurality of input lines to a plurality of output lines in a packet switching system. The circuit includes a switching network whose connections are stored as a link table whose entries are determined by a traffic control device based on estimated traffic information included in a signalling packet provided at the initial stage of a call. The traffic control device is coupled to the switching network through a switching control device. The traffic control device computes a necessary available traffic carrying capacity of an output line to be selected for the call. The device compares this value to the actual available traffic carrying capacity of the output lines which lead to the destination terminal to determine the most appropriate output line and stores the result in the link table. A traffic counting device is also provided in order to obtain a count of the actual traffic of the call. this count is then utilized as a replacement for the estimated traffic information by the traffic control device in determining the entries of the link table when a subsequent call from the same origination terminal to the same destination terminal and with the same estimated traffic information is received by the node circuit.
Inventors
- 👤 Masami Kawakatsu
- 👤 Kyoichi Nakamaki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 04:43
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/0016; H04Q3/002; H04L; H04L47/00; H04L47/10
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
219 words
An origination node circuit for routing a data call to a destination node via one of a plurality of output lines, the origination node receiving data calls from at least one input line, each data call including a plurality of packets, each packet including information identifying the call, the data call including traffic data, the traffic data indicative of an estimated data rate of the call, each output line having an available data rate carrying capacity, the circuit comprising: a traffic control device having means for determining the available capacity of each output line, estimating a data rate carrying capacity needed on an output line to carry the call based on the traffic data, and selecting one of the output lines to carry the call to the destination node based at least in part on the estimate and the available capacities; and a switching network including means, coupled to said traffic control device, for storing in a link table data associating the call with the input line and the selected output line, and means, coupled to said storing means and responsive to the identifying information in each packet of the call, for connecting the input line to the selected output line in the link table for transferring each data packet to the destination node on the selected output line.
Claim 2
Dependent Claim
219 words
An origination node circuit for routing a data call to a destination node via one of a plurality of output lines, the origination node receiving data calls from at least one input line, each data call including a plurality of packets, each packet including information identifying the call, the data call including traffic data, the traffic data indicative of an estimated data rate of the call, each output line having an available data rate carrying capacity, the circuit comprising: a traffic control device having means for determining the available capacity of each output line, estimating a data rate carrying capacity needed on an output line to carry the call based on the traffic data, and selecting one of the output lines to carry the call to the destination node based at least in part on the estimate and the available capacities; and a switching network including means, coupled to said traffic control device, for storing in a link table data associating the call with the input line and the selected output line, and means, coupled to said storing means and responsive to the identifying information in each packet of the call, for connecting the input line to the selected output line in the link table for transferring each data packet to the destination node on the selected output line.
Claim 3
Dependent Claim
87 words
A circuit according to claim 1, further comprising means for counting data of the call to obtain the actual data rate of the call, said traffic control device having means for storing the actual data rate, said traffic control device estimating a data carrying capacity needed on an output line to carry a subsequent call received on said input line based at least in part on the available capacities of the output lines, the stored actual data rate, and the estimated data rate of the subsequent call.
Claim 4
Dependent Claim
31 words
A node circuit according to claim 1, wherein the traffic data is a signaling packet which includes destination address information, estimated maximum bit rate information, and estimated average bit rate information.
Claim 5
Independent Claim
185 words
A method of routing from an input line to an output line, a data call to a destination terminal originating at an origination terminal, in a packet switching network, each call including a plurality of packets, each packet including information identifying the call, the method comprising the steps of: (a) including with the call estimation data indicative of an estimate of a data rate of the call; (b) receiving the call at a node circuit on the input line; (c) computing and storing in a memory at the node circuit a first value indicative of a necessary available data rate carrying capacity on an output line to carry the call, based on the estimation data; (d) selecting from among a plurality of output lines leading to the destination terminal, an output line which has available enough data rate carrying capacity to carry the call, based on the result of the computing; (e) storing data associating the call, the input line and the selected output line in a link table; and (f) connecting the input line and the selected output line based on the stored data.
Claim 6
Independent Claim
185 words
A method of routing from an input line to an output line, a data call to a destination terminal originating at an origination terminal, in a packet switching network, each call including a plurality of packets, each packet including information identifying the call, the method comprising the steps of: (a) including with the call estimation data indicative of an estimate of a data rate of the call; (b) receiving the call at a node circuit on the input line; (c) computing and storing in a memory at the node circuit a first value indicative of a necessary available data rate carrying capacity on an output line to carry the call, based on the estimation data; (d) selecting from among a plurality of output lines leading to the destination terminal, an output line which has available enough data rate carrying capacity to carry the call, based on the result of the computing; (e) storing data associating the call, the input line and the selected output line in a link table; and (f) connecting the input line and the selected output line based on the stored data.
Claim 7
Dependent Claim
51 words
A method according to claim 4, wherein the call includes a signaling packet containing the estimation data and a bursty data transmission following the signaling packet, and the estimation data represents an estimate of an average data rate for the call and a maximum data rate of the bursty data transmission.
Claim 8
Dependent Claim
61 words
A method according to claim 5, further comprising the steps of: measuring the actual data rate on the input line during the bursty data transmission; and during a succeeding call, computing at the node circuit a necessary capacity to carry on an output line succeeding packets of said succeeding call, based on the measured actual data rate in the preceding call.
Claim 9
Dependent Claim
220 words
A method according to claim 4, where the call includes a signaling packet containing the estimation data and at least a destination address, and the estimation data includes estimates of a maximum transmission bit rate and an average transmission bit rate of the call, and said step of computing further comprises the steps of: preparing a maximum bit rate table whose contents are first addresses in the memory corresponding to respective maximum bit rate values; storing effective bit rate tables at the first addresses, each effective bit rate table containing: values of estimated average bit rates and for each estimated average bit rate value, an associated effective bit rate value, all of the effective bit rate values in each bit rate table corresponding to the respective maximum bit rate values; identifying the address in the maximum bit rate table which corresponds to the maximum bit rate value equal to the estimate of the maximum transmission bit rate in the signaling packet; accessing with the identified address in the maximum bit rate table, the effective bit rate table at the identified address and identifying in the accessed effective bit rate table the effective bit rate associated with the estimated average bit rate value in the signaling packet; and storing the identified effective bit rate in the memory as the first value.
Claim 10
Dependent Claim
158 words
A method according to claim 7, wherein said step of selecting further comprises the steps of: generating characteristic tables for each of a plurality of destination terminals, each characteristic table containing entries which associate a maximum bit rate, an existing bit rate, and a line identification for each of the output lines leading to the respective destination terminal, and storing the characteristic tables in a memory at corresponding addresses; generating a destination table containing entries which associate the respective destination terminals with the addresses of the characteristic tables therefore; identifying the destination terminal to which the call is directed and identifying from the destination table the address in the memory of the characteristic table therefore; and accessing the identified characteristic table and identifying therein one of the lines identified therein on which the difference between the maximum transmission rate and the present transmission rate, according to the identified characteristic table, is greater than the identified effective bit rate.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-06-02 | 1995-12-02 | 1996-06-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-06-02 | 1999-12-02 | 2000-06-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-06-02 | 2003-12-02 | 2004-06-02 | $7700.00 | Window Closed / Lapsed |