Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Matched queueing system MoPH/G/1

Matched queueing system MoPH/G/1 In this paper, we study the matched queueing system, MoPH/G/1, where the type-I input is a Poisson process, the type-II input is a PH renewal process, and the service times are i.i.d. random variables. A necessary and sufficient condition for the stationariness of the system is given. The expectations of the length of the non-idle period and the number of customers served in a non-idle period are obtained. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Matched queueing system MoPH/G/1

Loading next page...
 
/lp/springer-journals/matched-queueing-system-moph-g-1-8rAH0zspsa

References (11)

Publisher
Springer Journals
Copyright
Copyright © 1993 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02007434
Publisher site
See Article on Publisher Site

Abstract

In this paper, we study the matched queueing system, MoPH/G/1, where the type-I input is a Poisson process, the type-II input is a PH renewal process, and the service times are i.i.d. random variables. A necessary and sufficient condition for the stationariness of the system is given. The expectations of the length of the non-idle period and the number of customers served in a non-idle period are obtained.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 13, 2005

There are no references for this article.