Sciweavers

Share
INFOCOM
2005
IEEE

Practical algorithms for performance guarantees in buffered crossbars

8 years 9 months ago
Practical algorithms for performance guarantees in buffered crossbars
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input and output queueing (CIOQ), using crossbar switching fabrics. But such routers require impractically complex scheduling algorithms to provide the desired guarantees. We explore how a buffered crossbar — a crossbar switch with a packet buffer at each crosspoint — can provide guaranteed performance (throughput, rate, and delay), with less complex, practical scheduling algorithms. We describe scheduling algorithms that operate in parallel on each input and output port, and hence are scalable. With these algorithms, buffered crossbars with a speedup of two can provide 100% throughput, rate, and delay guarantees. I. BACKGROUND Network operators want high capacity routers that give guaranteed performance. First, they prefer routers that guarantee throughput so they can maximize the utilization of their expensi...
Shang-Tse Chuang, Sundar Iyer, Nick McKeown
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where INFOCOM
Authors Shang-Tse Chuang, Sundar Iyer, Nick McKeown
Comments (0)
books