# 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

#### 5 Citations

Steady-state analysis of shortest expected delay routing

- Mathematics, Computer Science
- Queueing Syst. Theory Appl.
- 2016

It is proved that the equilibrium distribution of this random walk can be expressed as a series of product forms that can be determined recursively and provides insight into the asymptotic behavior of the equilibrium probabilities as one of the state coordinates tends to infinity. Expand

Scalable Load Balancing in the Presence of Heterogeneous Servers

- Computer Science
- Perform. Evaluation
- 2021

This work adapts the “power-of- d ” versions of both the Join-the-Idle-Queue and Join- the-Shortest-Queue policies to design two corresponding families of heterogeneity-aware dispatching policies, each of which is parameterized by a pair of routing probabilities. Expand

Scalable load balancing in networked systems: A survey of recent advances

- Mathematics, Computer Science
- ArXiv
- 2018

It is demonstrated how Stochastic coupling techniques and stochastic-process limits play an instrumental role in establishing the asymptotic optimality and carries over to infinite-server settings, finite buffers, multiple dispatchers, servers arranged on graph topologies, and token-based load balancing including the popular Join-the-Idle-Queue (JIQ) scheme. Expand

Scalable Load Balancing Algorithms in Networked Systems

- Mathematics, Computer Science
- ArXiv
- 2018

This thesis designs and analyzes load balancing algorithms that aim to achieve a highly efficient distribution of tasks, optimize server utilization, and minimize communication overhead. Expand

Analysis of structured multi-dimensional Markov processes

- Computer Science
- 2017

The final author version and the galley proof are versions of the publication after peer review and the final published version features the final layout of the paper including the volume, issue and page numbers. Expand

#### References

SHOWING 1-10 OF 17 REFERENCES

Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach

- Computer Science
- IEEE Trans. Computers
- 1995

This paper provides a methodology to compute upper and lower bounds on the mean response time of the system and shows that the excellent accuracy of the computational algorithm which is achievable with modest computational cost is achievable. Expand

Load sharing in heterogeneous queueing systems

- Computer Science
- IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies
- 1989

Simulation results indicate that a simple heuristic, i.e., a generalization of the optimal policy for homogeneous systems derived from the analytic results, yields substantial performance improvement compared with no load sharing and outperforms the join-shortest-queue policy. Expand

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

- Computer Science
- Perform. Evaluation
- 2007

This work provides 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 by a one-dimensional Markov chain in a novel fashion. Expand

Steady-state analysis of shortest expected delay routing

- Mathematics, Computer Science
- Queueing Syst. Theory Appl.
- 2016

It is proved that the equilibrium distribution of this random walk can be expressed as a series of product forms that can be determined recursively and provides insight into the asymptotic behavior of the equilibrium probabilities as one of the state coordinates tends to infinity. Expand

An approximation to the response time for shortest queue routing

- Computer Science
- SIGMETRICS '89
- 1989

An approximation for the mean response time of a multiple queue system in which shortest queue routing is used is developed, based on both theoretical and experimental considerations and has an relative error of less than one half of one percent when compared to simulation. Expand

Load balancing in processor sharing systems

- Computer Science
- Telecommun. Syst.
- 2011

Analysis of optimal load balancing strategies for a multi-class multi-server processor-sharing system with a Poisson input stream, heterogeneous service rates, and a server-dependent holding cost per unit time shows that the PoA for this system can be unbounded. Expand

Deciding Which Queue to Join: Some Counterexamples

- Computer Science
- Oper. Res.
- 1986

It is shown that there are service-time distributions for which it is not optimal to always join the shortest queue, and that if the elapsed service times of customers in service are known, the long-run average delay is not always minimized by customers joining the queue that minimizes their individual expected delays. Expand

A Basic Dynamic Routing Problem and Diffusion

- Computer Science
- IEEE Trans. Commun.
- 1978

A dynamic routing policy where messages that arrive at a certain node are routed to leave the node on the link having the shorter queue, and it is found that the average delay for the dynamic system is better by a factor of K. Expand

Size- and state-aware dispatching problem with queue-specific job sizes

- Computer Science
- Eur. J. Oper. Res.
- 2012

This work derives the so-called size-aware relative values of states with respect to the sojourn time in an M/G/1 queue operating under FIFO, LifO, SPT or SRPT disciplines, which turn out to be insensitive to the form of the job size distribution. Expand

Size-based scheduling to improve web performance

- Computer Science
- TOCS
- 2003

A method for improving the performance of web servers servicing static HTTP requests to give preference to requests for small files or requests with short remaining file size, in accordance with the SRPT (Shortest Remaining Processing Time) scheduling policy. Expand