Hierarchical network traffic scheduling using dynamic node weighting
AssigneeJuniper Networks, Inc.
InventorCraig R. Frink
Life of this patent
Estimating the term…
Loading patent…
AssigneeJuniper Networks, Inc.
InventorCraig R. Frink
Estimating the term…
The techniques may provide a hierarchical scheduler for dynamically computing rate credits when a plurality of queues share an intermediate node. For example, the hierarchical scheduler may group respective sets of queues with respective virtual subscribers to be associated with a shared intermediate node. The weight used by the shared intermediate node may be computed as a function of the number of virtual subscriber child members of the shared intermediate node and their respective weights to correctly proportion the services to the queues. The techniques may also provide a hierarchical scheduler for dynamically computing rate credits allocated to queues associated with a shared intermediate node. For example, the number of rate credits allocated to a queue for a virtual subscriber is based on the product of the virtual subscriber weight and a queue weighted fraction of the queues for the virtual subscriber.
A method comprising:
A network device comprising:
A non-transitory computer-readable storage medium comprising instructions, that when executed by a processor, cause the processor to:
Dependencies are inferred from the claim text.