Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-06T12:57:33.893Z Has data issue: false hasContentIssue false

15 - Theories for buffering and scheduling in Internet switches

from Part IV - Theory and models

Published online by Cambridge University Press:  05 October 2012

Damon Wischik
Affiliation:
University College London, UK
Byrav Ramamurthy
Affiliation:
University of Nebraska, Lincoln
George N. Rouskas
Affiliation:
North Carolina State University
Krishna Moorthy Sivalingam
Affiliation:
Indian Institute of Technology, Madras
Get access

Summary

Introduction

In this chapter we argue that future high-speed switches should have buffers that are much smaller than those used today. We present recent work in queueing theory that will be needed for the design of such switches.

There are two main benefits of small buffers. First, small buffers means very little queueing delay or jitter, which means better quality of service for interactive traffic. Second, small buffers make it possible to design new and faster types of switches. One example is a switch-on-a-chip, in which a single piece of silicon handles both switching and buffering, such as that proposed in [7]; this alleviates the communication bottleneck between the two functions. Another example is an all-optical packet switch, in which optical delay lines are used to emulate a buffer. These two examples are not practicable with large buffers.

Buffers cannot be made arbitrarily small. The reason we have buffers in the first place is to be able to absorb fluctuations in traffic without dropping packets. There are two types of fluctuations to consider: fluctuations due to end-to-end congestion control mechanisms, most notably TCP; and fluctuations due to the inherent randomness of chance alignments of packets.

In Section 15.2 we describe queueing theory which takes account of the interaction between a queue and TCP's end-to-end congestion control. The Transmission Control Protocol tries to take up all available capacity on a path, and in particular it tries to fill the bottleneck buffer.

Type
Chapter
Information
Next-Generation Internet
Architectures and Protocols
, pp. 303 - 323
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Guido, Appenzeller, Isaac, Keslassy, and Nick, McKeown. Sizing router buffers. In SIGCOMM, 2004. Extended version available as Stanford HPNG Technical Report TR04-HPNG-060800.
N., Beheshti, Y., Ganjali, and N., McKeown. Obtaining high throughput in networks with tiny buffers. In Proceedings of IWQoS, 2008.Google Scholar
Neda, Beheshti, Yashar, Ganjali, Ramesh, Rajaduray, Daniel, Blumenthal, and Nick, McKeown. Buffer sizing in all-optical packet switches. In Proceedings of OFC/NFOEC, 2006.Google Scholar
Jin, Cao and Kavita, Ramanan. A Poisson limit for buffer overflow probabilities. In IEEE Infocom, 2002.Google Scholar
R. J. R., Cruise. Poisson convergence, in large deviations, for the superposition of independent point processes. Annals of Operations Research, 2008.Google Scholar
M., Enachescu, Y., Ganjali, A., Goel, N., McKeown, and T., Roughgarden. Routers with very small buffers. In Proceedings of IEEE INFOCOM, 2006.Google Scholar
Yossi, Kanizo, David, Hay, and Isaac, Keslassy. The crosspoint-queued switch. In Proceedings of IEEE INFOCOM, 2009.Google Scholar
F. P., Kelly and R. J., Williams. Fluid model for a network operating under a fair bandwidth-sharing policy. Annals of Applied Probability, 2004.Google Scholar
Gaurav, Raina and Damon, Wischik. Buffer sizes for large multiplexers: TCP queueing theory and instability analysis. In Euro NGI, 2005.Google Scholar
Devavrat, Shah and Damon, Wischik. The teleology of scheduling algorithms for switched networks under light load, critical load, and overload. Submitted, 2009.
A. L., Stolyar. Max Weight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Annals of Applied Probability, 2004.Google Scholar
Vijay G., Subramanian, Tara, Javidi, and Somsak, Kittipiyakul. Many-sources large deviations for max-weight scheduling. arXiv:0902.4569v1, 2009.
V. J., Venkataramanan and Xiaojun, Lin. Structural properties of LDP for queue-length based wireless scheduling algorithms. In Proceedings of Allerton, 2007.Google Scholar
Curtis, Villamizar and Cheng, Song. High performance TCP in ANSNET. ACM/SIGCOMM CCR, 1994.Google Scholar
Arun, Vishwanath, Vijay, Sivaraman, and Marina, Thottan. Perspectives on router buffer sizing: recent results and open problems. ACM/SIGCOMM CCR, 2009.Google Scholar
D., Wischik. Buffer sizing theory for bursty TCP flows. In Proceedings of IZS, 2006.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×