ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM

Authors:
Jean-Franç/ois Dantzer;Mostafa Haddani;Philippe Robert
Affiliations:
Dé/partement de Mathé/matiques, Bâ/timent Fermat Université/ de Versailles, 78035 Versailles, France, E-mail: Jean-Francois.Dantzer@inria.fr;INRIA, Domaine de Voluceau, 78153 Le Chesnay Cedex, France, E-mail: Mostafa.Haddani@inria.fr/Philippe.Robert@inria.fr;INRIA, Domaine de Voluceau, 78153 Le Chesnay Cedex, France, E-mail: Mostafa.Haddani@inria.fr/Philippe.Robert@inria.fr
Venue:
Probability in the Engineering and Informational Sciences
Year:
2000

Citing 2
Cited 2

Random walks in two-dimensional complexes

Queueing Systems: Theory and Applications
COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS

Probability in the Engineering and Informational Sciences

Stability Analysis of the Cambridge Ring

Queueing Systems: Theory and Applications
Stochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The stability properties of the bandwidth allocation algorithm First Fit are analyzed for some distributions on the sizes of the requests. Fluid limits are used to get the ergodicity results. When there are two possible sizes, the description of the transient behavior involves a finite Markov chain on the exit states of a transient Markov chain on a countable state space. The explicit expression of this exit matrix is given.