ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES

DOI10.1017/S0269964800143013zbMath0991.90026WikidataQ128379227 ScholiaQ128379227MaRDI QIDQ2709774

Demosthenis Teneketzis, Christopher M. Lott

Publication date: 3 September 2002

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

zbMATH Keywords

networkqueues

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (7)

Conditions for indexability of restless bandits and an algorithm to compute Whittle index ⋮ Testing indexability and computing Whittle and Gittins index in subcubic time ⋮ Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Queueing and scheduling in random environments ⋮ Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach ⋮ Queueing networks of random link topology: stationary dynamics of maximal throughput schedules

This page was built for publication: ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES