• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.1-8
• /
• 2003

Scheduling technology is one of the most important elements required to support the Quality of service (QoS) in the Internet and a lot of scheduling algorithms have been developed. However, most of these algorithms ire not flexible to distribute the excess bandwidth. In order to provide flexibility for distributing the excess bandwidth, we proposed excess bandwidth fair queueing (EBFQ) algorithm with relatively low complexity. In this paper, we propose the new extension to this EBFQ algorithm for the hierarchical fair queueing system. This extension can be naturally applied to the existing hierarchical algorithm and simultaneously provide the same level of fairness. Through the simulation and analysis, we verify it.