Control of preemption-based beat-down effect
AssigneeCisco Technology, Inc.
InventorsAnna Charny, Francois Le Faucheur
Life of this patent
Estimating the term…
Abstract
In one embodiment, a node determines a ratio of traffic that is to be marked at an output. The node also determines if an input feeding the output has less traffic marked than is to be marked at the output, and marks unmarked traffic of that particular input corresponding to a ratio substantially equal to the difference between what is needed at the output and what is marked at the input. Also, in one embodiment, a node may determine a fair share of an output for unconstrained inputs (e.g., a preemption threshold divided among the inputs, taking into consideration inputs that use less than their fair share), and mark traffic accordingly.
Claims18
A method, comprising:
- determining a fair share of an output for one or more inputs that feed the output based on an overall preemption threshold of the output divided by a number of the inputs;
- determining a rate of unmarked traffic that is received on each of the inputs;
- determining which inputs have a rate of unmarked traffic that is less than or equal to the fair share for the output (“constrained inputs”);
- determining which inputs have a rate of unmarked traffic that is greater than the fair share for the output (“unconstrained inputs”);
- determining remaining available bandwidth for all unconstrained inputs by subtracting a combined rate of unmarked traffic for each constrained input from the overall preemption threshold;
- determining a fair share use of the output for the unconstrained inputs (“unconstrained fair share”) based on the remaining available bandwidth divided by a number of the remaining unconstrained inputs;
- and
- marking, by a node of a computer network that includes the output, unmarked traffic of each unconstrained input at a rate substantially equal to the rate of unmarked traffic greater than the unconstrained fair share.
A node, comprising:
- one or more input interfaces configured to receive traffic from one or more input flows;
- one or more output interfaces;
- one or more processors configured to execute one or more processes;
- and
- a memory configured to store a flow control process executable by each processor, the flow control process when executed operable to:
- i) determine a fair share of an output for one or more inputs that feed the output based on an overall preemption threshold of the output divided by a number of the inputs;
- ii) determine a rate of unmarked traffic that is received on each of the inputs;
- iii) determine which inputs have a rate of unmarked traffic that is less than or equal to the fair share for the output (“constrained inputs”);
- iv) determine which inputs have a rate of unmarked traffic that is greater than the fair share for the output (“unconstrained inputs”);
- v) determine remaining available bandwidth for all unconstrained inputs by subtracting a combined rate of unmarked traffic for each constrained input from the overall preemption threshold;
- vi) determine a fair share use of the output for the unconstrained inputs (“unconstrained fair share”) based on the remaining available bandwidth divided by a number of the remaining unconstrained inputs;
- and vii) mark unmarked traffic of each unconstrained input at a rate substantially equal to the rate of unmarked traffic greater than the unconstrained fair share.
A node, comprising:
- one or more input interfaces configured to receive traffic from one or more input flows;
- one or more output interfaces;
- means for determining a fair share of an output interface for one or more input flows that feed the output interface based on an overall preemption threshold of the output interface divided by a number of the input flows;
- means for determining a rate of unmarked traffic that is received on each of the input flows;
- means for determining which input flows have a rate of unmarked traffic that is less than or equal to the fair share for the output interface;
- means for determining which input flows have a rate of unmarked traffic that is greater than the fair share for the output interface (“unconstrained input flows”);
- means for determining remaining available bandwidth for unconstrained input flows by subtracting a combined rate of unmarked traffic for each constrained input flow from the overall preemption threshold;
- means for determining a fair share use of the output interface for the unconstrained input flows (“unconstrained fair share”) based on the remaining available bandwidth divided by a number of the remaining unconstrained input flows;
- and
- means for marking unmarked traffic of each unconstrained input flow at a rate substantially equal to the rate of unmarked traffic greater than the unconstrained fair share.
Dependencies are inferred from the claim text.