Whittle Indexability in Egalitarian Processor Sharing Systems
نویسندگان
چکیده
The egalitarian processor sharing model is viewed as a restless bandit and its Whittle indexability is established. A numerical scheme for computing the Whittle indices is provided, along with supporting numerical experiments.
منابع مشابه
Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues
We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for an egalitarian PS queue with K customer classes, we show that the marginal queue length distribution for class k factorizes over the number of other customer types. The factorizing coefficients equal the queue length probabilities of a PS queue for typ...
متن کاملInsensitivity of a network of symmetric queues with balanced service rates
Previous insensitivity results on queueing systems include on one hand, e.g., symmetric queues in isolation and, on the other hand, networks of processor sharing queues with globally dependent balanced service rates, i.e. so-called Whittle networks. In this paper we show that insensitivity property of a queueing network with balanced service rates is retained when each of the processor sharing ...
متن کاملRestless Poachers: Handling Exploration-Exploitation Tradeoffs in Security Domains
The success of Stackelberg Security Games (SSGs) in counterterrorism domains has inspired researchers’ interest in applying game-theoretic models to other security domains with frequent interactions between defenders and attackers, e.g., wildlife protection. Previous research optimizes defenders’ strategies by modeling this problem as a repeated Stackelberg game, capturing the special property ...
متن کاملRestless Bandits, Partial Conservation Laws and Indexability
We show that if performance measures in a general stochastic scheduling problem satisfy partial conservation laws (PCL), which extend the generalized conservation laws (GCL) introduced by Bertsimas and Niño-Mora (1996), then the problem is solved optimally by a priority-index policy under a range of admissible linear performance objectives, with both this range and the optimal indices being det...
متن کاملAge of Information: Whittle Index for Scheduling Stochastic Arrivals
Age of information is a new concept that characterizes the freshness of information at end devices. This paper studies the age of information from a scheduling perspective. We consider that a base-station updates many users on stochastic information arrivals over a wireless broadcast network, where only one user can be updated for each time. In this context, we aim at developing a transmission ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1707.02440 شماره
صفحات -
تاریخ انتشار 2017