Scalable architecture for fair leaky-bucket shaping

Jennifer L. Rexford, Flavio Bonomi, Albert Greenberg, Albert Wong

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

This paper presents a shaper architecture that scales to a large number of connections with diverse burstiness and bandwidth parameters. The 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. To handle a wider range of rate parameters, a hierarchical arbitration scheme can reduce the implementation overheads and the interference between competing connections. Simulation experiments demonstrate that the architecture limits shaping delay and traffic distortions, even under heavy congestion.

Original languageEnglish (US)
Pages (from-to)1054-1062
Number of pages9
JournalProceedings - IEEE INFOCOM
Volume3
StatePublished - Dec 1 1997
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Scalable architecture for fair leaky-bucket shaping'. Together they form a unique fingerprint.

  • Cite this

    Rexford, J. L., Bonomi, F., Greenberg, A., & Wong, A. (1997). Scalable architecture for fair leaky-bucket shaping. Proceedings - IEEE INFOCOM, 3, 1054-1062.