Insensitivity of the mean field limit of loss systems under SQ(d) routeing

DOI10.1017/APR.2019.41zbMATH Open1427.60210arXiv1708.09328OpenAlexW2986699483MaRDI QIDQ5203975FDOQ5203975

Authors: Thirupathaiah Vasantam, Arpan Mukhopadhyay, Ravi R. Mazumdar 

Publication date: 9 December 2019

Published in: Advances in Applied Probability (Search for Journal in Brave)

Abstract: In this paper, we study large multi-server loss models under power-of-$d$ routing scheme when service time distributions are general with finite mean. Previous works have addressed the exponential service time case when the number of servers goes to infinity giving rise to a mean field model. The fixed point of limiting mean field equations (MFE) was shown to be insensitive to the service time distribution through simulation. Showing insensitivity to general service time distributions has remained an open problem. Obtaining the MFE in this case poses a challenge due to the resulting Markov description of the system being in positive orthant as opposed to a finite chain in the exponential case. In this paper, we first obtain the MFE and then show that the MFE has a unique fixed point that coincides with the fixed point in the exponential case thus establishing insensitivity. The approach is via a measure-valued Markov process representation and the martingale problem to establish the mean-field limit. The techniques can be applied to other queueing models.

Full work available at URL: https://arxiv.org/abs/1708.09328

Recommendations

• Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing
• Analysis of loss networks with routing
• Sensitivity to the Service-Time Distribution in the Nonstationary Erlang Loss Model
• Insensitivity in stochastic models
• Sample-path insensitivity of symmetric queues in discrete-time

zbMATH Keywords

fixed pointmean fieldinsensitivityErlang loss model\(\mathrm{SQ}(d)\)

Mathematics Subject Classification ID

Bayesian inference (62F15) Large deviations (60F10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Applied Probability and Queues
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Nonlinear Markov processes and kinetic equations.
• Title not available (Why is that?)
• On the Skorokhod topology
• Fluid models of many-server queues with abandonment
• Title not available (Why is that?)
• Law of large numbers limits for many-server queues
• Stochastic particle approximations for generalized Boltzmann models and convergence estimates
• Title not available (Why is that?)
• Title not available (Why is that?)
• Macroscopic limits for stochastic partial differential equations of McKean-Vlasov type
• Functional central limit theorems for a large network in which customers join the shortest of several queues
• Chaoticity on path space for a queueing network with selection of the shortest queue among several
• A martingale approach to the law of large numbers for weakly interacting stochastic processes
• Statistical Analysis of a Telephone Call Center
• The \(M/G/1\) processor-sharing queue with disasters
• Fluid limits for processor-sharing queues with impatience
• The Effect of Increasing Routing Choice on Resource Pooling
• On the McKean-Vlasov Limit for Interacting Diffusions
• The fluid limit of a heavily loaded processor sharing queue
• Insensitivity in processor-sharing networks
• A functional central limit theorem for the \(M/GI/\infty \) queue
• Stochastic modeling and analysis of telecoms networks
• Title not available (Why is that?)
• A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates
• Propagation of chaos for a fully connected loss network with alternate routing
• Universality of load balancing schemes on the diffusion scale
• Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
• The hydrodynamic limit of a randomized load balancing network

Cited In (3)

• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing
• <scp>Steady‐state</scp> analysis of load balancing with Coxian‐2 distributed service times

This page was built for publication: Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203975)