Patent · US Expired

Scheduling apparatus and scheduling method

US5920568A · kind A · utility

19Cited by
3References
10Claims
0Family size

Assignee

Inventors

Key dates

Filing dateJan 29, 1997
Grant dateJul 6, 1999
Priority date
Expiry dateJan 29, 2017

Classification

  • Technology area (CPC H)Electricity
  • CPC primaryH04L47/50
  • WIPO fieldDigital communication
  • WIPO sectorElectrical engineering

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.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.