| 摘要 |
PROBLEM TO BE SOLVED: To read an information element in a form of reflecting a past history by fetching the information element whose number corresponds to the count at which the information element was not successively fetched from a queue as a processing object. SOLUTION: A scheduling part 15 sets data about the use history of a queue i, i.e., the value which subtracts a packet number which is actually fetched from the queue i from a count at which the queue i becomes an processing object in an e- counti . The part 15 then controls a packet read number from the queue i so that the e- counti may approach '0'. That is, it controls the packet read number from each queue so that a processed number of a packet in every sending station may be uniformed. Therefore, packet sending can be performed without damaging burst activity because a packet whose number corresponds to a value of counted e count before a first packet is received is successively sent according to this router 10.
|
