Matched queueing system \(M\circ PH/G/1\)

DOI10.1007/BF02007434zbMath0788.60117MaRDI QIDQ1314941

V. Pereyra

Publication date: 1 June 1994

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

renewal processmatched queueing systemnecessary and sufficient condition for the stationarity of the systemnon-idle period

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

The matched queueing system \(GI\circ PH/PH/1\) ⋮ Double-ended queues with non-Poisson inputs and their effective algorithms ⋮ On a many-to-many matched queueing system with flexible matching mechanism and impatient customers ⋮ Stationary analyses for a double-ended queueing system with random service capacity and balking customers ⋮ Busy period for the first subsystem in a matched queueing network

Cites Work

• Unnamed Item
• Matched queueing systems with a double input
• A new informative embedded Markov renewal process for the PH/G/1 queue
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• The N/G/1 queue and its detailed analysis
• Queues with paired customers
• Moment formulas for the Markov renewal branching process
• A queue subject to extraneous phase changes

This page was built for publication: Matched queueing system \(M\circ PH/G/1\)