| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a packet scheduler based on a weighted round robin rule which enables a high speed operation even if the number of queues to support is increased. <P>SOLUTION: A packet transmitter has a scheduling means. When a packet stored in each queue arrives at the head of the queue, this means compares an identifier of the latest queue to which packets are transmitted with the identifier of the queue, and if the service order of the queue is later than that of the latest queue, a value of the service number of times for the latest queue is set as a value of the next service number of times for the queue, or if the service order of the queue is earlier than that of the latest queue, the value of the next service number of times for the queue is set as a value of the service number of times for the latest queue + 1. It then determines the value of the service number of times enough to transmit the packets based on the next service number of times for the queue and a weighting value read from the memory. <P>COPYRIGHT: (C)2004,JPO</p> |
