Sciweavers

Share
INFOCOM
2003
IEEE

Estimation of Congestion Price Using Probabilistic Packet Marking

8 years 10 months ago
Estimation of Congestion Price Using Probabilistic Packet Marking
Abstract— One key component of recent pricing-based congestion control schemes is an algorithm for probabilistically setting the Explicit Congestion Notification bit at routers so that a receiver can estimate the sum of link congestion prices along a path. We consider two such algorithms—a well-known algorithm called Random Exponential Marking (REM) and a novel algorithm called Random Additive Marking (RAM). We show that if link prices are unbounded, a class of REM-like algorithms are the only ones possible. Unfortunately, REM computes a biased estimate of total price and requires setting a parameter for which no uniformly good choice exists in a network setting. However, we show that if prices can be bounded and therefore normalized, then there is an alternate class of feasible algorithms, of which RAM is representative and furthermore, only the REM-like and RAM-like classes are possible. For properly normalized link prices, RAM returns an optimal price estimate (in terms of mean...
Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Dona
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where INFOCOM
Authors Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Donald F. Towsley
Comments (0)
books