| 摘要 |
<p>PROBLEM TO BE SOLVED: To improve the fairness performance by allowing a packet queue to be selected in an interleaving way to avoid consecutive selection of packets of a same packet queue thereby decreasing a burst property of a time scale smaller than a round time. SOLUTION: As scheduling queues 44 to store scheduling information, a different queue is prepared for a packet queue 20 available of transmission at present. Thus, let a period when scheduling information is outputted from one queue 44 be a round time, the scheduling device is obtained, that uses weighting fairness scheduling algorithm equal to a conventional one based on the round time. The calculated value of scheduling is constant independently of number of flows. Moreover, each scheduling information is used for an output of a head packet from a corresponding packet queue, then it is avoided that a packet of a same flow is continuously selected till decrementing the counter is disable or the packet queue gets idle.</p> |
