Back to results
Bibliographic record · Consultation and access
Artículo

Asymptotics of insensitive load balancing and blocking phases

Jonckheere, Matthieu Thimothy Samson et al · Springer · 2018

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.

Resource access

Open the content from the main option or choose another available source.

CONICET Digital CONICET Digital OAI-PMH
Entrar por CONICET Digital
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

We study a single class of traffic acting on a symmetric set of processor-sharing queues with finite buffers, and we consider the case where the load scales with the number of servers. We address the problem of giving robust performance bounds based on the study of the asymptotic behaviour of the insensitive load balancing schemes, which have the desirable property that the stationary distribution of the resulting stochastic network depends on the distribution of job-sizes only through its mean. It was shown for small systems with losses that they give good estimates of performance indicators, generalizing henceforth Erlang formula, whereas optimal policies are already theoretically and computationally out of reach for networks of moderate size. We characterize the response of symmetric systems under those schemes at different scales and show that three amplitudes of deviations can be identified according to whether ρ< 1 , ρ= 1 , or ρ> 1. A central limit scaling takes place for a sub-critical load; for ρ= 1 , the number of free servers scales like nθθ+1 (θ being the buffer depth and n being the number of servers) and is of order 1 for super-critical loads. This further implies the existence of different phases for the blocking probability. Before a (refined) critical load ρc(n)=1-an-θθ+1, the blocking is exponentially small and becomes of order n-θθ+1 at ρc(n). This generalizes the well-known quality-and-efficiency-driven regime, or Halfin—Whitt regime, for a one-dimensional queue and leads to a generalized staffing rule for a given target blocking probability. Fil: Jonckheere, Matthieu Thimothy Samson. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Cálculo; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina Fil: Prabhu, Balakrishna J.. Centre National de la Recherche Scientifique; Francia

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Jonckheere, M. T. S. E. A. (2018). Asymptotics of insensitive load balancing and blocking phases. http://hdl.handle.net/11336/55549

MLA

Jonckheere, Matthieu Thimothy Samson et al. "Asymptotics of insensitive load balancing and blocking phases." 2018. http://hdl.handle.net/11336/55549.

Chicago

Jonckheere, Matthieu Thimothy Samson et al. 2018. "Asymptotics of insensitive load balancing and blocking phases.". http://hdl.handle.net/11336/55549.

Harvard

Jonckheere, M. T. S. E. A. 2018, Asymptotics of insensitive load balancing and blocking phases, Springer, available at: http://hdl.handle.net/11336/55549 [Accessed 8 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Asymptotics of insensitive load balancing and blocking phases
Author / contributors
Jonckheere, Matthieu Thimothy Samson et al
Publisher
Springer
Publication year
2018
ISSN
0257-0130
ISSN
0257-0130
Language
English

Subjects

Explore related resources through these subjects.

Copied