A finite queue with a Markov input dependent on the state of the system and a random service discipline

zbMATH Open0928.60071MaRDI QIDQ1287295

P. P. Bocharov

Publication date: 31 August 1999

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

matrix algorithmstationary probabilitiesMarkov inputsingle-server finite-capacity queue

Mathematics Subject Classification ID

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

Related Items (4)

Analysis of a finite queue with Markov flow and arbitrary servicing that depends on the number of system customers ⋮ Heterogeneous Queueing System MR(S)/M(S)/∞ with Service Parameters Depending on the State of the Underlying Markov Chain ⋮ Title not available (Why is that?) ⋮ A queueing system with inverse discipline, two types of customers, and Markov input flow

Recommendations

• Stationary distribution of a finite queue with recurrent input and Markov service 👍 👎
• A queueing system with Markov arrivals and random discipline 👍 👎
• Analysis of a finite queue with Markov flow and arbitrary servicing that depends on the number of system customers 👍 👎
• Markovian bulk-arrival and bulk-service queues with state-dependent control 👍 👎
• A single-server finite-capacity queueing system with Markov flow and discrete-time service 👍 👎
• On queues with Markov modulated service rates 👍 👎
• A queueing system with Markov-dependent arrivals 👍 👎
• A finite capacity G_(1,2)/ M_(1,2)/1 queue with markov dependent shift in service 👍 👎
• Infinite-server queueing tandem with Markovian arrival process and service depending on its state 👍 👎

This page was built for publication: A finite queue with a Markov input dependent on the state of the system and a random service discipline

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1287295)