Achieving Fair Service with a Layered Scheduling Scheme for CICQ Switches
Hongchao Hu, Peng Yi, Shuqiao Chen, Julong Lan · 2011
Providing performance guarantees for traffic flows has become an important measurement for todays routing and switching systems. Aiming at meeting this requirement, the feasibility of implementing flow scheduling is discuss thoroughly. Then, based on the discussion, it comes up with a Layered and Hybrid Fair scheduling (LHFS) scheme which is hierarchical and hybrid for CICQ (Combined Input and Cross-point Buffered) switches. With LHFS, each input and output port can schedule variable length packets independently with a complexity of O(1). Theoretical analysis show that LHFS can provide delay and fair service guarantees. Finally, we implement LHFS in SPES (Switch Performance Evaluation System) to verify the analytical results.