Published June 2000 | Version Published
Book Section - Chapter Open

Price computation in random early marking (REM)

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.

Additional Information

© Copyright 2000 IEEE. Reprinted with permission. Publication Date: 18-22 June 2000.

Attached Files

Published - ATHicon01b.pdf

Files

ATHicon01b.pdf

Files (419.8 kB)

Name Size Download all
md5:073b12725da0cb0796b332a01123ca12
419.8 kB Preview Download

Additional details

Identifiers

Eprint ID
11482
Resolver ID
CaltechAUTHORS:ATHicon00

Dates

Created
2008-08-22
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field