Choosing among heterogeneous server clouds

DOI10.1007/s11134-016-9488-8zbMath1368.60100MaRDI QIDQ2360877

Arpan Mukhopadhyay, A. Karthik, Ravi R. Mazumdar

Publication date: 29 June 2017

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/116202/2/WRAP-choosing-heterogeneous-server-clouds-Mukhophyay-2016.pdf

zbMATH Keywords

propagation of chaos; mean field; heterogeneous server clouds; multirate loss model

Mathematics Subject Classification ID

90B15: Stochastic network models in operations research

60K35: Interacting random processes; statistical mechanics type models; percolation theory

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

60J27: Continuous-time Markov processes on discrete state spaces

60J28: Applications of continuous-time Markov processes on discrete state spaces

Related Items

Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing, A Theory of Auto-Scaling for Resource Reservation in Cloud Services, Self-Learning Threshold-Based Load Balancing, Scalable Load Balancing in Networked Systems: A Survey of Recent Advances, Mean field approximations to a queueing system with threshold-based workload control scheme, Analysis of large urn models with local mean-field interactions

Uses Software

• Azure

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic independence of queues under randomized load balancing
• A mean field limit for a lattice caricature of dynamic routing in circuit switched networks
• Ecole d'été de probabilités de Saint-Flour XIX, France, du 16 août au 2 septembre 1989
• Propagation of chaos for a fully connected loss network with alternate routing
• Ordinary differential equations in Banach spaces
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Fast Jackson networks
• Loss circuit switched communication network -- performance analysis and dynamic routing
• A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• Chaoticity on path space for a queueing network with selection of the shortest queue among several
• The Effect of Increasing Routing Choice on Resource Pooling
• The Supermarket Game
• Partial balance and insensitivity
• Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
• A Note on Insensitivity in Stochastic Networks