Abstract
In recent years, we have seen a steady increase of bit rates in networks like Internet. However, memory access speeds can no longer satisfy the requirements of traditional output-queued (OQ) switches for such high line rates. By choosing an appropriate scheduling algorithm, combined input/output queued (CIOQ) switches can provide the same behavior as pure OQ switches with a moderate speedup. This paper presents an algorithm that can mimic exact round robin (RR) behavior of an OQ switch in a CIOQ architecture with a speedup of two. While previous approaches on CIOQ switches with low speedup mainly focused on high throughput, the RR scheduling in this architecture can also provide fairness and service differentiation
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
