Efficient Scheduling for SDMG CIOQ Switches

ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CIOQ switch with an expansion factor 2 can achieve 100% throughput assuming input line arrivals satisfy the strong law of large numbers (SLLN) and no input/output line is oversubscribed. We further propose an efficient and starvation-free maximal size k-matching scheduling algorithm, kFRR, for the SDMG CIOQ switch. Simulation results show that kFRR achieves 100% throughput for SDMG CIOQ switches with an expansion factor 2 under two SLLN traffic models, uniform traffic and polarized traffic, confirming our analysis. key words: CIOQ switch, cell scheduling, maximal size matching, speedup.

• Type: Journal
• Year: 2006
• Where: IEICET
• Authors: Mei Yang, Si-Qing Zheng
• Keywords: Expansion Factor, IEICET 2006, Maximal Size, SDMG CIOQ