Abstract
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and prevents long flows from hogging resources. For example, if a set of flows with the same round trip time share a bottleneck link, TCP’s congestion control mechanism tries to achieve PS; so do most of the proposed alternatives, such as eXplicit Control Protocol (XCP). But although they emulate PS well in a static scenario when all flows are long-lived, they do not come close to PS when new flows arrive randomly and have a finite amount of data to send, as is the case in today’s Internet. Typically, flows take an order of magnitude longer to complete with TCP or XCP than with PS, suggesting large room for improvement. And so in this paper, we explore how a new congestion control algorithm — Rate Control Protocol (RCP) — comes much closer to emulating PS over a broad range of operating conditions. In RCP, a router assigns a single rate to all flows that pass through it. The router does not keep flow-state, and does no per-packet calculations. Yet we are able to show that under a wide range of traffic characteristics and network conditions, RCP’s performance is very close to ideal processor sharing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fredj, S.B., Bonald, T., Proutiere, A., Regnie, G., Roberts, J.W.: Statistical Bandwidth Sharing: A Study of Congestion at Flow Level. In: Proceedings of ACM Sigcomm 2001, San Diego (August 2001)
Katabi, D., Handley, M., Rohrs, C.: Internet Congestion Control for High Bandwidth-Delay Product Networks. In: Proceedings of ACM Sigcomm 2002, Pittsburgh (August 2002)
Dukkipati, N., Kobayashi, M., Zhang-Shen, R., McKeown, N.: Processor Sharing Flows in the Internet. Stanford HPNG Technical Report TR04-HPNG-061604, http://yuba.stanford.edu/rcp/
Balakrishnan, H., Dukkipati, N., McKeown, N., Tomlin, C.: Stability Analysis of Switched Hybrid Time-Delay Systems – Analysis of the Rate Control Protocol. Stanford University Department of Aero/Astro Technical Report, http://yuba.stanford.edu/rcp/
Crovella, M.E., Bestavros, A.: Self Similarity in World Wide Web Traffic: Evidence and Possible Causes. In: IEEE/ACM Transactions on Networking, December 1997, vol. 5(6) (1997)
The Network Simulator, http://www.isi.edu/nsnam/ns/
Wolff, W.: Stochastic Modeling and the Theory of Queues. PrenticeHall, Englewood Cliffs (1989)
ns-2 code for Explicit Control Protocol, http://ana.lcs.mit.edu/dina/XCP/
Paxson, V., Floyd, S.: Wide Area Traffic: The Failure of Poisson Modeling. IEEE/ACM Transactions on Networking, 3(3), 226–44 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dukkipati, N., Kobayashi, M., Zhang-Shen, R., McKeown, N. (2005). Processor Sharing Flows in the Internet. In: de Meer, H., Bhatti, N. (eds) Quality of Service – IWQoS 2005. IWQoS 2005. Lecture Notes in Computer Science, vol 3552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499169_22
Download citation
DOI: https://doi.org/10.1007/11499169_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26294-7
Online ISBN: 978-3-540-31659-6
eBook Packages: Computer ScienceComputer Science (R0)