← Back to Patent Explorer
US5650993A Expired / Lapsed US ⏱️ 0.0 years remaining

Drop from front of buffer policy in feedback networks

Assignee: Nytell Software LLC
•
Filing: 1995-03-20
•
Granted: 1997-07-22
•
Expires: 2015-03-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for transmitting packets or cells (or both) in a communications network 10 is disclosed. The packets or cells are transmitted along a forward communications path in a network from a source node h1 via one or more intermediary nodes r1, x1, r5 and r2 to a destination node h4. At the intermediary nodes r1, x1, r5 or r2, the packets or cells are received in a buffer 38 or 42-1 to 42-4. The packets or cells are transmitted along the forward communications path according to a transmission schedule. In the presence of congestion at one of the intermediary nodes x1, an indication of the congestion is provided to the destination nodes h4 of the first packets to be transmitted according to the schedule. An indication of the congestion of the first packets or cells is provided by the destination nodes h4 of the first packets or cells to the source nodes h1 of the first packets or cells via a feedback communications path.

Inventors

  • 👤 Tirunell Viswanathan Lakshman
  • 👤 Arnold Leslie Neidhardt
  • 👤 Teunis Jan Ott

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 02:09
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04L47/00; H04L47/10; H04L47/26; H04L47/265; H04L47/32; H04L47/33; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5635; H04L2012/5638; H04L2012/5646; H04L2012/5647; H04L2012/5648; H04L2012/5665; H04L2012/5667; H04L47/267

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 127 words
A method for transmitting data units in a communications network comprising the steps of: transmitting said data units along a forward communications path in a network from source nodes via one or more intermediary nodes to destination nodes, at said intermediary nodes, receiving said data units in buffers and transmitting said data units stored in said buffers along said forward communications path according to a transmission schedule, in the presence of congestion at one of said intermediary nodes, providing an indication of said congestion to said destination nodes of first data units being transmitted according to said schedule, and providing an indication of said congestion at said one intermediary node by said destination nodes of said first data units to source nodes of said first data units.
Claim 2
Independent Claim 127 words
A method for transmitting data units in a communications network comprising the steps of: transmitting said data units along a forward communications path in a network from source nodes via one or more intermediary nodes to destination nodes, at said intermediary nodes, receiving said data units in buffers and transmitting said data units stored in said buffers along said forward communications path according to a transmission schedule, in the presence of congestion at one of said intermediary nodes, providing an indication of said congestion to said destination nodes of first data units being transmitted according to said schedule, and providing an indication of said congestion at said one intermediary node by said destination nodes of said first data units to source nodes of said first data units.
Claim 3
Dependent Claim 11 words
The method of claim 1 wherein said data units are packets.
Claim 4
Dependent Claim 11 words
The method of claim 1 wherein said data units are cells.
Claim 5
Dependent Claim 28 words
The method of claim 1 wherein said step of providing an indication of congestion to said destination nodes further comprises the step of: dropping said first data units.
Claim 6
Dependent Claim 61 words
The method of claim 1 further comprising the step of: receiving one of said indications of congestion from one of said destination nodes of said first data units at one of said source nodes of said first data units, and in response to said one indication, reducing the transmission of data units from said one source node into said communications network.
Claim 7
Dependent Claim 35 words
The method of claim 1 wherein said step of providing an indication of congestion to said destination nodes further comprises the step of: setting a congestion bit in at least one of said data units.
Claim 8
Dependent Claim 20 words
The method of claim 1 wherein said steps of transmitting and providing are performed according to Transmission Control Protocol (TCP).
Claim 9
Dependent Claim 30 words
The method of claim 1 wherein said steps of transmitting and receiving and said steps of providing are performed according to Transmission Control Protocol (TCP) over asychronous transfer mode (ATM).
Claim 10
Dependent Claim 33 words
The method of claim 1 further comprising the step of, in the presence of congestion at one of said intermediary nodes, dropping said first data units to be transmitted according to said schedule.
Claim 11
Dependent Claim 30 words
The method of claim 9 further comprising the step of providing to said destination nodes of said first data units an indication that said first data units have been dropped.
Claim 12
Dependent Claim 39 words
The method of claim 10 further comprising the step of providing from said destination nodes of said first data units to said source nodes of said first data units an indication that said first data units have been dropped.
Claim 13
Independent Claim 172 words
A method for transmitting packets in a communications network comprising the steps of: transmitting said packets along a forward communications path in a network from a source node via a sequence of two or more intermediary nodes to a destination node, at a first intermediary node of said sequence, dividing each packet into a plurality of cells and transmitting said cells of said packet along said forward communications path, at a second one of said intermediary nodes, receiving said cells in a buffer and transmitting said cells stored in said buffer along said forward communications path according to a transmission schedule, in the presence of congestion at said second intermediary node, dropping the first cells to be transmitted according to said schedule, if a cell into which a particular packet is divided is dropped, dropping each later cell into which said particular packet is divided, and providing an indication of said congestion for said particular packet by the destination nodes of said particular packet to the source node of said particular packet.
Claim 14
Independent Claim 172 words
A method for transmitting packets in a communications network comprising the steps of: transmitting said packets along a forward communications path in a network from a source node via a sequence of two or more intermediary nodes to a destination node, at a first intermediary node of said sequence, dividing each packet into a plurality of cells and transmitting said cells of said packet along said forward communications path, at a second one of said intermediary nodes, receiving said cells in a buffer and transmitting said cells stored in said buffer along said forward communications path according to a transmission schedule, in the presence of congestion at said second intermediary node, dropping the first cells to be transmitted according to said schedule, if a cell into which a particular packet is divided is dropped, dropping each later cell into which said particular packet is divided, and providing an indication of said congestion for said particular packet by the destination nodes of said particular packet to the source node of said particular packet.

References Cited (Backward Citations)

US5283788A Cited
US5276677A Cited
US5402416A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-07-21 2001-01-20 2001-07-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-07-21 2005-01-20 2005-07-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-07-21 2009-01-20 2009-07-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag