Mean waiting times in nonpreemptive priority queues with Markovian Arrival and i.i.d. service Processes
Authors:
- Tetsuya TakineTTTetsuya Takine
- Yutaka MatsumotoYMYutaka Matsumoto
- Tatsuya SudaTSTatsuya Suda
- Toshiharu HasegawaTHToshiharu Hasegawa
- 1 May 1994
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 20 (1-3) , 131-149
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Characterization of video codecs as autoregressive moving average processes and related queueing system performanceIEEE Journal on Selected Areas in Communications, 1991
- New results on the single server queue with a batch markovian arrival processCommunications in Statistics. Stochastic Models, 1991
- A single-server queue with server vacations and a class of non-renewal arrival processesAdvances in Applied Probability, 1990
- Experimental results on matrix-analytical solution techniques–extensions and comparisonsCommunications in Statistics. Stochastic Models, 1989
- A stable recursion for the steady state vector in markov chains of m/g/1 typeCommunications in Statistics. Stochastic Models, 1988
- A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer PerformanceIEEE Journal on Selected Areas in Communications, 1986
- OpsearchCommunications in Statistics. Stochastic Models, 1985
- Finite Markov chain models skip‐free in one directionNaval Research Logistics Quarterly, 1984
- Service in a Loop SystemJournal of the ACM, 1972
- Priority QueuesThe Annals of Mathematical Statistics, 1960