Importance

Loading Importance Indicators...

Abstract

A scheduling apparatus and a scheduling method are capable of reading data elements from a plurality of queues in such a form that past hysteresis reflects therein. The scheduling apparatus comprises a queue hysteresis table for storing a value e.sub.-- count obtained subtracting the number of data elements (packets in a router) actually fetched out of the queue, from the number of times with which this queue becomes a processing target with respect to each queue. The apparatus also comprises a scheduling unit for cyclically designating each queue as a processing target, adding '1' to e.sub.-- count, corresponding to that queue, in the queue hysteresis table if no data elements exist in the queue designated as the processing target, consecutively fetching, from the processing target queue, the data elements the number of which corresponds to a value of e.sub.-- count corresponding to the queue if the data elements exist in the processing target queue, and decrementing the value of e.sub.-- count by the number of fetched data elements.

Loading the Abstract Image...

First Claim