Publication
Title
On the maximum queue length of the hyper scalable load balancing push strategy
Author
Abstract
In this paper we derive explicit and structural results for the steady state probabilities of a structured finite state Markov chain. The study of these steady state probabilities is motivated by the analysis of the hyper scalable load balancing push strategy when using the queue-at-the-cavity approach. More specifically, these probabilities can be used to determine the largest possible arrival rate that can be supported by this strategy without exceeding some predefined maximum queue length. Contrary to prior work, we study the push strategy when the queue length information updates occur according to a phase-type renewal process with non-exponential inter-renewal times.
Language
English
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Source (book)
20th International Conference on Quantitative Evaluation of Systems, (QEST), September 20-22, 2023, Antwerp, Belgium
Publication
Cham : Springer international publishing ag , 2023
ISBN
978-3-031-43834-9
978-3-031-43835-6
DOI
10.1007/978-3-031-43835-6_9
Volume/pages
14287 (2023) , p. 127-142
ISI
001156321600009
Full text (Publisher's DOI)
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identifier
Creation 04.03.2024
Last edited 16.03.2024
To cite this reference