Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-07T22:05:58.977Z Has data issue: false hasContentIssue false

COMPARISONS BETWEEN CERTAIN QUEUING SYSTEMS

Published online by Cambridge University Press:  11 January 2002

Torgny Lindvall
Affiliation:
Department of Mathematics, University of Göteborg, 41296 Göteborg, Sweden, E-mail: lindvall@math.chalmers.se
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We use a Poisson imbedding technique to investigate the possibilities of generalizing some pathwise and stochastic monotonicity results from the M/M/k queues to systems with monotone failure rate service time distribution. A dichotomy between the decreasing failure rate (DFR) and the increasing failure rate (IFR) cases is revealed: In the DFR case, we achieve that the number of customers in the systems is stochastically increasing if it is idle at time 0, whereas in the IFR case, there is an alternating character that renders a bound between two identical systems that have different initial conditions. We also explore how our methods work in a comparison between systems with different numbers of stations but the same maximal capacity.

Information

Type
Research Article
Copyright
© 2002 Cambridge University Press