skip to main content
short-paper

Light traffic performance under the power of two load balancing strategy: the case of server heterogeneity

Authors Info & Claims
Published:04 September 2014Publication History
Skip Abstract Section

Abstract

We consider the power-of-two policy with d = 2, Poisson job arrivals, heterogeneous servers and a general job requirement distribution. With the help of the first two light traffic derivatives for the average job response time, we point to interesting structural features associated with server heterogeneity in light traffic.

References

  1. V. Gupta, M. Harchol Balter, K. Sigman and W. Whitt, "Analysis of join-the-shortest-queue routing for web server farms," Performance Evaluation 64 (2007), pp. 1062--1081. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Harchol Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action, Cambridge University Press, Cambridge (UK), 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Izagirre, U. Ayesta and I.M. Verloop, "Sojourn time approximations in a multi-class time-sharing server," in Proceedings of IEEE Infocom 2014, Toronto (ON), April 2014.Google ScholarGoogle Scholar
  4. A. Izagirre and A.M. Makowski, "Light traffic behavior under the power-of-two load balancing strategy: The heterogeneous case," Performance Evaluation. To be submitted (2014).Google ScholarGoogle Scholar
  5. A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, San Diego (CA), 1979.Google ScholarGoogle Scholar
  6. M. Mitzenmacher, "The power of two choices in randomized load balancing," IEEE Transactions on Parallel and Distributed Systems TPDS-12 (2001), pp. 1094--1104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Mukhopadhyay and R.R. Mazumdar, "Analysis of randomized join-the-shortest-queue (JSQ) schemes in large heterogeneous processor sharing systems," Submitted (2013).Google ScholarGoogle Scholar
  8. M.I. Reiman and B. Simon, "An interpolation approximation for queueing systems with Poisson input," Operations Research 36 (1988), pp. 454--469. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M.I. Reiman and B. Simon, "Open queueing systems in light traffic," Mathematics of Operations Research 14 (1989), pp. 26--59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. N.D. Vvedenskaya, R.L. Dobrushin and F.I. Karpelevich, "Queueing system with selection of the shortest of two queues: An asymptotic approach," Problems of Information Transmission 32 (1996), pp. 20--34.Google ScholarGoogle Scholar
  11. W. Whitt, "Deciding which queue to join: Some counterexamples," Operations Research 34 (1986), pp. 55--62. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 42, Issue 2
    September 2014
    74 pages
    ISSN:0163-5999
    DOI:10.1145/2667522
    Issue’s Table of Contents

    Copyright © 2014 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 4 September 2014

    Check for updates

    Qualifiers

    • short-paper

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader