Abstract
Random Early Marking (REM) consists of a link algorithm, that probabilistically marks packets inside the network, and a source algorithm, that adapts source rate to observed marking.The marking probability is exponential in a link congestion measure, so that the end- to-end marking probability is exponential in a path congestion measure. Marking allows a source to estimate its path congestion measure and adjusts its rate in a way that aligns individual optimality with social optimality.We describe the REM algorithm, summarize its key properties, and present some simulation results that demonstrate its stability, fairness and robustness.
This is a preview of subscription content, log in via an institution to check access.
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
Sanjeewa Athuraliya, David Lapsley, and Steven Low. An Enhanced Random Early Marking Algorithm for Internet Flow Control.In Proceedings of IEEE Infocom, March2000. 43
Sanjeewa Athuraliya and Steven Low. Optimization flow control, II: Random Exponential Marking.Submitted for publication, http://www.ee.mu.oz.au/sta./slow/research/, May 2000. 44, 47, 52
Yair Bartal, J. Byers, and D.R az. Global optimization using local information with applications to flow control.In STOC, October 1997. 43
Costas Courcoubetis, Vasilios A. Siris, and George D.S tamoulis. Integration of pricing and flow control for ABR services in ATM networks. Proceedings of Globecom’ 96, November 1996. 43
S. Floyd. Connections with multiple congested gateways in packet-switched networks, Part I: one-way traffic. Computer Communications Review, 21(5), October 1991. 48
R.J. Gibbens and F. P. Kelly. Resource pricing and the evolution of congestion control. Automatica, 35, 1999. 43
Jamal Golestani and Supratik_Bhattacharyya. End-to-end congestion control for the Internet: A global optimization framework.In Proceedings of International Conf. on Network Protocols (ICNP), October 1998. 43
F. P. Kelly. Charging and rate control for zelastic traffic. European Transactions on Telecommunications, 8:33–37, 1997. http://www.statslab.cam.ac.uk/~frank/elastic.html. 43, 47
Frank Kelly. Mat hematical modelling of the Internet. In Proc. 4th International Congress on Industrial and Applied Mathematics, July 1999. 44
Frank P. Kelly, Aman Maulloo, and David Tan. Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of Operations Research Society, 49(3):237–252, March 1998. 43
Srisankar Kunniyur and R. Srikant. End-to-end congestion control schemes: utility functions, random losses and ECN marks.In Proceedings of IEEE Infocom, March 2000. 43, 44
David E. Lapsley and Steven H. Low. An optimization approach to ABR control. In Proceedings of the ICC, June1998. 43, 47
David E. Lapsley and Steven H. Lo w. Random Early Marking for Internet Congestion Control.In Proceedings of IEEE Globecom’99, December 1999. 43
Steven Low, Larry Peterson, and Limin Wang. Understanding Vegas: theory and practice. Submitted for publication, http://www.ee.mu.oz.au/sta./slow/research/, February 2000. 44
Steven H. Low. A duality model of TCP flow controls. In Proceedings of ITC Specialist Seminar on IP Traffic Measurement, Modeling and Management, September 18–202000. 44
Steven H. Low and David E. Lapsley. Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7(6):861–874, December 1999. http://www.ee.mu.oz.au/sta./slow/research/. 43, 44, 47, 52
L. Massoulie and J. Roberts. Bandwidth sharing: objectives and algorithms. In Infocom’99, March 1999. Available at http://www.dmi.ens.fr/%7Emistral/tcpworkshop.html. 43
Jeonghoon Mo and Jean Walrand. Fair end-to-end window-based congestion control. Prep rint, 1999. 43
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Athuraliya, S., Low1, S., Lapsley, D. (2000). Random Early Marking. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds) Quality of Future Internet Services. QofIS 2000. Lecture Notes in Computer Science, vol 1922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39939-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-39939-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41076-8
Online ISBN: 978-3-540-39939-1
eBook Packages: Springer Book Archive