Abstract
MaxNet is a distributed congestion control architecture in which only the most severely bottlenecked link on the end-to-end path controls the source rate. This paper shows that the small-signal convergence speed of MaxNet is higher than that of conventional architectures, such as the current Internet or REM. It also shows that MaxNet decouples the control, so that each pole position depends only on parameters of one bottleneck link and of the sources controlled by that bottleneck, enabling optimal pole placement.
Chapter PDF
References
Wydrowski, B., Zukerman, M.: MaxNet: A congestion control architecture for maxmin fairness. IEEE Commun. Lett. 6 (2002) 512–514
Wydrowski, B., Andrew, L.L.H., Zukerman, M.: MaxNet: A congestion control architecture for scalable networks. IEEE Commun. Lett. 7 (2003) 511–513
Paganini, F., Doyle, J.C., Low, S.H.: Scalable laws for stable network congestion control. In: Proc. IEEE Conf. Decision Contr. (CDC), Orlando, FL (2001) 185–90
Paganini, F., Wang, Z., Low, S., Doyle, J.: A new TCP/AQM for stable operation in fast networks. In: Proc. IEEE Infocom, San Francisco, CA (2003) 96–105
Marshall, J.E., Górecki, H., Walton, K., Korytowski, A.: Time-Delay Systems: Stability and Performance Criteria with Applications. Ellis Horwood, New York, NY (1992)
Ogata, K.: Modern Control Engineering. Prentice-Hall, Englewood Cliffs, NJ (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wydrowski, B.P., Andrew, L.L.H., Mareels, I.M.Y. (2004). MaxNet: Faster Flow Control Convergence. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive