Optimization via trunk reservation in single resource loss systems under heavy traffic
From MaRDI portal
Publication:1379722
DOI10.1214/AOAP/1043862424zbMath0890.60088OpenAlexW2015861993MaRDI QIDQ1379722
Publication date: 23 June 1998
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1043862424
Queues and service in operations research (90B22) Optimal stochastic control (93E20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (11)
A Theory of Auto-Scaling for Resource Reservation in Cloud Services ⋮ OPTIMAL ADMISSION AND ROUTING WITH CONGESTION-SENSITIVE CUSTOMER CLASSES ⋮ Large deviations of mean-field interacting particle systems in a fast varying environment ⋮ Optimal trunk reservation for an overloaded link ⋮ On equilibrium analysis of acyclic multiclass loss networks under admission control ⋮ Asymptotically exact analysis of a loss network with channel continuity ⋮ Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic ⋮ Exponential penalty function control of loss networks ⋮ Optimality of randomized trunk reservation for a problem with a single constraint ⋮ Asymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow Traffic ⋮ Optimal Admission Controls for Erlang's Loss System with Phase-Type Arrivals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Loss networks
- Effective bandwidths at multi-class queues
- Effective banwidths for the multi-type UAS channel
- State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
- Large loss networks
- Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
- Optimal Control and Trunk Reservation in Loss Networks
- On the Optimality of Trunk Reservation in Overflow Processes
- Dynamic Routing in Fully Connected Networks
- Blocking probabilities in large circuit-switched networks
- The stochastic knapsack problem
- Applying a New Device in the Optimization of Exponential Queuing Systems
- State-dependent routing on symmetric loss networks with trunk reservations. I
- Asymptotically Optimal Loss Network Control
- Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
- Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks
- Pathological behaviour in loss networks
- A Queueing Reward System with Several Customer Classes
- A paradox of congestion in a queuing network
This page was built for publication: Optimization via trunk reservation in single resource loss systems under heavy traffic