Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T09:42:34.436Z Has data issue: false hasContentIssue false

ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM

Published online by Cambridge University Press:  01 January 2000

Jean-François Dantzer
Affiliation:
Département de Mathématiques, Bâtiment Fermat Université de Versailles, 78035 Versailles, France, E-mail: Jean-Francois.Dantzer@inria.fr
Mostafa Haddani
Affiliation:
INRIA, Domaine de Voluceau, 78153 Le Chesnay Cedex, France, E-mail: Mostafa.Haddani@inria.fr;Philippe.Robert@inria.fr
Philippe Robert
Affiliation:
INRIA, Domaine de Voluceau, 78153 Le Chesnay Cedex, France, E-mail: Mostafa.Haddani@inria.fr;Philippe.Robert@inria.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
© 2000 Cambridge University Press