Overflow probability upper bound for heterogeneous fluid queues handling general on-off sources

Author(s):  
J. Guibert
2004 ◽  
Vol 58 (1) ◽  
pp. 15-23 ◽  
Author(s):  
Nathalie Omnès ◽  
Annie Gravey ◽  
Raymond Marie

2005 ◽  
Vol 46 (3) ◽  
pp. 361-377 ◽  
Author(s):  
Mihaela T. Matache ◽  
Valentin Matache

AbstractA multiple fractional Brownian motion (FBM)-based traffic model is considered. Various lower bounds for the overflow probability of the associated queueing system are obtained. Based on a probabilistic bound for the busy period of an ATM queueing system associated with a multiple FBM-based input traffic, a minimal dynamic buffer allocation function (DBAF) is obtained and a DBAF-allocation algorithm is designed. The purpose is to create an upper bound for the queueing system associated with the traffic. This upper bound, called a DBAF, is a function of time, dynamically bouncing with the traffic. An envelope process associated with the multiple FBM-based traffic model is introduced and used to estimate the queue size of the queueing system associated with that traffic model.


2011 ◽  
Vol 24 (1) ◽  
pp. 1-8
Author(s):  
Branimir Trenkic ◽  
Mihajlo Stefanovic

If it is going to have practical significance, the evaluation of overflow probabilities must be (1) precise, (2) computationally stable and (3) real time compatible. The existing approximation expressions are gotten by using the traditional fluid-flow analytic techniques, which are mostly based on spectral analysis. The limitation of this approach comes from numerical difficulties caries by the spectral approach. In this paper, we suggested a fluid-flow approach in evaluating the overflow probability, which fully satisfies the above stated criteria, and removes the numerical difficulties of existing methods. The authors approach is based on the renewal argument and exploiting the similarity between fluid queues and Quasi-Birth-and-Death (QBD) processes.


Sign in / Sign up

Export Citation Format

Share Document