Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies

DOI10.1016/J.COR.2012.05.004MaRDI QIDQ339718zbMATH OpenOpenAlexFDO

Authors José Niño-Mora

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

zbMATH Keywords

admission controlroutingdeadlinese-servicesindex policiesmulticlustersparallel multiserver queuessoft real-time

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies
• Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
• Index policies for the routing of background jobs
• Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
• Dynamic routing of real-time jobs among parallel EDF queues: a performance study

Cites work

• scientific article; zbMATH DE number 4087408 (Why is no real title available?)
• DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Fundamentals of queueing theory
• Joining the right queue: a state-dependent decision rule
• 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
• Power and performance control of soft real-time web server clusters
• Restless bandits, partial conservation laws and indexability
• Service-level differentiation in many-server service systems via queue-ratio routing
• Two approaches to optimal routing and admission control in systems with real-time traffic

Cited in

(10)

• Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization
• Whittle indexability in egalitarian processor sharing systems
• A verification theorem for threshold-indexability of real-state discounted restless bandits
• Whittle index based Q-learning for restless bandits with average reward
• A restless bandit model for resource allocation, competition, and reservation
• Admission and routing of soft real-time jobs to multiclusters: Design and comparison of index policies
• Dynamic routing of real-time jobs among parallel EDF queues: a performance study
• Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
• Index policies for the routing of background jobs
• Learning unknown service rates in queues: a multiarmed bandit approach

This page was built for publication: Admission and routing of soft real-time jobs to multiclusters: design and comparison of index policies

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