Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T01:17:39.059Z Has data issue: false hasContentIssue false

Stochastic bounds for heterogeneous-server queues with Erlang service times

Published online by Cambridge University Press:  14 July 2016

Oliver S. Yu*
Affiliation:
Stanford Research Institute

Abstract

This paper establishes stochastic bounds for the phasal departure times of a heterogeneous-server queue with a recurrent input and Erlang service times. The multi-server queue is bounded by a simple GI/E/1 queue. When the shape parameters of the Erlang service-time distributions of different servers are the same, these relations yield two-sided bounds for customer waiting times and the queue length, which can in turn be used with known results for single-server queues to obtain characterizations of steady-state distributions and heavy-traffic approximations.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1974 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable