DMCA
A Duality Model of TCP and Queue Management Algorithms (2002)
Cached
Download Links
| Venue: | IEEE/ACM Trans. on Networking |
| Citations: | 307 - 37 self |
BibTeX
@ARTICLE{Low02aduality,
author = {Steven H. Low},
title = {A Duality Model of TCP and Queue Management Algorithms},
journal = {IEEE/ACM Trans. on Networking},
year = {2002},
volume = {11},
pages = {525--536}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose a duality model of congestion control and apply it to understand the equilibrium properties of TCP and active queue management schemes. Congestion control is the interaction of source rates with certain congestion measures at network links. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primal-dual algorithm carried out over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas, and the dual iteration is carried out by queue management such as DropTail, RED or REM. We present these algorithms and their generalizations, derive their utility functions, and study their interaction.
Keyphrases
duality model queue management algorithm congestion control source rate utility function aggregate utility subject network link dual iteration queue management congestion measure equilibrium property certain congestion measure primal iteration distributed primal-dual algorithm active queue management scheme basic idea primal variable tcp algorithm capacity constraint dual variable
