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

DOI10.1287/STSY.2018.0020MaRDI QIDQ5113890zbMATH OpenOpenAlexWikidataFDO

Authors Refael Hassin, Liron Ravner

Publication date 18 June 2020

Published in Stochastic Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 3174016 (Why is no real title available?)
• scientific article; zbMATH DE number 3484308 (Why is no real title available?)
• scientific article; zbMATH DE number 3490221 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• An Introduction to Heavy-Tailed and Subexponential Distributions
• Convex infinite horizon programs
• Convexity properties of the overflow in an ordered-entry system with heterogeneous servers
• Dynamic routing in large-scale service systems with heterogeneous servers
• Heavy-Traffic Approximations for Service Systems With Blocking
• Heterogeneous-server loss systems with ordered entry: An anomaly
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• Markov decision processes with state-dependent discount factors and unbounded rewards/costs
• On the Limiting Distribution of the Number of Coincidences Concerning Telephone Traffic
• Optimal Server Allocation in a System of Multi-Server Stations
• 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
• Optimal service‐capacity allocation in a loss system
• Performance modelling of nonhomogeneous unreliable multiserver systems using MOSEL
• Risk-Sensitive Control for the Parallel Server Model
• Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
• The Arrangement of Servers in an Ordered-Entry System
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl

Cited in

(3)

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

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)