Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches

Emerging broad-band switches must accommodate the diverse traffic parameters and quality-of-service requirements of voice, data, and video applications. End-to-end performance guarantees depend on connections complying with traffic contracts as their cells travel through the network. This paper presents a leaky-bucket shaper architecture that scales to a large number of connections with diverse burstiness and bandwidth parameters. In contrast to existing designs, the proposed architecture arbitrates fairly between connections with conforming cells by carefully integrating leaky-bucket traffic shaping with rate-based scheduling algorithms. Through a careful combination of per-connection queueing and approximate sorting, the shaper performs a small, bounded number of operations in response to each arrival and departure, independent of the number of connections and cells. When the shaper must handle a wide range of rate parameters, a hierarchical arbitration scheme can reduce the implementation overheads and further limit interference between competing connections. Through simulation experiments, we demonstrate that the architecture limits cell-shaping delay and traffic distortions, even in periods of heavy congestion. The efficient combination of traffic shaping and link scheduling results in an effective architecture for managing buffer and bandwidth resources in large, high-speed ATM switches.

[1]  Albert G. Greenberg,et al.  A scalable architecture for fair leaky-bucket shaping , 1997, Proceedings of INFOCOM '97.

[2]  Nathan L. Clarke,et al.  Implementing traffic shaping , 1994, Proceedings of 19th Conference on Local Computer Networks.

[3]  Randy Brown,et al.  Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem , 1988, CACM.

[4]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.

[5]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.

[6]  Donald E. Smith,et al.  A shared‐memory virtual channel queue for ATM broadband terminal adaptors , 1992 .

[7]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[8]  J.-P. Coudreuse,et al.  Spacing cells protects and enhances utilization of ATM network links , 1992, IEEE Network.

[9]  Hung-Hsiang Jonathan Chao.  Design of leaky bucket access control schemes in ATM networks , 1991, ICC 91 International Conference on Communications Conference Record.

[10]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[11]  Kang G. Shin,et al.  Scalable hardware priority queue architectures for high-speed packet switches , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[12]  James Roberts.  Virtual spacing for flexible traffic control , 1994 .

[13]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[14]  Hung-Hsiang Jonathan Chao,et al.  A VLSI sequencer chip for ATM traffic shaper and queue manager , 1992 .

[15]  Hui Zhang.  Providing end-to-end performance guarantees using non-work-conserving disciplines , 1995, Comput. Commun..

[16]  Albert G. Greenberg,et al.  Hardware-efficient fair queueing architectures for high-speed networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Albert G. Greenberg,et al.  Hardware-eecient Fair Queueing Architectures for High-speed Networks , 1996 .

[18]  Louis E. Rosier,et al.  The pinwheel: a real-time scheduling problem , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[19]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[20]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[21]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[22]  Fouad A. Tobagi,et al.  Fast packet switch architectures for broadband integrated services digital networks , 1990, Proc. IEEE.

[23]  H. J. Chao.  A novel architecture for queue management in ATM networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[24]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, PODC '97.

[25]  S. Jamaloddin Golestani,et al.  Network Delay Analysis of a Class of Fair Queueing Algorithms , 1995, IEEE J. Sel. Areas Commun..

[26]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[27]  James R. Davin,et al.  A simulation study of fair queueing and policy enforcement , 1990, CCRV.

[28]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[29]  Antonio Cantoni,et al.  Multiplexing spacer outputs on cell emissions , 1995, Proceedings of INFOCOM'95.

[30]  F. Bonomi,et al.  The rate-based flow control framework for the available bit rate ATM service , 1995, IEEE Netw..

[31]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.