Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-27T23:14:39.612Z Has data issue: false hasContentIssue false
  • English
  • Français

STOCHASTICALLY SCALABLE FLOW CONTROL

Published online by Cambridge University Press:  14 July 2009

Thomas Voice
Thomas Voice
Affiliation:
Cambridge University Statistical Laboratory, Cambridge, UK E-mail: tdvoice@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

Recent advances in the mathematical analysis of flow control have prompted the creation of the Scalable TCP (STCP) and Exponential RED (E-RED) algorithms. These are designed to be scalable under the popular deterministic delay stability modeling framework. In this article, we analyze stochastic models of STCP and STCP combined with E-RED link behavior. We find that under certain plausible network conditions, these probabilistic models also exhibit scalable behavior. In particular, we derive parameter choice schemes for which the equilibrium coefficients of variation of flow rates are bounded, however large, fast, or complex the network. Our model is shown to exhibit behavior similar to the mean field convergence that has recently been observed in TCP.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 23 , Issue 4 , October 2009 , pp. 675 - 698
Copyright
Copyright © Cambridge University Press 2009

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

1.Baccelli, F., McDonald, D. & Reynier, J. (2002). A mean-field model for multiple TCP connections through a buffer implementing RED. In Proceedings of IFIP Performance 2002, Romo.CrossRefGoogle Scholar
2.Bain, A. & Key, P. (2002). Modelling the performance of in-call probing for multilevel adaptive applications. Technical report Msr-tr-2002-06, Microsoft Research.Google Scholar
3.Barnett, S. (1975). Introduction to mathematical control theory. Oxford: Oxford University Press.Google Scholar
4.Cooper, R. (1972). Introduction to queueing theory. New York: Macmillan.Google Scholar
5.Gu, Y., Towsley, D., Hollot, C. & Zhang, H. (2007). Congestion control for small buffer high speed networks. In Proceedings of IEEE Infocom. Available from ftp://gaia.cs.umass.edu/pub/gu06-14.pdf.Google Scholar
6.Hammarling, S.I. (1982). Numerical solution of stanle non-negative definite Iyapunov equation. IMA Journal of Numerical Analysis 2: 303–323.CrossRefGoogle Scholar
7.Johari, R. & Tan, D. (2001). End-to-end congestion control for the internet: Delays and stability. IEEE/ACM Transactions on Networking 9: 818–832.CrossRefGoogle Scholar
8.Kelly, F.P. (2003). Fairness and stability of end-to-end congestion control. European Journal of Control 9: 159–176.CrossRefGoogle Scholar
9.Kelly, F.P., Maulloo, A.K. & Tan, D.K.H. (1998). Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49: 237–252.CrossRefGoogle Scholar
10.Kelly, T. (2002). On engineering a stable and scalable TCP variant. Technical report CUED/FINFENG/TR.435 Cambridge: Cambridge University Engineering Department.Google Scholar
11.Kelly, T. (2003). Scalable TCP: Improving performance in highspeed wide area networks. Computer Communication Review 33: 83–91.CrossRefGoogle Scholar
12.Liu, S., Basar, T. & Srikant, R. (2003). Controlling the internet: A survey and some new results. In Proceedings of IEEE Conference on Decision and Control.Google Scholar
13.Liu, S., Basar, T. & Srikant, R. (2005). Exponential RED: A stabilizing AQM scheme for low and high speed TCP. IEEE Transactions on Networking 13(5): 1068–1081.Google Scholar
14.Massoulié, L. (2000). Stability of distributed congestion control with heterogeneous feedback delays. Technical report Msr-tr-2000-111, Richmond, VA: Microsoft Research.Google Scholar
15.McDonald, D. & Reynier, J. (2006). Mean field convergence of a model of multiple TCP connections through a buffer implementing RAD. Annals of Applied Probability 16(1): 244–294.CrossRefGoogle Scholar
16.Oksendal, B. (1992). Stochastic differential equations: An introduction with applications. Berlin: Springer.CrossRefGoogle Scholar
17.Ott, T.J. (2005). Transport protocols in the TCP paradigm and their performance. Telecommunication Systems 30(4): 351–385.CrossRefGoogle Scholar
18.Ott, T.J. (2006). Rate of convergence for the “square root formula.” Advances in Applied Probability 38(4): 1132–1154.Google Scholar
19.Ott, T.J. & Swanson, J. (2007). Asymptotic behavior of a generalized TCP congestion avoidance algorithm. Journal of Applied Probability 44: 618–635.CrossRefGoogle Scholar
20.Raina, G., Wischik, D. & Towsley, D. (2005). Control theory for buffer sizing. Computer Communication Review 35(3): 79–82.CrossRefGoogle Scholar
21.Srikant, R. (2004). The mathematics of internet congestion control. Boston: Birkhauser.CrossRefGoogle Scholar
22.Vinnicombe, G. (2002). On the stability of networks operating TCP-like congestion control. In Proceedings of IFAC.CrossRefGoogle Scholar