Approximate performance analysis of generalized join the shortest queue routing

J. Selen; I.J.B.F. Adan; S. Kapodistria

doi:10.4108/eai.14-12-2015.2262695

Approximate performance analysis of generalized join the shortest queue routing

J. Selen, I.J.B.F. Adan, S. Kapodistria

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

Abstract

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 are of interest here are the equilibrium distribution and the mean and standard deviation of the number of jobs at each server. We show that the latter metrics are near-insensitive to the job-size distribution using simulation experiments. By applying a single queue approximation we model each server as a single server queue with a state-dependent arrival process, independent of other servers in the system, and derive the distribution of the number of jobs at the server. These state-dependent arrival rates are intended to capture the inherent correlation between servers in the original system and behave in a rather atypical way

Original language	English
Title of host publication	VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015
Editors	W. Knottenbelt, K. Wolter, A. Busic, M. Gribaudo, P. Reinecke
Place of Publication	Brussels, Belgium
Publisher	Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST)
Pages	103-110
Number of pages	8
ISBN (Electronic)	978-1-63190-096-9
DOIs	https://doi.org/10.4108/eai.14-12-2015.2262695
Publication status	Published - 2016
Event	9th EAI International Conference on Performance Evaluation Methodologies and Tools (Valuetools 2015), December 14–16, 2015, Berlin, Germany - Berlin, Germany Duration: 14 Dec 2015 → 16 Dec 2015 http://valuetools.org/2015/show/home

Conference

Conference	9th EAI International Conference on Performance Evaluation Methodologies and Tools (Valuetools 2015), December 14–16, 2015, Berlin, Germany
Abbreviated title	Valuetools 2015
Country/Territory	Germany
City	Berlin
Period	14/12/15 → 16/12/15
Internet address	http://valuetools.org/2015/show/home

Access to Document

10.4108/eai.14-12-2015.2262695Licence: Unspecified

http://arxiv.org/abs/1509.05533

Cite this

Selen, J., Adan, I. J. B. F., & Kapodistria, S. (2016). Approximate performance analysis of generalized join the shortest queue routing. In W. Knottenbelt, K. Wolter, A. Busic, M. Gribaudo, & P. Reinecke (Eds.), VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015 (pp. 103-110). Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST). https://doi.org/10.4108/eai.14-12-2015.2262695

Selen, J. ; Adan, I.J.B.F. ; Kapodistria, S. / Approximate performance analysis of generalized join the shortest queue routing. VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015. editor / W. Knottenbelt ; K. Wolter ; A. Busic ; M. Gribaudo ; P. Reinecke. Brussels, Belgium : Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST), 2016. pp. 103-110

@inproceedings{53b235d29b5748deab352fb1ab730c46,

title = "Approximate performance analysis of generalized join the shortest queue routing",

abstract = "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 are of interest here are the equilibrium distribution and the mean and standard deviation of the number of jobs at each server. We show that the latter metrics are near-insensitive to the job-size distribution using simulation experiments. By applying a single queue approximation we model each server as a single server queue with a state-dependent arrival process, independent of other servers in the system, and derive the distribution of the number of jobs at the server. These state-dependent arrival rates are intended to capture the inherent correlation between servers in the original system and behave in a rather atypical way",

author = "J. Selen and I.J.B.F. Adan and S. Kapodistria",

year = "2016",

doi = "10.4108/eai.14-12-2015.2262695",

language = "English",

pages = "103--110",

editor = "W. Knottenbelt and K. Wolter and A. Busic and M. Gribaudo and P. Reinecke",

booktitle = "VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015",

publisher = "Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST)",

note = "9th EAI International Conference on Performance Evaluation Methodologies and Tools (Valuetools 2015), December 14–16, 2015, Berlin, Germany, Valuetools 2015 ; Conference date: 14-12-2015 Through 16-12-2015",

url = "http://valuetools.org/2015/show/home",

}

Selen, J, Adan, IJBF & Kapodistria, S 2016, Approximate performance analysis of generalized join the shortest queue routing. in W Knottenbelt, K Wolter, A Busic, M Gribaudo & P Reinecke (eds), VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015. Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST), Brussels, Belgium, pp. 103-110, 9th EAI International Conference on Performance Evaluation Methodologies and Tools (Valuetools 2015), December 14–16, 2015, Berlin, Germany, Berlin, Germany, 14/12/15. https://doi.org/10.4108/eai.14-12-2015.2262695

Approximate performance analysis of generalized join the shortest queue routing. / Selen, J.; Adan, I.J.B.F.; Kapodistria, S.
VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015. ed. / W. Knottenbelt; K. Wolter; A. Busic; M. Gribaudo; P. Reinecke. Brussels, Belgium: Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST), 2016. p. 103-110.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Approximate performance analysis of generalized join the shortest queue routing

AU - Selen, J.

AU - Adan, I.J.B.F.

AU - Kapodistria, S.

PY - 2016

Y1 - 2016

N2 - 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 are of interest here are the equilibrium distribution and the mean and standard deviation of the number of jobs at each server. We show that the latter metrics are near-insensitive to the job-size distribution using simulation experiments. By applying a single queue approximation we model each server as a single server queue with a state-dependent arrival process, independent of other servers in the system, and derive the distribution of the number of jobs at the server. These state-dependent arrival rates are intended to capture the inherent correlation between servers in the original system and behave in a rather atypical way

AB - 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 are of interest here are the equilibrium distribution and the mean and standard deviation of the number of jobs at each server. We show that the latter metrics are near-insensitive to the job-size distribution using simulation experiments. By applying a single queue approximation we model each server as a single server queue with a state-dependent arrival process, independent of other servers in the system, and derive the distribution of the number of jobs at the server. These state-dependent arrival rates are intended to capture the inherent correlation between servers in the original system and behave in a rather atypical way

U2 - 10.4108/eai.14-12-2015.2262695

DO - 10.4108/eai.14-12-2015.2262695

M3 - Conference contribution

SP - 103

EP - 110

BT - VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015

A2 - Knottenbelt, W.

A2 - Wolter, K.

A2 - Busic, A.

A2 - Gribaudo, M.

A2 - Reinecke, P.

PB - Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST)

CY - Brussels, Belgium

T2 - 9th EAI International Conference on Performance Evaluation Methodologies and Tools (Valuetools 2015), December 14–16, 2015, Berlin, Germany

Y2 - 14 December 2015 through 16 December 2015

ER -

Selen J, Adan IJBF , Kapodistria S. Approximate performance analysis of generalized join the shortest queue routing. In Knottenbelt W, Wolter K, Busic A, Gribaudo M, Reinecke P, editors, VALUETOOLS'15 Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 14-16 December 2015. Brussels, Belgium: Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (ICST). 2016. p. 103-110 doi: 10.4108/eai.14-12-2015.2262695

Approximate performance analysis of generalized join the shortest queue routing

Abstract

Conference

Access to Document

Fingerprint

Cite this