Fluid limits for bandwidth-sharing networks in overload

S.C. Borst, R.R. Egorova, B. Zwart

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
5 Downloads (Pure)

Abstract

Bandwidth-sharing networks as considered by Roberts and Massoulié [28] (Roberts JW, Massoulié L (1998) Bandwidth sharing and admission control for elastic traffic. Proc. ITC Specialist Seminar, Yokohama, Japan) provide a natural modeling framework for describing the dynamic flow-level interaction among elastic data transfers. Under mild assumptions, it has been established that a wide family of so-called a-fair bandwidth-sharing strategies achieve stability in such networks provided that no individual link is overloaded. In the present paper we focus on bandwidth-sharing networks where the load on one or several of the links exceeds the capacity. To characterize the overload behavior, we examine the fluid limit, which emerges when the flow dynamics are scaled in both space and time. We derive a functional equation characterizing the fluid limit, and show that any strictly positive solution must be unique, which in particular implies the convergence of the scaled number of flows to the fluid limit for nonzero initial states when the load is sufficiently high. For the case of a zero initial state and a zero-degree homogeneous rate allocation function, we show that there exists a linear solution to the fluid-limit equation, and obtain a fixed-point equation for the corresponding asymptotic growth rates. It is proved that a fixed-point solution is also a solution to a related strictly concave optimization problem, and hence exists and is unique. In addition, we establish uniqueness of fluid-model solutions for monotone rate-preserving networks (in particular tree networks).
Original languageEnglish
Pages (from-to)533-560
Number of pages28
JournalMathematics of Operations Research
Volume39
Issue number2
DOIs
Publication statusPublished - 2014

Fingerprint Dive into the research topics of 'Fluid limits for bandwidth-sharing networks in overload'. Together they form a unique fingerprint.

Cite this