A Scalable Switch for Service Guarantees
- 11 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 93-99
Abstract
Operators need routers to provide service guarantees such as guaranteed flow rates and fairness among flows, so as to support real-time traffic and traffic engineering. However, current centralized input-queued router architectures cannot scale to fast line rates while providing these service guarantees. On the other hand, while load-balanced switch architectures that rely on two identical stages of fixed configuration switches appear to be an effective way to scale Internet routers to very high capacities, there is currently no practical and scalable solution for providing service guarantees in these architectures. In this paper, we introduce the interleaved matching switch (IMS) architecture, which relies on a novel approach to provide service guarantees using load-balanced switches. The approach is based on emulating a Birkhoff-von Neumann switch with a load-balanced switch architecture and is applicable to any admissible traffic. In cases where: fixed frame sizes are applicable, we also present an efficient frame-based decomposition method. More generally, we show that the IMS architecture can be used to emulate any input queued or combined input-output queued switch.Keywords
This publication has 11 references indexed in Scilit:
- Stratified round Robin2003
- Scaling internet routers using optics2003
- On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann2003
- Fast and scalable priority queue architecture for high-speed network switches2002
- Load balanced Birkhoff–von Neumann switches, part II: multi-stage bufferingComputer Communications, 2002
- Load balanced Birkhoff–von Neumann switches, part I: one-stage bufferingComputer Communications, 2002
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Switching and Traffic Theory for Integrated Broadband Networks1990
- Analysis and simulation of a fair queueing algorithm1989