A New Frame-Based Packet Scheduling for Variable-Length Packet Switched Networks -Architecture and Performance Analvsis

摘要

A new frame-based packet scheduling discipline designed for variable length packets is discussed. This algorithm extends a weighted round robin scheduling so that it can serve each queue fairly even if the length of packets varies. It can also handle burstiness by one of its important properties which we call ``elasticity''. In this paper, an overview of the proposed al- gorithm is described, and then it is systematically analyzed in terms of several important performance parameters through- put, work complexity and elasticity. The proposed algorithm is evaluated by simulation and compared with the normal weighted round robin with regard to throughput and delay performance, thereby validating fairness of the algorithm with various types of traffic. Focusing on the complexity of the scheduling algorithm, we further propose and evaluate an improved version of the pro- posed algorithm, which provides the same properties with lower work complexity.