Chaoticity on path space for a queueing network with selection of the shortest queue among several

Abstract

We consider a network with N infinite-buffer queues with service rates λ, and global task arrival rate Nν. Each task is allocated L queues among N with uniform probability and joins the least loaded one, ties being resolved uniformly. We prove Q-chaoticity on path space for chaotic initial conditions and in equilibrium: any fixed finite subnetwork behaves in the limit N goes to infinity as an i.i.d. system of queues of law Q. The law Q is characterized as the unique solution for a non-linear martingale problem; if the initial conditions are q-chaotic, then Q0 = q, and in equilibrium Q0 = qρ is the globally attractive stable point of the Kolmogorov equation corresponding to the martingale problem. This result is equivalent to a law of large numbers on path space with limit Q, and implies a functional law of large numbers with limit (Qt)t≥0. The significant improvement in buffer utilization, due to the resource pooling coming from the choices, is precisely quantified at the limit.

Expected Values Estimated via Mean-Field Approximation are 1/N-Accurate

“…this shows that w i satisfies Equation 24for δ = min(δ * , (b − a)(a − 1)/(ab)) > 0. According to [23,Theorem 4] (see also [13,Theorem 4.1]), there exists a coupling between X (N ) and a variableX (N ) picked according to the stationary distribution of N independent M/M/1 queues such that for all j,…”

Asymptotics of the Invariant Measure in Mean Field Models with Jumps

“…The idea in fact was introduced by Kac as a simple model in kinetic theory [23] and was later studied by McKean and others (see, e.g., [25]). See [32] for an extensive account and [22] for a treatment of processes with jumps.…”

Load Balancing Policies of Web Servers: Research Analysis, Classification and Perspectives

“…SatheeshAbimannan et al, [12] focuses only on the worst case analysis of job and his policy considers only the homogeneous systems. Bas Boone et al, [13] considers two types of requests for load balancing but performs better than priority queue and round robin algorithms. Hsien-Tsung Chang et al, [14] presents load balancing of the file system like similar in google file system.…”

“…For dynamically scalable web server farms JIQ algorithm is proposed. JIQ algorithm performs well than SQ(d) algorithm [10][11][12][13][14]. The performance is observed in terms of response time.…”