Fair End-to-End Optimal Minimum Variance Window Control

Aun HAIDER; Harsha SIRISENA; Krzysztof PAWLIKOWSKI; Mahbub HASSAN

Fair End-to-End Optimal Minimum Variance Window Control

Aun HAIDER, Harsha SIRISENA, Krzysztof PAWLIKOWSKI, Mahbub HASSAN

Full Text Views

0

Share
Cite this

Summary :

This paper deals with optimizing end-to-end window control algorithms that achieve proportional fairness in the long run, and also investigating their steady state and transient or short-term fairness. An abstracted stochastic model of a bottlenecked connection is employed and the window control is designed to minimize the buffer queue variance while keeping the mean queue level at a target value, taking the round-trip delay into account. An optimal minimum variance window control algorithm and its generalized version are derived with the major aim of reducing the window size fluctuations. A relation between the generalized version and the (p, 1) proportionally fair algorithm is investigated. Also we derive the stability limits of the generalized minimum variance window control algorithm which can be useful during network design. The effects of both the target queue length and a weighting parameter on the steady state and short-term fairness, as measured by Jain's fairness and short-term fairness indices, calculated over short time intervals, are investigated by simulation. The generalized algorithm has better fairness properties as compared to existing algorithms such as that employed in TCP Vegas.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.3 pp.539-547

Publication Date: 2004/03/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Internet Technology IV)

Category: Congestion Control

Cite this

Copy

Aun HAIDER, Harsha SIRISENA, Krzysztof PAWLIKOWSKI, Mahbub HASSAN, "Fair End-to-End Optimal Minimum Variance Window Control" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 3, pp. 539-547, March 2004, doi: .
Abstract: This paper deals with optimizing end-to-end window control algorithms that achieve proportional fairness in the long run, and also investigating their steady state and transient or short-term fairness. An abstracted stochastic model of a bottlenecked connection is employed and the window control is designed to minimize the buffer queue variance while keeping the mean queue level at a target value, taking the round-trip delay into account. An optimal minimum variance window control algorithm and its generalized version are derived with the major aim of reducing the window size fluctuations. A relation between the generalized version and the (p, 1) proportionally fair algorithm is investigated. Also we derive the stability limits of the generalized minimum variance window control algorithm which can be useful during network design. The effects of both the target queue length and a weighting parameter on the steady state and short-term fairness, as measured by Jain's fairness and short-term fairness indices, calculated over short time intervals, are investigated by simulation. The generalized algorithm has better fairness properties as compared to existing algorithms such as that employed in TCP Vegas.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_3_539/_p

Copy

@ARTICLE{e87-b_3_539,
author={Aun HAIDER, Harsha SIRISENA, Krzysztof PAWLIKOWSKI, Mahbub HASSAN, },
journal={IEICE TRANSACTIONS on Communications},
title={Fair End-to-End Optimal Minimum Variance Window Control},
year={2004},
volume={E87-B},
number={3},
pages={539-547},
abstract={This paper deals with optimizing end-to-end window control algorithms that achieve proportional fairness in the long run, and also investigating their steady state and transient or short-term fairness. An abstracted stochastic model of a bottlenecked connection is employed and the window control is designed to minimize the buffer queue variance while keeping the mean queue level at a target value, taking the round-trip delay into account. An optimal minimum variance window control algorithm and its generalized version are derived with the major aim of reducing the window size fluctuations. A relation between the generalized version and the (p, 1) proportionally fair algorithm is investigated. Also we derive the stability limits of the generalized minimum variance window control algorithm which can be useful during network design. The effects of both the target queue length and a weighting parameter on the steady state and short-term fairness, as measured by Jain's fairness and short-term fairness indices, calculated over short time intervals, are investigated by simulation. The generalized algorithm has better fairness properties as compared to existing algorithms such as that employed in TCP Vegas.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Fair End-to-End Optimal Minimum Variance Window Control
T2 - IEICE TRANSACTIONS on Communications
SP - 539
EP - 547
AU - Aun HAIDER
AU - Harsha SIRISENA
AU - Krzysztof PAWLIKOWSKI
AU - Mahbub HASSAN
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2004
AB - This paper deals with optimizing end-to-end window control algorithms that achieve proportional fairness in the long run, and also investigating their steady state and transient or short-term fairness. An abstracted stochastic model of a bottlenecked connection is employed and the window control is designed to minimize the buffer queue variance while keeping the mean queue level at a target value, taking the round-trip delay into account. An optimal minimum variance window control algorithm and its generalized version are derived with the major aim of reducing the window size fluctuations. A relation between the generalized version and the (p, 1) proportionally fair algorithm is investigated. Also we derive the stability limits of the generalized minimum variance window control algorithm which can be useful during network design. The effects of both the target queue length and a weighting parameter on the steady state and short-term fairness, as measured by Jain's fairness and short-term fairness indices, calculated over short time intervals, are investigated by simulation. The generalized algorithm has better fairness properties as compared to existing algorithms such as that employed in TCP Vegas.
ER -