Abstract
AbstractThis paper considers a multi-type fluid queue with priority service. The input fluid rates are modulated by a Markov chain, which is common for all fluid types. The service rate of the queue is constant. Various performance measures are derived, including the Laplace–Stieltjes transform and the moments of the stationary waiting time of the fluid drops and the queue length distributions. An Erlangization-based numerical method is also provided to approximate the waiting time and the queue length distributions up to arbitrary precision. All performance measures are formulated as reward accumulation problems during busy periods of simple Markovian fluid flow models, for which efficient matrix-analytic solutions are provided, enabling us to solve large models with several hundred states.
Funder
Országos Tudományos Kutatási Alapprogramok
Emberi Eroforrások Minisztériuma
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Management Science and Operations Research,Computer Science Applications
Reference24 articles.
1. Miller Jr., R.G.: Priority queues. Ann. Math. Stat. 31, 86–103 (1960)
2. Takine, T.: A nonpreemptive priority MAP/G/1 queue with two classes of customers. J. Oper. Res. Soc. Jpn. 39(2), 266–290 (1996)
3. Horváth, G.: Efficient analysis of the MMAP[K]/PH[K]/1 priority queue. Eur. J. Oper. Res. 246(1), 128–139 (2015)
4. Ramaswami, V.: Matrix analytic methods for stochastic fluid flows. In: Teletraffic Engineering in a Competitive World—Proceedings of the 16th International Teletraffic Congress (ITC 16), Elsevier, pp. 1019–1030 (1999)
5. Knessl, C., Tier, C.: A simple fluid model for servicing priority traffic. IEEE Trans. Autom. Control 46(6), 909–914 (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献