| 摘要 |
<p>PROBLEM TO BE SOLVED: To allow a method to cope with a real time application that is sensitive to a transfer delay of a packet. SOLUTION: A priority index is calculated based on weights (service transfer speeds) w1 -wN assigned fixedly in advance and a newest queue length of each flow as a value denoting newest priority of scheduling with respect to each flow at start of a frame and stores the index to a priority index table 11 and scheduling of each flow is conducted by sequentially referencing the table 11.</p> |
