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 .
Our purpose in this paper is to characterize buffer starvations for streaming services . The buffer is modeled as an M/M/1 queue, plus the consideration of bursty arrivals . When the buffer is empty, the service restarts after a certain amount of packets are prefetched . With this goal, we propose two approaches to obtain theexact distribution of the number of buffer starvations , one of which is based on Ballot theorem , and the other uses recursive equations. The Ballot theorem approach gives an explicit result. We extend this approach to the scenario with a constant playback rate using T\`{a . The recursive approach, though not offering an explicit result, can obtain the distribution of starvations with non-independent and identically distributed (i.i.d.) arrival process in which an ON/OFF bursty arrival process is considered in this work. We further compute the starvation probability as a function of the amount of prefetched packets for a large number of files via a fluid analysis. Among many potential applications of starvation analysis, we show how to apply it to optimize the objective quality of experience (QoE) of media streaming , by exploiting the tradeoff between startup/rebuffering delay and starvations .
R
obtain the exact distribution of the number of buffer starvations within a sequence of N consecutive packet arrivals
characterize buffer starvations for streaming services
D
characterized by an interrupted Poisson process
R
prefetched
prefetched
A
to obtain the
A
exact distribution
A
of the number of buffer starvations
R
Ballot theorem
Ballot theorem
R
solution, but at the cost of the high complexity order in certain circumstances
result. We extend this approach to the scenario with a constant playback rate using T\`{a
R
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
can obtain the distribution of starvations with non-independent and identically distributed (i.i.d.) arrival process in which an ON/OFF bursty arrival process is considered in this work. We further compute the starvation probability as a function of the amount of prefetched packets for a large number of files via a fluid analysis. Among
R
. We apply them
of starvation analysis, we show how to apply it
A
objective
D
service
R
the start-up delay and the starvation
startup/rebuffering delay and starvations