Loading [a11y]/accessibility-menu.js
Active flow identifiers for scalable, QoS scheduling in 10-Gbps network processors | IEEE Conference Publication | IEEE Xplore

Active flow identifiers for scalable, QoS scheduling in 10-Gbps network processors


Abstract:

Most of the scheduling schemes proposed in the literature require complex calculations per flow and thus, their implementations are expensive, especially in terms of sili...Show More

Abstract:

Most of the scheduling schemes proposed in the literature require complex calculations per flow and thus, their implementations are expensive, especially in terms of silicon area. Additionally, when these algorithms work at gigabit rates, they cannot support large numbers of network flows each with diverse rate requirements. Although nowadays it is technologically viable to implement such mechanisms that can provide QoS in hardware, this can be accomplished only if lower rates (couple of hundreds Mbits/sec at most) or small number of flows (few hundreds) are serviced by the scheduling mechanism. This paper introduces a novel scheduling scheme which can handle thousands of traffic flows, each with its own QoS parameters, at an aggregate rate of 10 Gbps. The hardware implementation of this algorithm requires only 17500 standard CMOS gates. This novel scheme is also very flexible and thus it can very easily be integrated in a large number of different high-performance networking Systems-on-Chip (SoCs).
Date of Conference: 25-28 May 2003
Date Added to IEEE Xplore: 25 June 2003
Print ISBN:0-7803-7761-3
Conference Location: Bangkok, Thailand
References is not available for this document.

1. INTRODUCTION

High-speed schedulers are an essential component of modem data networks. They are evolving into highly complex systems and are relying heavily on sophisticated traffic management mechanisms in order to achieve high resource utilization and support a bundle of services (i.e. best effort data delivery, guaranteed bandwidth services, voice, video. VPNs, and other qualityofservice (QoS) sensitive traffic). Scheduling is a function. related to the regulation of packet transmission times as a mean to provide prioritization and limited delay and jitter for QoS sensitive traffic

originally implemented in data switches but lately extended to all intermediate network nodes and processing elements

. It is therefore essential to provide scalable, flexible and cost-effective scheduler architectures to ensure optimum network performance for today's and tomorrow's switches and routers. In spite of the underlying CMOS technology continuing its progress to smaller geometries and higher speeds, novel architectural approaches are still needed in order to handle increasing requirements for QoS at multi-gigabit rates.

Select All
1.
G. Kornaros, C. Kozyrakis. P. Vatsolaki & M. Katevenis. “Pipelined Multi-queue Management in a VLSI ATM Switch Chip with Credit-based FLow-control ” 17th Conference on Advanced Research in VLSI, Ann Arbor, U.S.A, Sep 1997.
2.
P. Gupta & N. McKeown. “Designing and Implementing a Fast Crossbar Scheduler ” IEEE Micro. pp. 20–28, Jan 1999.
3.
A. loannou and M. Katevenis. “Pipelined Heap (priority queue) Management for Advanced Scheduling in High Speed Networks ” IEEE Int. Conf. on Communications (lCC2001), Helsinki, Finland, Jun 2001.
4.
J. Bennett D. Stephens & H. Zhang. “High Speed, Scalable, and Accurate Implementation of Packet Fair Queueing Algorithms in Atm Networks ” IEEE ICNP'97, Atlanta, USA, Oct 1997.
5.
G. Kornaros “ATLAS I: Implementing a Single-Chip Atm Switch with Backpressure ” IEEE Micro, pp. 30–41. Jan 1999.
6.
T. Chaney, J. Fingerhut, M. Flucke and J. Turner. “Design of a gigabit ATM switch ” INFOCOM, Kobe, Japan, Apr 1997.
7.
R. Krishnamurthy “Architecture and Hardware for Scheduling Gigabit Packet Streams ” 10th Hot Interconnects, Stanford, California, Aug 2002.

Contact IEEE to Subscribe

References

References is not available for this document.