For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Extension to Weighted Round Robin Packet Scheduling for Variable-length Packet Networks
Hidetoshi YOKOTA Mattias FORSBERG Tohru ASAMI
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1999/03/25
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computer Networks
packet scheduling, weighted round robin,
Full Text: PDF>>
An extended version of weighted round robin scheduling algorithm for variable length packets is discussed. This can serve each flow fairly even if the length of packets varies. Further, an adaptive scheduling algorithm for bursty traffic is added to better treat multimedia sources. In this paper, an overview of the algorithm is described. Subsequently the throughput, latency, work complexity and elasticity for the algorithm are systematically defined and analyzed. These results show advantages of the algorithm compared with a normal or packet-based weighted round robin algorithm.