Two parallel finite queues with simultaneous services and Markovian arrivals. (1997)

• Record Type: Journal Article
• Authors: Chakravarthy, S. R.; Thiagarajan, S.
• Is Part Of: Journal of applied mathematics and stochastic analysis. Volume 10:Number 4(1997)
• Page Start: 383
• Page End: 405
• Publication Date: 1997
• Subjects: Markov chains -- Markovian arrival process (MAP) -- renewal process -- queues -- finite capacity -- exponential services and algorithmic probability; Mathematical models -- Periodicals; Computer simulation -- Periodicals; Computer science -- Mathematics -- Periodicals; Computer science -- Mathematics; Computer simulation; Mathematical models; Applied Mathematics; Periodicals; Electronic journals; 519.22
• DOI: 10.1155/S1048953397000439
• Languages: English
• ISSNs: 1048-9533

Abstract

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.