Exponential penalty function control of loss networks
DOI10.1214/105051604000000936zbMath1065.93036arXivmath/0503536OpenAlexW3099799156MaRDI QIDQ1769408
Publication date: 21 March 2005
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503536
trackingresource allocationlinear programexponential penalty functionloss networksapproximately optimal control policyHalfin-Whitt limiting regimepenalty-based admission control policy
Linear programming (90C05) Stochastic programming (90C15) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Optimal stochastic control (93E20) Stochastic learning and adaptive control (93E35) Discrete location and assignment (90B80)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Loss networks
- Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- Large loss networks
- Optimization via trunk reservation in single resource loss systems under heavy traffic
- Potential function methods for approximately solving linear programming problems: theory and practice.
- A broader view of Brownian networks
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
- Stochastic networks: admission and routing using penalty functions
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- The Complexity of Optimal Queuing Network Control
- Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case
- Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case
- Bounds and Policies for Dynamic Routing in Loss Networks
- Revenue Management: Research Overview and Prospects
- On-Line Load Balancing of Temporary Tasks
- Optimal Control and Trunk Reservation in Loss Networks
- The maximum concurrent flow problem
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
- On the capacity of disjointly shared networks
- Probabilistic Models of Database Locking
- The stochastic knapsack problem
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Monotonicity properties for the stochastic knapsack
- Routing and Admission Control in General Topology Networks with Poisson Arrivals
- Asymptotically Optimal Loss Network Control
- Access control to two multiserver loss queues in series
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks
- Sharing Memory Optimally
- Capacity Management in Rental Businesses with Two Customer Bases
- A Queueing Reward System with Several Customer Classes
- The Streetwalker’s Dilemma: A Job Shop Model
- A survey of computational complexity results in systems and control
- Call admission: A new approach to quality of service
This page was built for publication: Exponential penalty function control of loss networks
