TY - JOUR

T1 - Mean FDE models for internet congestion control under a many-flows regime

AU - Shakkottai, Sanjay

AU - Srikant, R.

N1 - Funding Information:
Manuscript received August 3, 2001; revised October 5, 2003. This work was supported by AFOSR under Contract URI F49620-01-1-0365 and by DARPA under Grant F30602-00-2-0542. The material in this paper was presented in part at the IEEE INFOCOM, New York, NY, June 2002.

PY - 2004/6

Y1 - 2004/6

N2 - Congestion control algorithms used in the Internet are difficult to analyze or simulate on a large scale, i.e., when there are large numbers of nodes, links, and sources in a network. The reasons for this include the complexity of the actual implementation of the algorithm and the randomness introduced in the packet arrival and service processes due to many factors such as arrivals and departures of sources and uncontrollable short flows in the network. To make the analysis or simulation tractable, often deterministic fluid approximations of these algorithms are used. These approximations are in the form of either deterministic delay differential equations, or more generally, deterministic functional-differential equations (FDEs). In this paper, we ignore the complexity introduced by the window-based implementation of such algorithms and focus on the randomness in the network. We justify the use of deterministic models for proportionally-fair congestion controllers under a limiting regime where the number of flows in a network is large.

AB - Congestion control algorithms used in the Internet are difficult to analyze or simulate on a large scale, i.e., when there are large numbers of nodes, links, and sources in a network. The reasons for this include the complexity of the actual implementation of the algorithm and the randomness introduced in the packet arrival and service processes due to many factors such as arrivals and departures of sources and uncontrollable short flows in the network. To make the analysis or simulation tractable, often deterministic fluid approximations of these algorithms are used. These approximations are in the form of either deterministic delay differential equations, or more generally, deterministic functional-differential equations (FDEs). In this paper, we ignore the complexity introduced by the window-based implementation of such algorithms and focus on the randomness in the network. We justify the use of deterministic models for proportionally-fair congestion controllers under a limiting regime where the number of flows in a network is large.

KW - Delay-differential equations

KW - Fluid model

KW - Internet congestion control

KW - Many-flows asymptotics

KW - Proportional fairness

UR - http://www.scopus.com/inward/record.url?scp=0347888247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347888247&partnerID=8YFLogxK

U2 - 10.1109/TIT.2004.828063

DO - 10.1109/TIT.2004.828063

M3 - Article

AN - SCOPUS:0347888247

VL - 50

SP - 1050

EP - 1072

JO - IRE Professional Group on Information Theory

JF - IRE Professional Group on Information Theory

SN - 0018-9448

IS - 6

ER -