Low complexity scheduler with generalized processor sharing GPS like scheduling performance

摘要

This invention relates to scheduling algorithms for use in telecommunications networks equipment. It provides a method and an apparatus for scheduling packets from a plurality of incoming flows onto an outgoing flow. Each incoming flow is assigned a credit value, which is constantly updated depending on the service rendered to the respective flow. The incoming flows are serviced according to the finishing time of their front end packets. At any given time, only flows, which are behind schedule are considered for service. The proposed scheduling method is of low complexity, which allows it to be implemented in very high bit-rate networking devices, such as routers with gigabit rates or higher.