Price computation in random early marking (REM)

Athuraliya, Sanjeewa and Low, Steven (2000) Price computation in random early marking (REM). In: IEEE International Conference on Communications, 2000. ICC 2000. New Orleans, LA. Vol.1. IEEE , Piscataway, NJ, pp. 485-489. ISBN 0-7803-6283-7. http://resolver.caltech.edu/CaltechAUTHORS:ATHicon00

Preview

PDF - Published Version
See Usage Policy.
409Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:ATHicon00

Abstract

We proposed earlier a flow control algorithm derived from solving the dual of a welfare maximization problem. The algorithm however requires communication between network links and sources that is not achievable on the current Internet. We then extended the basic algorithm to a Random Early Marking (REM) scheme which can be implemented using only binary feedback. In this paper we proposed a new price computation algorithm for REM and present simulation results to illustrate its superior performance over the previous versions.

Item Type:

Book Section

Related URLs:

URL	URL Type	Description
http://dx.doi.org/10.1109/ICC.2000.853366	DOI	UNSPECIFIED

Additional Information:

Subject Keywords:

Internet; buffer storage; costing; delays; digital simulation; feedback; optimization; packet switching; random processes; telecommunication congestion control; transport protocols; IP header; TCP flow control; binary feedback; delay; network links; network sources; performance; price computation algorithm; random early marking; simulation results; welfare maximization problem

Record Number:

CaltechAUTHORS:ATHicon00

Persistent URL:

http://resolver.caltech.edu/CaltechAUTHORS:ATHicon00

Usage Policy:

No commercial reproduction, distribution, display or performance rights in this work are provided.

ID Code:

11482

Collection:

CaltechAUTHORS

Deposited By:

Kristin Buxton

Deposited On:

22 Aug 2008 04:59

Last Modified:

26 Dec 2012 10:15

Repository Staff Only: item control page