Probabilistic Analysis of Buffer Starvation in Markovian Queues

Abstract : Our purpose in this paper is to obtain the \emph{exact distribution} of the number of buffer starvations within a sequence of $N$ consecutive packet arrivals. The buffer is modeled as an M/M/1 queue. When the buffer is empty, the service restarts after a certain amount of packets are \emph{prefetched}. With this goal, we propose two approaches, one of which is based on \emph{Ballot theorem}, and the other uses recursive equations. The Ballot theorem approach gives an explicit solution, but at the cost of the high complexity order in certain circumstances. The recursive approach, though not offering an explicit result, needs fewer computations. We further propose a fluid analysis of starvation probability on the file level, given the distribution of file size and the traffic intensity. The starvation probabilities of this paper have many potential applications. We apply them to optimize the quality of experience (QoE) of media streaming service, by exploiting the tradeoff between the start-up delay and the starvation.
Type de document :
Communication dans un congrès
IEEE Infocom 2012, Mar 2012, Orlando, United States. 2012
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger
Contributeur : Yuedong Xu <>
Soumis le : dimanche 15 janvier 2012 - 22:44:18
Dernière modification le : vendredi 22 mars 2019 - 11:34:06
Document(s) archivé(s) le : lundi 16 avril 2012 - 02:21:02


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00660098, version 1



Yuedong Xu, Eitan Altman, Rachid El-Azouzi, Salah Eddine Elayoubi, Majed Haddad, et al.. Probabilistic Analysis of Buffer Starvation in Markovian Queues. IEEE Infocom 2012, Mar 2012, Orlando, United States. 2012. 〈hal-00660098〉



Consultations de la notice


Téléchargements de fichiers