Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies
From MaRDI portal
Publication:339718
DOI10.1016/j.cor.2012.05.004zbMath1349.90229MaRDI QIDQ339718
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.004
admission control; deadlines; routing; e-services; index policies; multiclusters; parallel multiserver queues; soft real-time
90B22: Queues and service in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits, Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization
Cites Work
- Unnamed Item
- Unnamed Item
- Power and performance control of soft real-time web server clusters
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- Two approaches to optimal routing and admission control in systems with real-time traffic
- Restless bandits, partial conservation laws and indexability
- Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing
- Joining the right queue: a state-dependent decision rule
- DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- Optimal control of admission to a quenching system
