Skip to main content Accessibility help
×
Home

HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING

  • Philip J. Fleming (a1) and Burton Simon (a2)

Abstract

We consider an exponential queueing system with multiple stations, each of which has an infinite number of servers and a dedicated arrival stream of jobs. In addition, there is an arrival stream of jobs that choose a station based on the state of the system. In this paper we describe two heavy traffic approximations for the stationary joint probability mass function of the number of busy servers at each station. One of the approximations involves state-space collapse and is accurate for large traffic loads. The state-space in the second approximation does not collapse. It provides an accurate estimate of the stationary behavior of the system over a wide range of traffic loads.

Copyright

Related content

Powered by UNSILO

HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING

  • Philip J. Fleming (a1) and Burton Simon (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.