Patent US3716035A successfully refreshed from Google Patents.
Patent US5029164A successfully refreshed from Google Patents.
US5029164A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Congestion avoidance in high-speed network carrying bursty traffic
Assignee: Enterasys Networks Inc
•
Filing: 1990-04-13
•
Granted: 1991-07-02
•
Expires: 2010-04-13
Abstract
Abstract A data communication network subject to bursty traffic employs a bandwidth allocation scheme to avoid congestion. When a source node has a burst of traffic to send, it first sends a bandwidth request message through the network from source to destination. At each intermediate node, this bandwidth request is examined and the node determines how much of the requested traffic level it will be able to support at a time in the future of one round-trip interval hence, and this node either grants the request or marks down the request to a level that it can support, then passes it on. When the request reaches the destination, it is returned along the same path to the source, and the source then employs the marked-down allocation to select the rate used to send the burst of data. The allocation for this source node remains in effect for a limited time, depending upon the amount of data to be sent in the burst, then returns to a "residual" level.
Inventors
- 👤 Fred R. Goldstein
- 👤 Ross Callon
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 18:43
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/70; H04L47/72; H04L47/724; H04J; H04J3/00; H04J3/16; H04J3/1605; H04J3/1623; H04J3/1629; H04J3/24; H04J3/247; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04L47/74; H04L47/748; H04L47/82; H04L47/826; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5638; H04L2012/5646; H04L2012/5651; H04L2012/5672
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
182 words
A method of congestion avoidance in a communications network having multiple nodes, comprising the steps of: (a) sending from a first of said nodes to a first intermediate one of said nodes a request for an allocation of bandwidth for a transmission of a quantity of data from said first node to a second one of said nodes via said first intermediate node and a second intermediate node; (b) comparing said request in said first intermediate node with capacity at said first intermediate node to meet said request, and generating a modified request to reduce said allocation if necessary; (c) sending said modified request from said first intermediate node to said second intermediate node; (d) comparing said modified request in said second intermediate node with capacity at said second intermediate node to meet said modified request, and generating a second modified request to reduce said allocation if necessary; (e) sending said second modified request back to said first node; (f) transmitting said quantity of data from said first node to said second node using the bandwidth specified in said second modified request.
Claim 2
Independent Claim
182 words
A method of congestion avoidance in a communications network having multiple nodes, comprising the steps of: (a) sending from a first of said nodes to a first intermediate one of said nodes a request for an allocation of bandwidth for a transmission of a quantity of data from said first node to a second one of said nodes via said first intermediate node and a second intermediate node; (b) comparing said request in said first intermediate node with capacity at said first intermediate node to meet said request, and generating a modified request to reduce said allocation if necessary; (c) sending said modified request from said first intermediate node to said second intermediate node; (d) comparing said modified request in said second intermediate node with capacity at said second intermediate node to meet said modified request, and generating a second modified request to reduce said allocation if necessary; (e) sending said second modified request back to said first node; (f) transmitting said quantity of data from said first node to said second node using the bandwidth specified in said second modified request.
Claim 3
Dependent Claim
41 words
A method according to claim 1 wherein said step of comparing said request in said first intermediate node includes, comparing with capacity projected at a time about that required for one round trip between said first node and said second node.
Claim 4
Dependent Claim
36 words
A method according to claim 1 wherein said first node is allocated a standard bandwidth value and only sends said request if the bandwidth needed to transmit said quantity of data exceeds said standard bandwidth value.
Claim 5
Dependent Claim
25 words
A method according to claim 1 wherein data is transmitted from said first intermediate node to said second intermediate node by an asynchronous transfer mode.
Claim 6
Dependent Claim
17 words
A method according to claim 1 wherein said steps of sending are by a serial data link.
Claim 7
Dependent Claim
176 words
A communications network having multiple nodes, comprising: (a) a transmitter sending from a first of said nodes to a first intermediate one of said nodes a request for an allocation of bandwidth for a data transmission from said first node to a second one of said nodes via said first intermediate node and a second intermediate node; (b) means for comparing said request in said first intermediate node with capacity at said first intermediate node to meet said request, and for generating a modified request to reduce said allocation if necessary, said modified request being sent from said first intermediate node to said second intermediate node; (c) means for comparing said modified request in said second intermediate node with capacity at said second intermediate node to meed said modified request, and for generating a second modified request to reduce said allocation if necessary, said second modified request being sent back to said first node; (d) said transmitter sending data from said first node to said second node using the bandwidth specified in said second modified request.
Claim 8
Dependent Claim
176 words
A communications network having multiple nodes, comprising: (a) a transmitter sending from a first of said nodes to a first intermediate one of said nodes a request for an allocation of bandwidth for a data transmission from said first node to a second one of said nodes via said first intermediate node and a second intermediate node; (b) means for comparing said request in said first intermediate node with capacity at said first intermediate node to meet said request, and for generating a modified request to reduce said allocation if necessary, said modified request being sent from said first intermediate node to said second intermediate node; (c) means for comparing said modified request in said second intermediate node with capacity at said second intermediate node to meed said modified request, and for generating a second modified request to reduce said allocation if necessary, said second modified request being sent back to said first node; (d) said transmitter sending data from said first node to said second node using the bandwidth specified in said second modified request.
Claim 9
Dependent Claim
43 words
A network according to claim 6 wherein said means for comparing said request in said first intermediate node includes means for comparing with capacity projected at a time about that required for one round trip between said first node and said second node.
Claim 10
Dependent Claim
34 words
A network according to claim 6 wherein said first node is allocated a standard bandwidth value and only sends said request if the bandwidth needed for said data transmission exceeds said standard bandwidth value.
Claim 11
Dependent Claim
32 words
A network according to claim 6 including a transceiver in said first intermediate node which transmits data from said first intermediate node to said second intermediate node by an asynchronous transfer mode.
Claim 12
Dependent Claim
16 words
A network according to claim 6 wherein said transmitter sends data by a serial data link.
Claim 13
Independent Claim
168 words
A method of transmitting a quantity of digital information from a first node in a network to a destination, comprising the steps of: (a) transmitting from said first node a control cell containing a request for a bandwidth allocation needed for said quantity of information, a bandwidth quote equal to said bandwidth allocation, and a duration for the requested bandwidth; (b) receiving said control cell at an intermediate node in said network and marking down said bandwidth quote in said control cell at said intermediate node in response to the capacity of said intermediate node at a time when said quantity of information is to be transmitted, then transmitting said control cell toward said destination; (c) subsequently receiving at said first node a return of said control cell in which said bandwidth quote is modified downward in accordance with capacity of other nodes in said network; (d) transmitting from said first node to said destination said quantity of information at a bandwidth corresponding to said modified bandwidth quote.
Claim 14
Independent Claim
168 words
A method of transmitting a quantity of digital information from a first node in a network to a destination, comprising the steps of: (a) transmitting from said first node a control cell containing a request for a bandwidth allocation needed for said quantity of information, a bandwidth quote equal to said bandwidth allocation, and a duration for the requested bandwidth; (b) receiving said control cell at an intermediate node in said network and marking down said bandwidth quote in said control cell at said intermediate node in response to the capacity of said intermediate node at a time when said quantity of information is to be transmitted, then transmitting said control cell toward said destination; (c) subsequently receiving at said first node a return of said control cell in which said bandwidth quote is modified downward in accordance with capacity of other nodes in said network; (d) transmitting from said first node to said destination said quantity of information at a bandwidth corresponding to said modified bandwidth quote.
Claim 15
Dependent Claim
16 words
A method according to claim 11 wherein said duration is expressed in quantity of digital information.
Claim 16
Dependent Claim
32 words
A method according to claim 11 wherein said node is granted a selected allocation of bandwidth, and said control cell is transmitted only if said request exceeds said selected allocation of bandwidth.
Claim 17
Dependent Claim
26 words
A method according to claim 11 wherein said information is transmitted from said intermediate node in said network to another node by an asynchronous transfer mode.
Claim 18
Dependent Claim
17 words
A method according to claim 11 wherein said step of transmitting is by a serial data link.
Claim 19
Dependent Claim
192 words
Apparatus for transmitting a quantity of digital information from a first node in a network to a destination, comprising: (a) means for transmitting from said first node a control cell containing (1) a request for a bandwidth allocation needed for said quantity of information, (2) a bandwidth quote equal to said bandwidth allocation, and (3) a duration for the requested bandwidth; (b) means for receiving said control cell at an intermediate node in said network and modifying downward said bandwidth quote in said control cell in response to the capacity of said intermediate node at a time when said quantity of information is to be transmitted; (c) means for transmitting said control cell including said modified downward bandwidth quote from said intermediate node toward said destination; (d) means in said first node for subsequently receiving at said node a return of said control cell in which said bandwidth quote is modified downward in accordance with capacity of other nodes in said network; (c) and means in said first node for transmitting from said first node to said destination said quantity of information at a bandwidth corresponding to said modified downward bandwidth quote.
Claim 20
Dependent Claim
192 words
Apparatus for transmitting a quantity of digital information from a first node in a network to a destination, comprising: (a) means for transmitting from said first node a control cell containing (1) a request for a bandwidth allocation needed for said quantity of information, (2) a bandwidth quote equal to said bandwidth allocation, and (3) a duration for the requested bandwidth; (b) means for receiving said control cell at an intermediate node in said network and modifying downward said bandwidth quote in said control cell in response to the capacity of said intermediate node at a time when said quantity of information is to be transmitted; (c) means for transmitting said control cell including said modified downward bandwidth quote from said intermediate node toward said destination; (d) means in said first node for subsequently receiving at said node a return of said control cell in which said bandwidth quote is modified downward in accordance with capacity of other nodes in said network; (c) and means in said first node for transmitting from said first node to said destination said quantity of information at a bandwidth corresponding to said modified downward bandwidth quote.
Claim 21
Dependent Claim
14 words
Apparatus according to claim 16 wherein duration is expressed in quantity of digital information.
Claim 22
Dependent Claim
36 words
Apparatus according to claim 16 wherein said first node is granted a selected allocation of bandwidth, and said control cell is transmitted from said first node only if said request exceeds said selected allocation of bandwidth.
Claim 23
Dependent Claim
18 words
Apparatus according to claim 16 wherein said means in said node for transmitting uses an asynchronous transfer mode.
References Cited (Backward Citations)
US4404557A
Cited
US4538147A
Cited
US4679191A
Cited
US4779267A
Cited
US4736369A
Cited
US4750168A
Cited
US4769811A
Cited
US4896316A
Cited
US4852089A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-01 | 1994-12-31 | 1995-07-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-01 | 1998-12-31 | 1999-07-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-01 | 2002-12-31 | 2003-07-02 | $7700.00 | Window Closed / Lapsed |