Hostname: page-component-54dcc4c588-dbm8p Total loading time: 0 Render date: 2025-09-13T14:03:51.929Z Has data issue: false hasContentIssue false
  • English
  • Français

ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM

Published online by Cambridge University Press:  01 January 2000

Jean-François Dantzer ,
Mostafa Haddani  and
Philippe Robert
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
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 14 , Issue 1 , January 2000 , pp. 57 - 79
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable