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

DOI10.1016/J.COR.2012.05.004arXiv2207.12815MaRDI QIDQ6406098FDOQ6406098

Publication date: 26 July 2022

Abstract: Motivated by time-sensitive e-service applications, we consider the design of effective policies in a Markovian model for the dynamic control of both admission and routing of a single class of real-time transactions to multiple heterogeneous clusters of web servers, each having its own queue and server pool. Transactions come with response-time deadlines, staying until completion if the latter are missed. Per job rejection and deadline-miss penalties are incurred. Since computing an optimal policy is intractable, we aim to design near optimal heuristic policies that are tractable for large-scale systems. Four policies are developed: the static optimal Bernoulli-splitting (BS) policy, and three index policies, based respectively on individually optimal (IO) actions, one-step policy improvement (PI), and restless bandit (RB) indexation. A computational study demonstrates that PI is the best of such policies, being consistently near optimal. In the pure-routing case, both the PI and RB policies are nearly optimal.

Mathematics Subject Classification ID

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

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 Q6406098)