Two parallel finite queues with simultaneous services and Markovian arrivals

S. R. Chakravarthy and S. Thiagarajan

International Journal of Stochastic Analysis, 1997, vol. 10, 1-23

Abstract:

In this paper, we consider a finite capacity single server queueing model with two buffers, A and B , of sizes K and N respectively. Messages arrive one at a time according to a Markovian arrival process. Messages that arrive at buffer A are of a different type from the messages that arrive at buffer B . Messages are processed according to the following rules: 1. When buffer A ( B ) has a message and buffer B ( A ) is empty, then one message from A ( B ) is processed by the server. 2. When both buffers, A and B , have messages, then two messages, one from A and one from B , are processed simultaneously by the server. The service times are assumed to be exponentially distributed with parameters that may depend on the type of service. This queueing model is studied as a Markov process with a large state space and efficient algorithmic procedures for computing various system performance measures are given. Some numerical examples are discussed.

Date: 1997
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/10/394369.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/10/394369.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:394369

DOI: 10.1155/S1048953397000439

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().