2005 International Conference on Analysis of Algorithms
Conrado Martínez (ed.)
DMTCS Conference Volume AD (2005), pp. 27-38
| author: | Y. Baryshnikov, E. Coffman, J. Feng and P. Momčilović |
|---|---|
| title: | Asymptotic analysis of a nonlinear AIMD algorithm |
| keywords: | AIMD analysis, congestion avoidance algorithms, fair resource allocation, differentiated service |
| abstract: |
The Additive-Increase-Multiplicative Decrease (AIMD)
algorithm is an effective technique for controlling
competitive access to a shared resource. Let
N
be the number of users and let
x
be the amount of the resource in possession of the
i
(t)
i
-th user. The allocations
x
increase linearly until the aggregate demand
i
(t)
Σ
exceeds a given nominal capacity, at which point a
user is selected at a random time and its allocation
reduced from
i
x
i
(t)
x
to
i
(t)
x
for some given parameter
i
(t)/γ,
γ>1
. In our new, generalized version of AIMD, the choice
of users to have their allocations cut is determined by a
selection rule whereby the probabilities of selection are
proportional to
x
, with
i
α
(t)/ Σ
j
x
j
α
α
a parameter of the policy. Variations of parameters
allows one to adjust fairness under AIMD (as measured for
example by the variance of
x
) as well as to provide for differentiated service.
The primary contribution here is an asymptotic, large-
i
(t)
N
analysis of the above nonlinear AIMD algorithm within
a baseline mathematical model that leads to explicit
formulas for the density function governing the allocations
x
in statistical equilibrium. The analysis yields
explicit formulas for measures of fairness and several
techniques for supplying differentiated service via AIMD.
i
(t)
|
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | Y. Baryshnikov and E. Coffman and J. Feng and P. Momčilović (2005), Asymptotic analysis of a nonlinear AIMD algorithm, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 27-38 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dmAD0104.ps.gz (114 K) |
| ps-source: | dmAD0104.ps (327 K) |
| pdf-source: | dmAD0104.pdf (192 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Di Sep 27 10:09:28 CEST 2005 by gustedt
