Delay-minimizing capacity allocation in an infinite server-queueing system

DOI10.1287/STSY.2018.0020zbMATH Open1446.60068arXiv1608.02753OpenAlexW2963410157WikidataQ128206327 ScholiaQ128206327MaRDI QIDQ5113890FDOQ5113890

Authors: Refael Hassin, Liron Ravner 

Publication date: 18 June 2020

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

Abstract: We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is an infinite sequence of service rates. We study the probabilistic properties of this system by considering overflows from sub-systems with a finite number of servers. Several stability measures are suggested and analysed. The tail of the series of service rates that minimizes the average expected delay (service time) is shown to be approximately geometrically decreasing. We use this property in order to approximate the optimal allocation of service rates by constructing an appropriate dynamic program.

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

Recommendations

• Optimal capacity assignment in general queueing networks
• Optimal server allocation in general, finite, multi-server queueing networks
• Optimal service‐capacity allocation in a loss system
• Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
• Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas

zbMATH Keywords

queuescapacity allocationheterogeneous serversinfinite state dynamic programming

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• An Introduction to Heavy-Tailed and Subexponential Distributions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex infinite horizon programs
• Title not available (Why is that?)
• Dynamic routing in large-scale service systems with heterogeneous servers
• Markov decision processes with state-dependent discount factors and unbounded rewards/costs
• Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• Optimal Server Allocation in a System of Multi-Server Stations
• Heavy-Traffic Approximations for Service Systems With Blocking
• Performance modelling of nonhomogeneous unreliable multiserver systems using MOSEL
• Optimal service‐capacity allocation in a loss system
• Risk-Sensitive Control for the Parallel Server Model
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• On the Limiting Distribution of the Number of Coincidences Concerning Telephone Traffic
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• Convexity properties of the overflow in an ordered-entry system with heterogeneous servers
• The Arrangement of Servers in an Ordered-Entry System
• Heterogeneous-server loss systems with ordered entry: An anomaly
• Optimal routing to parallel heterogeneous servers-small arrival rates
• Optimal server selection in a queueing loss model with heterogeneous exponential servers, discriminating arrivals, and arbitrary arrival times
• Title not available (Why is that?)

Cited In (3)

• A note on the allocation of queuing facilities using a minisum criterion
• Optimal capacity assignment in general queueing networks
• An infinite server system with general packing constraints

This page was built for publication: Delay-minimizing capacity allocation in an infinite server-queueing system

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