Computer Science Department
School of Computer Science, Carnegie Mellon University


Simulation Results for JSQ Server Farms
with Processor Sharing Servers

Varun Gupta, Mor Harchol-Balter,
Karl Sigman*, Ward Whitt*

September 2007

Keywords: Shortest queue routing, JSQ, processor sharing, insensitivity, single-queue approximation

In [1] we present the first analysis of Join-the-Shortest-Queue (JSQ) routing in Web server farms, with Processor-Sharing (PS) servers. Please see that paper for details about the JSQ routing policy and its analysis, and for the relevant references. The analytical work in [1] was backed up by many simulation experiments, not all of which made it into the paper. This document is meant to serve as an online supplement to [1], providing the full set of simulation results and comparisons with analytical results. We hope that these will be useful for those who wish to extend our work on this problem.

22 pages

*Department of Industrial Engineering and Operations Research, Columbia University, New York, NY.

[1] Varun Gupta, Mor Harchol-Balter, Karl Sigman, and Ward Whitt. Analysis of join-the-shortest-queue routing for web server farms. In PERFORMANCE 2007. IFIP WG 7.3 International Symposium on Computer Modeling, Measurement and Evaluation, Cologne, Germany, October 2007.

Return to: SCS Technical Report Collection
School of Computer Science

This page maintained by