Analysis of a nonpreemptive priority queue with SPP arrivals of high class
Authors:
- Akira SugaharaASAkira Sugahara
- Tetsuya TakineTTTetsuya Takine
- Yutaka TakahashiYTYutaka Takahashi
- Toshiharu HasegawaTHToshiharu Hasegawa
- 1 January 1995
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 21 (3) , 215-238
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Mean waiting times in nonpreemptive priority queues with Markovian Arrival and i.i.d. service ProcessesPerformance Evaluation, 1994
- An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classesIEEE Transactions on Communications, 1994
- The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priorityCommunications in Statistics. Stochastic Models, 1994
- A batchSPP/G/1 queue with multiple vacations and exhaustive service disciplineTelecommunication Systems, 1993
- Analysis of an SPP/G/1 system with multiple vacations and E-limited service disciplineQueueing Systems, 1993
- A distributional form of Little's LawOperations Research Letters, 1988
- The SPP/G/1 queue: A single server queue with a switched Poisson process as input processOR Spectrum, 1983
- Algorithm 368: Numerical inversion of Laplace transforms [D5]Communications of the ACM, 1970
- Priority QueuesOperations Research, 1964
- Priority QueuesThe Annals of Mathematical Statistics, 1960