US4769815A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet flow control method
Assignee: Nokia Bell Labs
•
Filing: 1987-04-10
•
Granted: 1988-09-06
•
Expires: 2007-04-10
Abstract
Abstract A packet flow control method where delay data are added into an initial packet as it traverses a packet switching network, and where the receiver of the initial packet, rather than the sender, establishes a window size based on such delay data to be used for the duration of a packet connection through the network. The delay data allow for the calculation of an average rather than an instantaneous network delay such that the flow control mechanism is not dependent on the magnitude of network congestion that happens to be present when the connection is first established. Since the receiver determines the window size, the flow control mechanism is put in place as an integral part of the initial packet exchange used to establish the two-way packet connection rather than requiring an additional packet communication to the receiver after a window size calculation by the sender.
Inventors
- 👤 Mark G. Hinch
- 👤 John B. Reid
- 👤 William C. Wiberg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 09:53
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
151 words
In a packet switching arrangement comprising a plurality of packet switching nodes, a method of controlling packet flow comprising transmitting a first packet from a first one of said nodes to a second one of said nodes via intermediate ones of said nodes to establish a packet connection between said first node and said second node, ones of said first, intermediate, and second nodes adding delay data into said first packet, in response to a receipt of said first packet, said second node determining a window size for use over said connection based on said delay data added into said first packet, said determined window size comprising a number, N, of packets, and after said determining step, said second node transmitting packets to said first node over said connection such that, at any given time, no more than N packets transmitted by said second node are unacknowledged by said first node.
Claim 2
Dependent Claim
151 words
In a packet switching arrangement comprising a plurality of packet switching nodes, a method of controlling packet flow comprising transmitting a first packet from a first one of said nodes to a second one of said nodes via intermediate ones of said nodes to establish a packet connection between said first node and said second node, ones of said first, intermediate, and second nodes adding delay data into said first packet, in response to a receipt of said first packet, said second node determining a window size for use over said connection based on said delay data added into said first packet, said determined window size comprising a number, N, of packets, and after said determining step, said second node transmitting packets to said first node over said connection such that, at any given time, no more than N packets transmitted by said second node are unacknowledged by said first node.
Claim 3
Dependent Claim
51 words
A method in accordance with claim 1 wherein said first packet includes a hop count field, wherein said adding step comprises incrementing said hop count field, and wherein said determining step comprises deriving said window size as a function of a number, H, of hops defined by said hop count field.
Claim 4
Dependent Claim
73 words
A method in accordance with claim 2 wherein said deriving step comprises obtaining values of a set of parameters (tc, ps, csd, qd, id, pd), where tc is a throughput class, ps is a packet size, csd is a cross switch delay, qd is a queuing delay, id is an insertion delay, and pd is a propagation delay, and determining said number, N, based on a value of an expression: (2*D*tc/ps), where D=(H+1)(csd)+H(qd+id+pd).
Claim 5
Dependent Claim
51 words
A method in accordance with claim 3 wherein said obtaining step comprises said second node determining said parameters tc and ps by communicating with terminal equipment coupled to said second node, and said second node determining said parameters csd, qd, id, and pd by reading a memory of said second node.
Claim 6
Dependent Claim
73 words
A method in accordance with claim 1 wherein one of said packets transmitted to said first node by said second node defines said number, N, said method further comprising after a receipt of said packet defining said number, N, said first node transmitting packets to said second node over said connection such that, at any given time, no more than N packets transmitted by said first node are unacknowledged by said second node.
Claim 7
Dependent Claim
76 words
A method in accordance with claim 1 wherein said first packet includes a terrestrial hop count field and a satellite hop count field, wherein said adding step comprises incrementing one of said hop count fields, and wherein said determining step comprises deriving said window size as a function of a number, Ht, of terrestrial hops defined by said terrestrial hop count field and a number, Hs, of satellite hops defined by said satellite hop count field.
Claim 8
Dependent Claim
81 words
A method in accordance with claim 6 wherein said deriving step comprises obtaining values of a set of parameters (tc, ps, csd, qd, id, tpd, spd), where tc is a throughput class, ps is a packet size, csd is a cross switch delay, qd is a queuing delay, id is an insertion delay, tpd is a terrestrial propagation delay, and spd is a satellite propagation delay, and determining said number, N, based on a value of an expression: (2*D*tc/ps), where D=(Ht+Hs+1)(csd)+Ht(qd+id+tpd)+Hs(qd+id+spd).
Claim 9
Dependent Claim
82 words
A method in accordance with claim 1 wherein said first packet includes a delay field, wherein said adding step comprises each of said ones of said first, intermediate, and second nodes, adding a one-way delay component associated with that node to said delay field, wherein said determining step comprises determining said number, N, based on a value of an expression: (2*D*tc/ps), where D is a delay defined by said delay field, tc is a throughput class, and ps is a packet size.
Claim 10
Dependent Claim
82 words
A method in accordance with claim 1 wherein said first packet includes a delay field, wherein said adding step comprises each of said ones of said first, intermediate, and second nodes, adding a two-way delay component associated with that node to said delay field, wherein said determining step comprises determining said number, N, based on a value of an expression: (D*tc/ps), where D is a delay defined by said delay field, tc is a throughput class, and ps is a packet size.
Claim 11
Dependent Claim
25 words
A method in accordance with claim 1 wherein said first packet is a call request packet to establish said packet connection for a virtual call.
Claim 12
Dependent Claim
28 words
A method in accordance with claim 1 wherein said first packet is a permanent virtual circuit setup packet to establish said packet connection for a permanent virtual circuit.
Claim 13
Dependent Claim
32 words
A method in accordance with claim 1 wherein said first packet is a reconnect request packet transmitted to establish said packet connection to replace a previously existing packet connection through said network.
Claim 14
Dependent Claim
179 words
In a packet switching arrangement comprising a plurality of packet switching nodes, a method of controlling packet flow comprising transmitting a first packet from a first one of said nodes to a second one of said nodes via intermediate ones of said nodes to establish a packet connection between said first node and said second node, ones of said first, intermediate, and second nodes adding delay data into said first packet, in response to a receipt of said first packet, said second node determining a window size for use over said connection based on said delay data added into said first packet, said determined window size comprising a number, N, of packets, after said determining step, said second node transmitting a second packet to said first node over said connection, said second packet defining said number, N, and after a receipt of said second packet, said first node transmitting packets to said second node over said connection such that, at any given time, no more than N packets transmitted by said first node are unacknowledged by said second node.
Claim 15
Dependent Claim
179 words
In a packet switching arrangement comprising a plurality of packet switching nodes, a method of controlling packet flow comprising transmitting a first packet from a first one of said nodes to a second one of said nodes via intermediate ones of said nodes to establish a packet connection between said first node and said second node, ones of said first, intermediate, and second nodes adding delay data into said first packet, in response to a receipt of said first packet, said second node determining a window size for use over said connection based on said delay data added into said first packet, said determined window size comprising a number, N, of packets, after said determining step, said second node transmitting a second packet to said first node over said connection, said second packet defining said number, N, and after a receipt of said second packet, said first node transmitting packets to said second node over said connection such that, at any given time, no more than N packets transmitted by said first node are unacknowledged by said second node.
Claim 16
Dependent Claim
51 words
A method in accordance with claim 13 wherein said first packet includes a hop count field, wherein said adding step comprises incrementing said hop count field, and wherein said determining step comprises deriving said window size as a function of a number, H, of hops defined by said hop count field.
Claim 17
Dependent Claim
73 words
A method in accordance with claim 14 wherein said deriving step comprises obtaining values of a set of parameters (tc, ps, csd, qd, id, pd), where tc is a throughput class, ps is a packet size, csd is a cross switch delay, qd is a queuing delay, id is an insertion delay, and pd is a propagation delay, and determining said number, N, based on a value of an expression: (2*D*tc/ps), where D=(H+1)(csd)+H(qd+id+pd).
Claim 18
Dependent Claim
51 words
A method in accordance with claim 15 wherein said obtaining step comprises said second node determining said parameters tc and ps by communicating with terminal equipment coupled to said second node, and said second node determining said parameters csd, qd, id, and pd by reading a memory of said second node.
Claim 19
Dependent Claim
47 words
A method in accordance with claim 13 further comprising after said determining step, said second node transmitting packets to said first node over said connection such that, at any given time, no more than N packets transmitted by said second node are unacknowledged by said first node.
Claim 20
Dependent Claim
76 words
A method in accordance with claim 13 wherein said first packet includes a terrestrial hop count field and a satellite hop count field, wherein said adding step comprises incrementing one of said hop count fields, and wherein said determining step comprises deriving said window size as a function of a number, Ht, of terrestrial hops defined by said terrestrial hop count field and a number, Hs, of satellite hops defined by said satellite hop count field.
Claim 21
Dependent Claim
81 words
A method in accordance with claim 18 wherein said deriving step comprises obtaining values of a set of parameters (tc, ps, csd, qd, id, tpd, spd), where tc is a throughput class, ps is a packet size, csd is a cross switch delay, qd is a queuing delay, id is an insertion delay, tpd is a terrestrial propagation delay, and spd is a satellite propagation delay, and determining said number, N, based on a value of an expression: (2*D*tc/ps), where D=(Ht+Hs+1)(csd)+Ht(qd+id+tpd)+Hs(qd+id+spd).
Claim 22
Dependent Claim
82 words
A method in accordance with claim 13 wherein said first packet includes a delay field, wherein said adding step comprises each of said ones of said first, intermediate, and second nodes, adding a one-way delay component associated with that node to said delay field, wherein said determining step comprises determining said number, N, based on a value of an expression: (2*D*tc/ps), where D is a delay defined by said delay field, tc is a throughput class, and ps is a packet size.
Claim 23
Dependent Claim
82 words
A method in accordance with claim 13 wherein said first packet includes a delay field, wherein said adding step comprises each of said ones of said first, intermediate, and second nodes, adding a two-way delay component associated with that node to said delay field, wherein said determining step comprises determining said number, N, based on a value of an expression: (D*tc/ps), where D is a delay defined by said delay field, tc is a throughput class, and ps is a packet size.
Claim 24
Dependent Claim
25 words
A method in accordance with claim 13 wherein said first packet is a call request packet to establish said packet connection for a virtual call.
Claim 25
Dependent Claim
28 words
A method in accordance with claim 13 wherein said first packet is a permanent virtual circuit setup packet to establish said packet connection for a permanent virtual circuit.
Claim 26
Dependent Claim
32 words
A method in accordance with claim 13 wherein said first packet is a reconnect request packet transmitted to establish said packet connection to replace a previously existing packet connection through said network.
Claim 27
Dependent Claim
157 words
In a packet switching arrangement comprising a plurality of packet switching nodes, a method of controlling packet flow over a packet connection from a first one of said nodes to a second one of said nodes via intermediate ones of said nodes, said method comprising in response to a receipt of a first packet from said first node via said intermediate ones of said nodes, wherein said first packet includes delay data added into said first packet by ones of said first, intermediate, and second nodes, said second node determining a window size for use over said connection based on said delay data added into said first packet, said determined window size comprising a number, N, of packets, and after said determining step, said second node transmitting packets to said first node over said connection such that, at any given time, no more than N packets transmitted by said second node are unacknowledged by said first node.
Claim 28
Dependent Claim
157 words
In a packet switching arrangement comprising a plurality of packet switching nodes, a method of controlling packet flow over a packet connection from a first one of said nodes to a second one of said nodes via intermediate ones of said nodes, said method comprising in response to a receipt of a first packet from said first node via said intermediate ones of said nodes, wherein said first packet includes delay data added into said first packet by ones of said first, intermediate, and second nodes, said second node determining a window size for use over said connection based on said delay data added into said first packet, said determined window size comprising a number, N, of packets, and after said determining step, said second node transmitting packets to said first node over said connection such that, at any given time, no more than N packets transmitted by said second node are unacknowledged by said first node.
References Cited (Backward Citations)
US4074232A
Cited
US4079209A
Cited
US4320500A
Cited
US4317195A
Cited
US4380063A
Cited
US4399531A
Cited
US4475192A
Cited
US4506358A
Cited
US4527267A
Cited
US4692860A
Cited
US4616359A
Cited
US4569042A
Cited
JPS60241349A
Cited
US4617657A
Cited
US4677616A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-09-06 | 1992-03-07 | 1992-09-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-09-06 | 1996-03-07 | 1996-09-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-09-06 | 2000-03-07 | 2000-09-06 | $7700.00 | Window Closed / Lapsed |