Back to results
US 8,948,011 B2Granted
Pseudo-relative mode WRED/tail drop mechanism
AssigneeJuniper Networks, Inc.
InventorsJoe Lamb, Benjamin Findlen
Life of this patent
Estimating the term…
Abstract
A buffer memory can be configured to temporarily store data in a number of queues. A processor can be configured to measure a fullness of the buffer memory. The processor can be configured to adjust thresholds and drop profiles based on a measured global resource usage for a weighted random early detection (WRED) technique with less resources than a conventional.
Claims20
A method comprising:
- storing, by one or more processors of a network device, a plurality of drop probability values,
- the plurality of drop probability values being stored at a corresponding plurality of memory locations, and
- the plurality of drop probability values including:
- a minimum drop probability value associated with a fill level of a queue being less than a first threshold,
- a maximum drop probability value associated with the fill level of the queue being greater than a second threshold,
- the second threshold being greater than the first threshold, and
- a plurality of intermediate drop probability values associated with the fill level of the queue being between the first threshold and the second threshold,
- the plurality of intermediate drop probability values being determined as a function of the fill level of the queue;
- storing, by the one or more processors, a data unit to the queue;
- determining, by the one or more processors, the fill level associated with the queue based on storing the data unit;
- identifying, by the one or more processors, a particular memory location of the corresponding plurality of memory locations based on the fill level associated with the queue;
- acquiring, by the one or more processors, a particular drop probability value, of the plurality of drop probability values, stored at the particular memory location,
- the particular drop probability value being the minimum drop probability value, the maximum drop probability value, or one of the plurality of intermediate drop probability values;
- and
- processing, by the one or more processors, the data unit based on the particular drop probability value.
12 more elements
A system comprising:
- a memory;
- and
- a processor to:
- store a plurality of drop probability values at a corresponding plurality of memory locations in the memory,
- the corresponding plurality of memory locations being associated with, respectively, a plurality of fill level ranges, and
- the plurality of drop probability values including:
- a minimum drop probability value associated with a fill level of a queue being less than a first threshold,
- a maximum drop probability value associated with the fill level of the queue being greater than a second threshold,
- the second threshold being greater than the first threshold, and
- a plurality of intermediate drop probability values associated with the fill level of the queue being between the first threshold and the second threshold,
- the plurality of intermediate drop probability values being determined as a function of the fill level of the queue,
- store a data unit to the queue,
- determine the fill level associated with the queue when the data unit is stored,
- identify a particular fill level range, of the plurality of fill level ranges, that includes the fill level associated with the queue,
- identify, based on the particular fill level range, a particular memory location of the corresponding plurality of memory locations,
- acquire a particular drop probability value, of the plurality of intermediate drop probability values, stored at the particular memory location and that corresponds to the fill level, and
- determine whether to drop the data unit based on the particular drop probability value.
14 more elements
A non-transitory memory device to store instructions, the instructions comprising:
- one or more instructions that, when executed by a processor associated with a network device, cause the processor to:
- store a plurality of drop probability values at a respective plurality of memory locations,
- the plurality of drop probability values including:
- a minimum drop probability value associated with a fill level associated with a queue being less than a first threshold,
- a maximum drop probability value associated with the fill level being greater than a second threshold,
- the second threshold being greater than the first threshold, and
- a plurality of intermediate drop probability values associated with the fill level being between the first threshold and the second threshold,
- the plurality of intermediate drop probability values being determined as a function of the fill level,
- store a data unit in the queue,
- determine the fill level based on storing the data unit,
- identify, based on the fill level a particular memory location of the respective plurality of memory locations,
- acquire a particular drop probability value, of the plurality of intermediate drop probability values, stored at the particular memory location, and
- process the data unit from the queue based on the particular drop probability value.
10 more elements
Dependencies are inferred from the claim text.