A spectral theory approach for extreme value analysis in a tandem of fluid queues

We consider a model to evaluate performance of streaming media over an unreliable network. Our model consists of a tandem of two fluid queues. The first fluid queue is a Markov modulated fluid queue that models the network congestion, and the second queue represents the play-out buffer. For this model the distribution of the total amount of fluid in the congestion and play-out buffer corresponds to the distribution of the maximum attained level of the first buffer. We show that, under proper scaling and when we let time go to infinity, the distribution of the total amount of fluid converges to a Gumbel extreme value distribution. From this result, we derive a simple closed-form expression for the initial play-out buffer level that provides a probabilistic guarantee for undisturbed play-out

Dimensioning of play-out buffers for real-time services in a B-ISDN

A large fraction of traffic that the future B-ISDN will probably transport is made up of real-time services with stringent delay and delay jitter requirements. Since ATM networks do not provide time transparent links (i.e. constant delay links), a delay equalisation has to be provided in the adaptation layer or in user equipments. In this paper, we first present a source model analysis and then propose an analytical model that allows the evaluation of the end-to-end delay and of the relevant jitter; finally, we focus on the dimensioning of play-out buffers. The proposed model is validated with simulation results and we found a good agreement between analytical and simulation results. To make the study analytically tractable we use rather simple traffic source models and we make suitable simplifying assumptions. These assumptions are fairly general but the source models are still far from representing accurately certain kinds of real traffic. For this reason, we also carry out an additional simulation study (supported by some analytical arguments), by using real experimental MPEG and LAN traffic traces, to assess the system performance in real scenarios. (C) 1998 Elsevier Science B.V

Dimensioning of play-out buffers for real time services in a B-ISDN

A large fraction of traffic that the future B-ISDN will probably transport is made up of real-time services with stringent delay and delay jitter requirements. Since ATM networks do not provide time transparent links, a delay equalisation has to be provided in the adaptation layer or in user equipment. In this paper we first propose an analytical model that allows the evaluation of the end-to-end delay and of the relevant jitter (the delay that we consider is the one suffered in the network queueing systems plus the time needed to transmit a cell but not the propagation delay; the latter can be trivially added to the former); then we focus on the dimensioning of play-out buffers. The proposed model is validated with simulation results and we found a good agreement between analytical and simulation results. To make the study analytically tractable we use rather simple traffic source models and we make suitable simplifying assumptions. These assumptions are fairly general but the source models are still far from representing accurately certain kinds of real traffic. For this reason we carry out also an additional simulation study (supported by some analytical arguments), by using real experimental MPEG, LAN and Internet traffic traces, to assess the system performance in real scenarios

Dimensioning of play-out buffers for real time services in a B-ISDN

A large fraction of traffic that the future B-ISDN will probably transport is made up of real-time services with stringent delay and delay jitter requirements. Since ATM networks do not provide time transparent links, a delay equalisation has to be provided in the adaptation layer or in user equipment. In this paper we first propose an analytical model that allows the evaluation of the end-to-end delay and of the relevant jitter (the delay that we consider is the one suffered in the network queueing systems plus the time needed to transmit a cell but not the propagation delay; the latter can be trivially added to the former); then we focus on the dimensioning of play-out buffers. The proposed model is validated with simulation results and we found a good agreement between analytical and simulation results. To make the study analytically tractable we use rather simple traffic source models and we make suitable simplifying assumptions. These assumptions are fairly general but the source models are still far from representing accurately certain kinds of real traffic. For this reason we carry out also an additional simulation study (supported by some analytical arguments), by using real experimental MPEG, LAN and Internet traffic traces, to assess the system performance in real scenarios