Probabilistic Analysis of Buffer Starvation in Markovian Queues

Details Probabilistic Analysis of Buffer Starvation in Markovian Queues Probabilistic Analysis of Buffer Starvation in Markovian Queues

2011-07-31

arxiv.org/abs/1108.0187v2

Computer Science

Performance

9 pages, 7 figures; IEEE Infocom 2012

Scientific paper

Our purpose in this paper is to obtain the 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, plus the consideration of bursty arrivals characterized by an interrupted Poisson process. When the buffer is empty, the service restarts after a certain amount of packets are prefetched. With this goal, we propose two approaches, one of which is based on 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.

Affiliated with

Also associated with

No associations

Rating

Probabilistic Analysis of Buffer Starvation in Markovian Queues does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic Analysis of Buffer Starvation in Markovian Queues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Analysis of Buffer Starvation in Markovian Queues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703319