US5859853A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive packet training
Assignee: International Business Machines Corp
•
Filing: 1996-06-21
•
Granted: 1999-01-12
•
Expires: 2016-06-21
Abstract
Abstract A mechanism that dynamically adjusts the number of packets sent in the train from a node to reflect the rate of packets arriving at the node. A train is a group of packets that are sent from the node as one unit. The node has an optimum train length that the node would like to send. The node also has a timer interval, which is the maximum time to wait before sending the next train. If the timer interval expires and the number of packets accumulated in the train is less than the optimum train length, then the node transmits the train and sets the optimum train length to be the number of packets actually received; that is, the optimum train length is adjusted downward. If the number of packets accumulated equals the optimum train length and the timer interval has not yet expired, the receiving node transmits these packets in a train, and if the next packet arrives before the time that the timer would have expired, the node increases the optimum train length.
Inventors
- 👤 David Glenn Carlson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 15:38
CPC Classifications
H; H04; H04J; H04J1/00; H04J1/02; H04J1/14; H04L; H04L9/00; H04L9/40; H04L69/00; H04L69/22; H04L69/28
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
130 words
At one node in a plurality of nodes, a method for packet training between the nodes, comprising the steps of: starting a timer to expire at a predetermined maximum time to wait; counting the number of packets accumulated at the node; and dynamically adjusting the number of packets transmitted from the node in a train based on the number of packets accumulated at the node, an adjustable optimum train length, and the timer, wherein the dynamic adjusting step further comprises when the timer expires, transmitting the accumulated packets in the train and setting the optimum train length to be the greater of the number of packets accumulated in the train and a minimum number of packets per train, wherein the minimum number of packets per train is a predetermined constant.
Claim 2
Dependent Claim
130 words
At one node in a plurality of nodes, a method for packet training between the nodes, comprising the steps of: starting a timer to expire at a predetermined maximum time to wait; counting the number of packets accumulated at the node; and dynamically adjusting the number of packets transmitted from the node in a train based on the number of packets accumulated at the node, an adjustable optimum train length, and the timer, wherein the dynamic adjusting step further comprises when the timer expires, transmitting the accumulated packets in the train and setting the optimum train length to be the greater of the number of packets accumulated in the train and a minimum number of packets per train, wherein the minimum number of packets per train is a predetermined constant.
Claim 3
Dependent Claim
39 words
The method of claim 1, wherein the dynamic adjusting step further comprises: when the timer expires, transmitting the accumulated packets in the train and setting the optimum train length to be the number of packets accumulated in the train.
Claim 4
Dependent Claim
71 words
The method of claim 1, wherein the dynamic adjusting step further comprises: when the number of packets accumulated equals the optimum train length and the timer has not expired, canceling the timer, transmitting the accumulated packets, and saving the time that the timer would have expired had the timer not been canceled; and when a next packet arrives before the saved time, incrementing the optimum train length by an increment constant.
Claim 5
Dependent Claim
11 words
The method of claim 3, wherein the increment constant is one.
Claim 6
Dependent Claim
21 words
The method of claim 1 wherein the adjustable optimum train length is initialized to provide packet throughput as an initial goal.
Claim 7
Dependent Claim
22 words
The method of claim 1 wherein the adjustable optimum train length is initialized to provide packet response time as an initial goal.
Claim 8
Dependent Claim
25 words
The method of claim 5 wherein the adjustable optimum train length is initialized to be a maximum number of packets in a train minus one.
Claim 9
Dependent Claim
16 words
The method of claim 6 wherein the adjustable optimum train length is initialized to be one.
Claim 10
Independent Claim
126 words
An apparatus for packet training between the nodes, comprising: means for starting a timer to expire at a predetermined maximum time to wait; means counting the number of packets accumulated at the node; and means for dynamically adjusting the number of packets transmitted from the node in a train based on the number of packets accumulated at the node, an adjustable optimum train length, and the timer, wherein the dynamic adjusting means further comprises means, when the timer expires, for transmitting the accumulated packets in the train and setting the optimum train length to be the greater of the number of packets accumulated in the train and a minimum number of packets per train, wherein the minimum number of packets per train is a predetermined constant.
Claim 11
Independent Claim
126 words
An apparatus for packet training between the nodes, comprising: means for starting a timer to expire at a predetermined maximum time to wait; means counting the number of packets accumulated at the node; and means for dynamically adjusting the number of packets transmitted from the node in a train based on the number of packets accumulated at the node, an adjustable optimum train length, and the timer, wherein the dynamic adjusting means further comprises means, when the timer expires, for transmitting the accumulated packets in the train and setting the optimum train length to be the greater of the number of packets accumulated in the train and a minimum number of packets per train, wherein the minimum number of packets per train is a predetermined constant.
Claim 12
Dependent Claim
41 words
The apparatus of claim 9, wherein the dynamic adjusting means further comprises: means, when the timer expires, for transmitting the accumulated packets in the train and setting the optimum train length to be the number of packets accumulated in the train.
Claim 13
Dependent Claim
75 words
The apparatus of claim 9, wherein the dynamic adjusting means further comprises: means, when the number of packets accumulated equals the optimum train length and the timer has not expired, for canceling the timer, transmitting the accumulated packets, and saving the time that the timer would have expired had the timer not been canceled; and means, when a next packet arrives before the saved time, for incrementing the optimum train length by an increment constant.
Claim 14
Dependent Claim
11 words
The apparatus of claim 11, wherein the increment constant is one.
Claim 15
Dependent Claim
25 words
The apparatus of claim 9 wherein the adjustable optimum train length is initialized to be the maximum number of packets in a train minus one.
Claim 16
Dependent Claim
161 words
A program product for use in a computer system, the computer program product being adapted for packet training between nodes, the computer program product comprising: a recording medium; means, recorded on the recording medium, for starting a timer to expire at a predetermined maximum time to wait; means, recorded on the recording medium, for counting the number of packets accumulated at the node; and means, recorded on the recording medium, for dynamically adjusting the number of packets transmitted from the node in a train based on the number of packets accumulated at the node, an adjustable optimum train length, and the timers, wherein the dynamic adjusting means further comprises means, when the timer expires, for transmitting the accumulated packets in the train and setting the optimum train length to be the greater of the number of packets accumulated in the train and a minimum number of packets per train, wherein the minimum number of packets per train is a predetermined constant.
Claim 17
Dependent Claim
161 words
A program product for use in a computer system, the computer program product being adapted for packet training between nodes, the computer program product comprising: a recording medium; means, recorded on the recording medium, for starting a timer to expire at a predetermined maximum time to wait; means, recorded on the recording medium, for counting the number of packets accumulated at the node; and means, recorded on the recording medium, for dynamically adjusting the number of packets transmitted from the node in a train based on the number of packets accumulated at the node, an adjustable optimum train length, and the timers, wherein the dynamic adjusting means further comprises means, when the timer expires, for transmitting the accumulated packets in the train and setting the optimum train length to be the greater of the number of packets accumulated in the train and a minimum number of packets per train, wherein the minimum number of packets per train is a predetermined constant.
Claim 18
Dependent Claim
46 words
The apparatus of claim 14, wherein the dynamic adjusting means further comprises: means, recorded on the recording medium, when the timer expires, for transmitting the accumulated packets in the train and setting the optimum train length to be the number of packets accumulated in the train.
Claim 19
Dependent Claim
85 words
The apparatus of claim 14, wherein the dynamic adjusting means further comprises: means, recorded on the recording medium, when the number of packets accumulated equals the optimum train length and the timer has not expired, for canceling the timer, transmitting the accumulated packets, and saving the time that the timer would have expired had the timer not been canceled; and means, recorded on the recording medium, when a next packet arrives before the saved time, for incrementing the optimum train length by an increment constant.
Claim 20
Dependent Claim
11 words
The apparatus of claim 16, wherein the increment constant is one.
Claim 21
Dependent Claim
25 words
The apparatus of claim 14 wherein the adjustable optimum train length is initialized to be the maximum number of packets in a train minus one.
References Cited (Backward Citations)
US4517641A
Cited
US4736369A
Cited
US4805167A
Cited
US5199028A
Cited
US5127051A
Cited
US4979184A
Cited
US5179660A
Cited
US5040176A
Cited
US5063562A
Cited
US5285442A
Cited
US5166930A
Cited
US5400328A
Cited
US5260942A
Cited
US5537438A
Cited
US5606580A
Cited
JPH0766837A
Cited
US5402416A
Cited
US5566208A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-01-11 | 2002-07-13 | 2003-01-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-01-11 | 2006-07-13 | 2007-01-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-01-11 | 2010-07-13 | 2011-01-12 | $7700.00 | Window Closed / Lapsed |