Quality of service scheduling for home mesh network
First Claim
Patent Images
1. A method comprising:
- visiting a plurality of buffers in a variable round robin manner, the buffers storing packets having packet types associated with priority levels and having buffer types according to the packet types, the packets being generated for transmission from an application according to a network protocol in a multi-hop mesh network having a local node and a remote node, the packet types corresponding to traffic in the local and remote nodes, the variable round robin manner providing a quantum time that is variable depending on status of the buffers and the priority levels; and
dequeuing the plurality of buffers according to the buffer types, wherein dequeuing of a data buffer of the plurality of buffers comprises retrieving packets from a buffer j using an amount calculated by
Qj=min{Pj,(T*Wj*Sj)/(□
k=0N(Wk*Sk)}wherein Pj is number of packets in the buffer j, Wj is a weight value assigned to the buffer j according to priority level of the buffer j, T is size of a pre-defined bucket, and Sk=0 if Pk=0 and Sk=1 otherwise.
1 Assignment
0 Petitions
Accused Products
Abstract
An embodiment is a technique to perform packet scheduling for QoS. A plurality of buffers is visited in a variable round robin manner. The buffers store packets having packet types associated with priority levels and having buffer types according to the packet types. The packets are generated for transmission from an application according to a network protocol in a multi-hop mesh network having a local node and a remote node. The buffers are dequeued according to the buffer types and using an amount dynamically weighted by the priority levels associated with the buffer types.
62 Citations
27 Claims
-
1. A method comprising:
-
visiting a plurality of buffers in a variable round robin manner, the buffers storing packets having packet types associated with priority levels and having buffer types according to the packet types, the packets being generated for transmission from an application according to a network protocol in a multi-hop mesh network having a local node and a remote node, the packet types corresponding to traffic in the local and remote nodes, the variable round robin manner providing a quantum time that is variable depending on status of the buffers and the priority levels; and dequeuing the plurality of buffers according to the buffer types, wherein dequeuing of a data buffer of the plurality of buffers comprises retrieving packets from a buffer j using an amount calculated by
Qj=min{Pj,(T*Wj*Sj)/(□
k=0N(Wk*Sk)}wherein Pj is number of packets in the buffer j, Wj is a weight value assigned to the buffer j according to priority level of the buffer j, T is size of a pre-defined bucket, and Sk=0 if Pk=0 and Sk=1 otherwise. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. An article of manufacture comprising:
-
a machine-accessible storage medium including data that, when accessed by a machine, cause the machine to perform operations comprising; visiting a plurality of buffers in a variable round robin manner, the buffers storing packets having packet types associated with priority levels and having buffer types according to the packet types, the packets being generated for transmission from an application according to a network protocol in a multi-hop mesh network having a local node and a remote node, the packet types corresponding to traffic in the local and remote nodes, the variable round robin manner providing a quantum time that is variable depending on status of the buffers and the priority levels; and dequeuing the plurality of buffers according to the buffer types, the dequeuing of the plurality of buffers includes dequeuing a data buffer by retrieving packets from a buffer j using an amount calculated by
Qj=min{Pj,(T*Wj*Sj)/(□
k=0N(Wk*Sk)}wherein Pj is number of packets in the buffer j, Wj is a weight value assigned to the buffer j according to priority level of the buffer j, T is size of a pre-defined bucket, and Sk=0 if Pk=0 and Sk=1 otherwise. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An apparatus comprising:
-
a switching module to switch between a plurality of buffers in a variable round robin manner, the buffers storing packets having packet types associated with priority levels and having buffer types according to the packet types, the packets being generated for transmission from an application according to a network protocol in a multi-hop mesh network having a local node and a remote node, the packet types corresponding to traffic in the local and remote nodes, the variable round robin manner providing a quantum time that is variable depending on status of the buffers and the priority levels; and a dequeuer coupled to the switching module to retrieve packets from a buffer j using an amount calculated by
Qj=min{Pj,(T*Wj*Sj)/(□
k=0N(Wk*Sk)}wherein Pj is number of packets in the buffer j, Wj is a weight value assigned to the buffer j according to priority level of the buffer j, T is size of a pre-defined bucket, and Sk=0 if Pk=0 and Sk=1 otherwise. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27)
-
Specification