Analysis of join-the-shortest-queue routing for web server farms

Authors:
Varun Gupta;Mor Harchol Balter;Karl Sigman;Ward Whitt
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA;Department of Industrial Engineering and Operations Research, Columbia University, NY 10027, USA;Department of Industrial Engineering and Operations Research, Columbia University, NY 10027, USA
Venue:
Performance Evaluation
Year:
2007

Citing 12
Cited 10

Boundary value problems in queueing theory

Queueing Systems: Theory and Applications
An approximation to the response time for shortest queue routing

SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On Job Assignment for a Parallel System of Processor Sharing Queues

IEEE Transactions on Computers
Self-similarity in World Wide Web traffic: evidence and possible causes

Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Generating representative Web workloads for network and server performance evaluation

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On choosing a task assignment policy for a distributed server system

Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Task assignment with unknown duration

Journal of the ACM (JACM)
Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach

IEEE Transactions on Computers
Size-based scheduling to improve web performance

ACM Transactions on Computer Systems (TOCS)
Heavy-Traffic Limits for the G/H2*/n/m Queue

Mathematics of Operations Research
Matrix-geometric analysis of the shortest queue problem with threshold jockeying

Operations Research Letters
Comparison conjectures about the M/G/ s queue

Operations Research Letters

Optimal File Splitting for Wireless Networks with Concurrent Access

NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
Price of anarchy in non-cooperative load balancing

INFOCOM'10 Proceedings of the 29th conference on Information communications
Smoothed functional and quasi-newton algorithms for routing in multi-stage queueing network with constraints

ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
M/M/1-PS queue and size-aware task assignment

Performance Evaluation
Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services

Performance Evaluation
Dispatching problem with fixed size jobs and processor sharing discipline

Proceedings of the 23rd International Teletraffic Congress
Price of anarchy in non-cooperative load balancing games

Performance Evaluation
Minimizing slowdown in heterogeneous size-aware dispatching systems

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Asymptotic Optimality of Balanced Routing

Operations Research
Optimizing service replication in clouds

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, whereas it is known that web server farms are better modeled as Processor Sharing (PS) server farms. We provide the first approximate analysis of JSQ in the PS server farm model for general job-size distributions, obtaining the distribution of queue length at each queue. To do this, we approximate the queue length of each queue in the server farm by a one-dimensional Markov chain, in a novel fashion. We also discover some interesting insensitivity properties of PS server farms with JSQ routing, and discuss the near-optimality of JSQ.