A Multi-Server Retrial Queue with BMAP Arrivals and Group Services

Authors:
Srinivas R. Chakravarthy;Alexander N. Dudin
Affiliations:
Department of Industrial and Manufacturing Engineering and Business, Kettering University, Flint, MI, USA schakrav@kettering.edu;Department of Applied Mathematics and Computer Science, Belarussian State University, Minsk, Belarus dudin@bsu.by
Venue:
Queueing Systems: Theory and Applications
Year:
2002

Citing 9
Cited 7

A simple telephone exchange with delayed feedbacks

Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
A survey on retrial queues

Queueing Systems: Theory and Applications
A survey of retrial queues

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Numerical investigation of a multiserver retrial model

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Introduction to matrix analysis (2nd ed.)

Introduction to matrix analysis (2nd ed.)
A retrial BMAP/SM/1 system with linear repeated requests

Queueing Systems: Theory and Applications
Queueing system BMAP/G/1 with repeated calls

Mathematical and Computer Modelling: An International Journal
The stationary distribution of a markovian process arising in the theory of multiserver retrial queueing systems

Mathematical and Computer Modelling: An International Journal
Accessible bibliography on retrial queues

Mathematical and Computer Modelling: An International Journal

Multi-server retrial model with variable number of active servers

Computers and Industrial Engineering
Analysis of a multi-server retrial queue with search of customers from the orbit

Performance Evaluation
Multi-server retrial queue with negative customers and disasters

Queueing Systems: Theory and Applications
Multi-server retrial model with variable number of active servers

Computers and Industrial Engineering
A multi-server perishable inventory system with negative customer

Computers and Industrial Engineering
Analysis of a retrial queuing model with MAP arrivals and two types of customers

Mathematical and Computer Modelling: An International Journal
A finite source multi-server inventory system with service facility

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a c-server queuing model in which customers arrive according to a batch Markovian arrival process (BMAP). These customers are served in groups of varying sizes ranging from a predetermined value L through a maximum size, K. The service times are exponentially distributed. Any customer not entering into service immediately orbit in an infinite space. These orbiting customers compete for service by sending out signals that are exponentially distributed with parameter &thetas;. Under a full access policy freed servers offer services to orbiting customers in groups of varying sizes. This multi-server retrial queue under the full access policy is a QBD process and the steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. Some interesting numerical examples are discussed.