Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-26T19:22:58.988Z Has data issue: false hasContentIssue false
  • English
  • Français

Busy periods in fluid queues with multiple emptying input states

Published online by Cambridge University Press:  14 July 2016

A. J. Field  and
P. G. Harrison
A. J. Field*
Affiliation:
Imperial College London
P. G. Harrison*
Affiliation:
Imperial College London
*
∗Postal address: Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK.
∗Postal address: Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A semi-numerical method is derived to compute the Laplace transform of the equilibrium busy period probability density function in a fluid queue with constant output rate when the buffer is nonempty. The input process is controlled by a continuous-time semi-Markov chain (CTSMC) with n states such that in each state the input rate is constant. The holding time in states with net positive output rate - so-called emptying states - is assumed to be an exponentially distributed random variable, whereas in states with net positive input rate - so-called filling states - it may have an arbitrary probability distribution. The result is demonstrated by applying it to various systems, including fluid queues with two on-off input sources. The latter exercise in part shows consistency with prior results but also solves the problem in the case where there are two emptying states. Numerical results are presented for selected examples which expose discontinuities in the busy period distribution when the number of emptying states changes, e.g. as a result of increasing the fluid arrival rate in one or more states of the controlling CTSMC.

Keywords

Fluid queuebusy periodCTSMCdiscontinuity

MSC classification

Secondary: 68U99: None of the above, but in this section 90C99: None of the above, but in this section
Type
Research Article
Information
Journal of Applied Probability , Volume 47 , Issue 2 , June 2010 , pp. 474 - 497
Copyright
Copyright © Applied Probability Trust 2010 

References

[1] Abate, J. and Valkó, P. (2004). Multi-precision Laplace transform inversion. Internat. J. Numer. Meth. Eng. 60, 979–993.Google Scholar
[2] Barbot, N. and Sericola, B. (2003). Exact stationary solution to tandem fluid queues. Internat. J. Simul. Systems Sci. Tech. 4, 12–20.Google Scholar
[3] Barbot, N., Sericola, B. and Telek, M. (2001). Distribution of busy period in stochastic fluid models. Stoch. Models 17, 407–427.Google Scholar
[4] Boxma, O. J. and Dumas, V. (1998). The busy period in the fluid queue. In ACM SIGMETRICS Performance Evaluation Review, ACM, New York, pp. 100–110.Google Scholar
[5] Field, A. J. and Harrison, P. G. (2007). An approximate compositional approach to the analysis of fluid queue networks. Performance Evaluation 64, 1137–1152.CrossRefGoogle Scholar
[6] Guilleman, F. and Sericola, B. (2007). Stationary analysis of a fluid queue driven by some countable state space Markov chain. Methodology Comput. Appl. Prob. 9, 521–540.CrossRefGoogle Scholar
[7] Gupta, V. and Harrison, P. G. (2008). Fluid level in a reservoir with on-off source. In Proc. 10th Workshop Math. Performance Modeling Analysis (MAMA, 2008), ACM, pp. 128–130.Google Scholar
[8] Harrison, P. G., Patel, N. M. and Zertal, S. (2010). Response time distribution of flash memory accesses. Performance Evaluation 67, 248–259.Google Scholar
[9] Mandjes, M., Mitra, D. and Scheinhart, W. (2003). Simple models of network access, with applications to the design of Joint rate and admission control. Comput. Networks 41, 489–504.Google Scholar
[10] Mitra, D. (1988). Stochastic theory of a fluid model of producers and consumers coupled by a buffer. Adv. Appl. Prob. 20, 646–676.Google Scholar
[11] Rabehasaina, L. (2006). {Moments of a Markov-modulated, irreducible network of fluid queues}. J. Appl. Prob. 43, 510–522.CrossRefGoogle Scholar
[12] Sericola, B. and Tuffin, B. (1999). A fluid queue driven by a Markovian queue. Queueing Systems 31, 253–264.Google Scholar
[13] Van Foreest, N., Mandjes, M. and Scheinhardt, W. (2003). Analysis of a feedback fluid model for heterogeneous TCP sources. Stoch. Models 19, 299–324.CrossRefGoogle Scholar
[14] Virtamo, J. and Norros, I. (1994). Fluid queue driven by an {M/M/1} queue. Queueing Systems 16, 373–386.Google Scholar