Patent US2781827A successfully refreshed from Google Patents.
Patent US6023453A successfully refreshed from Google Patents.
US6023453A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method employing last occurrence and sliding window technique for determining minimum and maximum values
Assignee: Nokia Oyj
•
Filing: 1997-09-11
•
Granted: 2000-02-08
•
Expires: 2017-09-11
Abstract
Abstract A system and method for determining the minimum and/or maximum values from a number of sample parameter values utilizes a table of last occurrence (TOLO-table), together with a sliding window or filter, to greatly enhance the speed and efficiency when determining the minimum and/or maximum value from a number of sample parameter values that fall within the sliding window. The TOLO-table typically includes a parameter column for storing entries for each one of a limited number of discrete parameter values, and also includes a time stamp column which provides entries for storing time of receipt data associated with each parameter value defined in the parameter column. Alternatively, an order number column may be employed for storing number order entries corresponding to the order in which the parameter values are received. Every time a parameter value is received, the time stamp or order number entry associated with the parameter value is updated to the current time or order number. The sliding window may be defined on the basis of time or by a selected number of sample parameter values. The parameter values falling within the sliding window are scanned to determine the minimum and/or maximum of the applicable parameter values. A minimum/maximum determination methodology that employs a TOLO-table and sliding window may be used in a wide variety of applications, and is particularly useful in ATM network applications, particularly in implementing the cell discarding strategy of a network node.
Inventors
- 👤 Jussi Pekka Olavi Ruutu
- 👤 Matti Kalevi Kilkki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 05:24
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/27; H04L47/24; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5638; H04L2012/5646; H04L2012/5647; H04L2012/5648; H04L2012/5651
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
155 words
A method of adjusting a packet transmission rate depending on a minimum value or a maximum value of a plurality of packet acceptance levels produced at a network node of a communications network, comprising: storing a set of unique packet acceptance levels representative of all possible packet acceptance levels available at the network node; receiving packet acceptance levels from the network node at regular or irregular time intervals; storing a last occurrence identifier in response to a particular packet acceptance level of the set of unique packet acceptance levels being equivalent to a received packet acceptance level; defining a window spanning a range of last occurrence identifiers; identifying the minimum value or the maximum value of received packet acceptance levels within the window; and adjusting the packet transmission rate of packets transmitted to the communication network as a function of the minimum value or the maximum value of the packet acceptance levels within the window.
Claim 2
Independent Claim
155 words
A method of adjusting a packet transmission rate depending on a minimum value or a maximum value of a plurality of packet acceptance levels produced at a network node of a communications network, comprising: storing a set of unique packet acceptance levels representative of all possible packet acceptance levels available at the network node; receiving packet acceptance levels from the network node at regular or irregular time intervals; storing a last occurrence identifier in response to a particular packet acceptance level of the set of unique packet acceptance levels being equivalent to a received packet acceptance level; defining a window spanning a range of last occurrence identifiers; identifying the minimum value or the maximum value of received packet acceptance levels within the window; and adjusting the packet transmission rate of packets transmitted to the communication network as a function of the minimum value or the maximum value of the packet acceptance levels within the window.
Claim 3
Dependent Claim
46 words
The method of claim 1, wherein the last occurrence identifier comprises a time stamp identifier representative of a time at which the particular packet acceptance level was received at the network node, and wherein the size of the window is defined as a measure of time.
Claim 4
Dependent Claim
49 words
The method of claim 1, wherein the last occurrence identifier comprises an order number identifier representative of an order in which the particular packet acceptance level was received at the network node, and wherein the size of the window is defined in terms of an order of last occurrence.
Claim 5
Dependent Claim
23 words
The method of claim 1, wherein storing the last occurrence identifier occurs subsequent to receiving a packet acceptance level from the network node.
Claim 6
Dependent Claim
34 words
The method of claim 1, wherein determining the minimum value or the maximum value occurs contemporaneously with respect to receiving the packet acceptance levels from the network node and storing the last occurrence identifiers.
Claim 7
Dependent Claim
22 words
The method of claim 1, wherein defining the window comprises modifying a size of the window from a previously defined window size.
Claim 8
Dependent Claim
29 words
The method of claim 1, wherein the packet acceptance levels comprise any of integer, real, or alphabetic values indicative of an acceptance level of packets in the communications network.
Claim 9
Independent Claim
194 words
An apparatus for adjusting a packet transmission rate depending on a minimum value or a maximum value of a plurality of packet acceptance levels produced at a network node of a communications network, comprising: a memory configured to store a table of unique packet acceptance levels representative of all possible packet acceptance levels produceable by the network node and a last occurrence identifier associated with each of the unique packet acceptance levels; an input device for receiving packet acceptance levels from the node at regular or irregular time intervals; and a processor configured and arranged to store the last occurrence identifiers in the memory in response to determining equivalency between packet acceptance levels received by the input device and associated unique packet acceptance levels of the table, to compute the minimum value or the maximum value of received packet acceptance levels having associated last occurrence identifiers defined within a window having a size associated with a range of last occurrence identifiers, and to adjust the packet transmission rate of packets transmitted to the communication network as a function of the minimum value or the maximum value of received packet acceptance levels within the window.
Claim 10
Independent Claim
194 words
An apparatus for adjusting a packet transmission rate depending on a minimum value or a maximum value of a plurality of packet acceptance levels produced at a network node of a communications network, comprising: a memory configured to store a table of unique packet acceptance levels representative of all possible packet acceptance levels produceable by the network node and a last occurrence identifier associated with each of the unique packet acceptance levels; an input device for receiving packet acceptance levels from the node at regular or irregular time intervals; and a processor configured and arranged to store the last occurrence identifiers in the memory in response to determining equivalency between packet acceptance levels received by the input device and associated unique packet acceptance levels of the table, to compute the minimum value or the maximum value of received packet acceptance levels having associated last occurrence identifiers defined within a window having a size associated with a range of last occurrence identifiers, and to adjust the packet transmission rate of packets transmitted to the communication network as a function of the minimum value or the maximum value of received packet acceptance levels within the window.
Claim 11
Dependent Claim
32 words
The apparatus of claim 8, wherein the processor is further configured and arranged to store the last occurrence identifier after the input device receives a packet acceptance level from the network node.
Claim 12
Dependent Claim
40 words
The apparatus of claim 8, wherein the processor is further configured and arranged to compute the minimum value or the maximum value contemporaneously with respect to receiving the packet acceptance levels from the node and storing the last occurrence identifiers.
Claim 13
Dependent Claim
32 words
The method of claim 8, wherein the processor is further configured and arranged to modify the size of the window from a previously defined window size in response to a modification instruction.
References Cited (Backward Citations)
US5400329A
Cited
US5857147A
Cited
US5889761A
Cited
US5754754A
Cited
US5864536A
Cited
US5909443A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-02-07 | 2003-08-09 | 2004-02-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-02-07 | 2007-08-09 | 2008-02-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-02-07 | 2011-08-09 | 2012-02-08 | $7700.00 | Window Closed / Lapsed |