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 systems with a double input

Matched queueing systems with a double input In this paper, we study the matched queueing system with a double input, M o M/PH/1, where the two inputs are two independent Poisson processes, and the service time is of PH-distribution. The L.S. transforms and the expectations of the distributions of occupation time and virtual waiting time of the type-1 customer are derived. The probability that the server is working, the mean non-idle period, and the mean busy period are also derived. The related algorithms are given with numerical results. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Matched queueing systems with a double input

Loading next page...
 
/lp/springer-journals/matched-queueing-systems-with-a-double-input-ndeFUK2gN0

References (7)

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/BF02009632
Publisher site
See Article on Publisher Site

Abstract

In this paper, we study the matched queueing system with a double input, M o M/PH/1, where the two inputs are two independent Poisson processes, and the service time is of PH-distribution. The L.S. transforms and the expectations of the distributions of occupation time and virtual waiting time of the type-1 customer are derived. The probability that the server is working, the mean non-idle period, and the mean busy period are also derived. The related algorithms are given with numerical results.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 14, 2005

There are no references for this article.