Congestion control algorithms
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 talk,
we will 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. We will also present some examples of design rules that can be
obtained from such models.
References:
S. Shakkottai and R. Srikant.
Mean FDE models of Internet Congestion Control.
Copyright. All Rights Reserved.