Approximate performance analysis of generalized join the shortest queue routing

@article{Selen2016ApproximatePA,
  title={Approximate performance analysis of generalized join the shortest queue routing},
  author={Jori Selen and I. Adan and S. Kapodistria},
  journal={EAI Endorsed Trans. Ubiquitous Environ.},
  year={2016},
  volume={3},
  pages={e3}
}
In this paper we propose a highly accurate approximate performance analysis of a heterogeneous server system with a processor sharing service discipline and a general job-size distribution under a generalized join the shortest queue (GJSQ) routing protocol. The GJSQ routing protocol is a natural extension of the well-known join the shortest queue routing policy that takes into account the non-identical service rates in addition to the number of jobs at each server. The performance metrics that… Expand
Steady-state analysis of shortest expected delay routing
Scalable Load Balancing in the Presence of Heterogeneous Servers
Scalable load balancing in networked systems: A survey of recent advances
Scalable Load Balancing Algorithms in Networked Systems
Analysis of structured multi-dimensional Markov processes

References

SHOWING 1-10 OF 17 REFERENCES
Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach
Load sharing in heterogeneous queueing systems
  • S. A. Banawan, J. Zahorjan
  • Computer Science
  • IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies
  • 1989
Analysis of join-the-shortest-queue routing for web server farms
Steady-state analysis of shortest expected delay routing
An approximation to the response time for shortest queue routing
Load balancing in processor sharing systems
Deciding Which Queue to Join: Some Counterexamples
A Basic Dynamic Routing Problem and Diffusion
Size- and state-aware dispatching problem with queue-specific job sizes
Size-based scheduling to improve web performance
...
1
2
...