Apparatus to achieve quality of service (QoS) without requiring fabric speedup

US9369397B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-9369397-B1
Application numberUS-201414332564-A
CountryUS
Kind codeB1
Filing dateJul 16, 2014
Priority dateJul 16, 2014
Publication dateJun 14, 2016
Grant dateJun 14, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A device may store a credit value for each of multiple output components. The device may receive packets from a network device via an input component. The device may cause the input component to queue the packets. The device may selectively dequeue a packet from the input component, to be sent to an output component, based on whether the credit value for the output component satisfies a credit threshold. The device may send the packet to the output component based on a destination of the packet when the packet is dequeued from the input component. The device may determine a size of the packet after the packet is dequeued. The device may update the credit value for the output component based on the size of the packet. The device may output the packet to another network device via the output component.

First claim

Opening claim text (preview).

What is claimed is: 1. A device, comprising: one or more processors to: store a credit value for each of a plurality of output components; receive packets from a network device via an input component; cause the input component to queue the packets, selectively dequeue a packet from the input component, to be sent to an output component, based on whether the credit value for the output component satisfies a credit threshold, the packets including the packet, and the plurality of output components including the output component; send the packet to the output component based on a destination of the packet when the packet is dequeued from the input component; determine a size of the packet after the packet is dequeued; update the credit value for the output component based on the size of the packet; and output the packet to another network device via the output component. 2. The device of claim 1 , where the one or more processors are further to: receive a dequeue response after the packet has been sent to the output component, the dequeue response indicating the size of the packet; and where the one or more processors, when determining the size of the packet, are further to: determine the size of the packet based on the dequeue response. 3. The device of claim 1 , where the one or more processors, when selectively dequeuing the packet, are further to: dequeue the packet based on the credit value for the output component satisfying the credit threshold. 4. The device of claim 1 , where the one or more processors, when selectively dequeuing the packet, are further to: prevent scheduling a dequeue of the packet based on the credit value for the output component failing to satisfy the credit threshold. 5. The device of claim 1 , where the one or more processors are further to: modify the packet after dequeuing the packet; determine a change in size of the packet due to the modification; update the credit value for the output component based on the change in size of the packet due to the modification. 6. The device of claim 5 , where the one or more processors, when modifying the packet, are further to: drop, add, or change a header of the packet. 7. The device of claim 5 , where the one or more processors, when updating the credit value based on the change in the size of the packet, are further to: increase the credit value if the packet is smaller due to the modification; and decrease the credit value if the packet is larger due to the modification. 8. A computer-readable medium storing instructions, the instructions comprising: one or more instructions that, when executed by one or more processors, cause the one or more processors to: store a credit value for each of a plurality of output components, the credit value being based on weights assigned to the plurality of output components; receive packets from a first device via an input component; cause the input component to store the packets in one or more queues, selectively dequeue a packet from the input component, to be sent to an output component, based on whether the credit value for the output component satisfies a credit threshold, the packets including the packet, the plurality of output components including the output component; send the packet to the output component based on a destination of the packet when the packet is dequeued; determine a size of the packet; update the credit value for the output component based on the size of the packet; and output the packet to a second device via the output component. 9. The computer-readable medium of claim 8 , where the one or more instructions, when executed by the one or more processors, further cause the one or more processors to: assign the weights to the plurality of output components based on data rates of the plurality of output components. 10. The computer-readable medium of claim 8 , where the one or more instructions, when executed by the one or more processors, further cause the one or more processors to: store a request value for each particular output component of the plurality of output components, the request value indicating whether there any pending dequeue requests for the particular output component; and where the one or more instructions, when selectively dequeuing the packet, further cause the one or more processors to: selectively dequeue the packet from the input component based on whether the request value for the output component satisfies a request threshold and based on whether the credit value for the output component satisfies the credit threshold. 11. The computer-readable medium of claim 10 , where the one or more instructions, when executed by the one or more processors, further cause the one or more processors to: decrement the request value based on dequeuing the packet. 12. The computer-readable medium of claim 10 , where the one or more instructions, when executed by the one or more processors, further cause the one or more processors to: receive a dequeue response after the packet has been dequeued, the dequeue response indicating whether an additional dequeue request is pending for the output component; and update the request value based on the dequeue response. 13. The computer-readable medium of claim 10 , where the one or more instructions, when executed by the one or more processors, further cause the one or more processors to: determine that none of the plurality of output components has the credit value that satisfies the credit threshold and the request value that satisfies the request threshold; and replenish the credit value for each of the plurality of output components based on determining that none of the plurality of output components has the credit value that satisfies the credit threshold and the request value that satisfies the request threshold. 14. The computer-readable medium of claim 8 , where the one or more instructions, that cause the one or more processors to selectively dequeue the packet, further cause the one or more processors to: prevent dequeuing of the packet while the credit value fails to satisfy the credit threshold. 15. A method, comprising: storing, by a device, a credit value for each of a plurality of output components, the credit value being based on weights assigned to the plurality of output components; receiving, by the device, packets from a first device, via a plurality of input components, to be output to a second device; causing, by the device, the plurality of input components to store the packets in one or more queues included in the plurality of input components, selectively dequeuing, by the device, a packet from a particular input component, to be sent to an output component, based on whether the credit value for the output component satisfies a credit threshold, the packets including the packet, the plurality of output components including the output component; sending, by the device, the packet to the output component to be output from the device when the packet is dequeued; determining, by the device, a size of the packet after the packet has been dequeued; updating, by the device, the credit value for the output component based on the size of the packet; and outputting, by the device, the packet to the second device via the output component. 16. The method of claim 15 , further comprising: determining that none of the plurality of output components has the credit value that satisfies the credit threshold; and updating the credit value for each of the plurality of output components based on dete

Assignees

Inventors

Classifications

  • in the downlink direction of a wireless link, i.e. towards a terminal · CPC title

  • H04L47/527Primary

    Quantum based scheduling, e.g. credit or deficit based scheduling or token bank · CPC title

  • by determining packet size, e.g. maximum transfer unit [MTU] · CPC title

  • Dynamic adaptation of the packet size · CPC title

  • Header conversion, routing tables or routing tags · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9369397B1 cover?
A device may store a credit value for each of multiple output components. The device may receive packets from a network device via an input component. The device may cause the input component to queue the packets. The device may selectively dequeue a packet from the input component, to be sent to an output component, based on whether the credit value for the output component satisfies a credit …
Who is the assignee on this patent?
Juniper Networks Inc
What technology area does this patent fall under?
Primary CPC classification H04L47/527. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jun 14 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).