Queues with Slowly Varying Arrival and Service Processes

Erol Gelenbe and Catherine Rosenberg
Additional contact information
Erol Gelenbe: EHEI, Université Paris V (René Descartes), 45 rue des Saints-Pères, 75006 Paris, France
Catherine Rosenberg: Ecole Polytechnique de Montréal, Département de Génie Electrique, C.P. 6079, Succ. A, Montréal, Québec H3C 3A7, Canada

Management Science, 1990, vol. 36, issue 8, 928-937

Abstract: We examine a generalisation of the M/G/1 queue. The arrival and service processes are governed by a Markov chain which determines the rate of arrival and the service time distribution from a finite set. This Markov chain is assumed to vary "slowly", so that we are able to derive analytical results for the stationary distribution of the queue length using an approach based on decomposability. The practical interest of this model stems from the numerous applications where the parameters of queueing systems are time varying, such as inventory models, telephone systems, time-sharing systems, computer networks with bursty traffic, etc. We also show how this approach can be extended to arbitrary networks of queues and in particular to those with product form solution.

Keywords: queing; time variations; decomposition (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.36.8.928 (application/pdf)

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:inm:ormnsc:v:36:y:1990:i:8:p:928-937

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().