SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

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

ArticleShelves

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

Varun Gupta2007

OA

Articlegreen2007

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

Varun Gupta · Mor Harchol‐Balter · Karl Sigman · Ward Whitt

219 citations·0/0 files stored·Performance Evaluation

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Distributed and Parallel Computing Systems

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 219 citations exist upstream.

References

1981Point Processes and Queues 1977Optimality of the shortest line discipline 1978On the optimal assignment of customers to parallel servers 1980A simple dynamic routing problem 1983Boundary Value Problems in Queueing System Analysis 1961Two Similar Queues in Parallel

Cited by

2010Load balancing in processor sharing systems 2016Universality of Power-of-$d$ Load Balancing in Many-Server Systems 2018Universality of Power-of-d Load Balancing in Many-Server Systems 2022Scalable Load Balancing in Networked Systems: A Survey of Recent Advances 2019Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime 2011Size- and state-aware dispatching problem with queue-specific job sizes 2015Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems 2012Asymptotic Optimality of Balanced Routing

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

1993Dynamic routing in open queueing networks: Brownian models, cut constraints and resource poolingarticle · 4 shared references 1993An approximation for the mean response time for shortest queue routing with general interarrival and service timesarticle · 4 shared references 1995Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approacharticle · 4 shared references 1989An approximation to the response time for shortest queue routingother · 4 shared references 2005Analysis of multi-server systems via dimensionality reduction of markov chainsarticle · 4 shared references 1996An approximate analysis of the join the shortest queue (JSQ) policyarticle · 4 shared references

Details

Year2007

Typearticle

Published2007-06-29

VenuePerformance Evaluation

ISSN-L0166-5316

Languageen

Citations219

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1016/j.peva.2007.06.012

openalex_workW2148777482

Links

Imported from OpenAlex (CC0) — nothing here is generated.