SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On the optimality of an index policy for bandwidth allocation with delayed state observation and differentiated services
9 references·1 citing·39 second hop
On the optimality of an index policy for bandwidth allocation with delayed state observation and differentiated services (2004)On the optimality of an index policy for …On the stationary dynamics of parallel queues with random server connectivities (2002)On the stationary dynamics of…Restless bandits, partial conservation laws and indexability (2001)Restless bandits, partial con…ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES (2000)ON THE OPTIMALITY OF AN INDEX…Scheduling with asynchronous service opportunities with applications to multiple satellite systems (1993)Scheduling with asynchronous …Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates (1993)Extremal properties of the sh…Dynamic server allocation to parallel queues with randomly varying connectivity (1993)Dynamic server allocation to …On an index policy for restless bandits (1990)On an index policy for restle…Restless bandits: activity allocation in a changing world (1988)Restless bandits: activity al…The c μ rule revisited (1985)The c μ rule revisitedMulti-Armed Bandits: Theory and Applications to Online Learning in Networks (2019)Multi-Armed Bandits: Theory a…Bandit Processes and Dynamic Allocation Indices (1979)The Psychology and Neuroscience of Curiosity (2015)Bandit Algorithms (2020)The stability of a queue with non-independent inter-arrival and service times (1962)Point Processes and Queues (1981)Point Processes and Queues: Martingale Dynamics. (1983)ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS (2002)Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules (2005)Optimal Resource Scheduling in Wireless Multiservice Systems with Random Channel Connectivity (2009)Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues and Other Stochastic Models. (1986)Applied Probability and Queues (1987)MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic (2004)SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES (2004)Maximum Pressure Policies in Stochastic Processing Networks (2005)Hitting-time and occupation-time bounds implied by drift analysis with applications (1982)Optimal anticipative scheduling with asynchronous transmission opportunities (1995)Control of Polling in Presence of Vacations in Heavy Traffic with Applications to Satellite and Mobile Radio Systems (2002)Queuing with future information (2014)Optimality of the shortest line discipline (1977)On the optimal assignment of customers to parallel servers (1978)An Introduction to Queueing Networks (1990)On the duality between routing and scheduling systems with finite buffer space (1993)Multiple-server system with flexible arrivals (2011)Social Choice and Individual Values (1952)Expected stock returns and volatility (1987)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic (2000)Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2010)Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challenges (2015)A survey on the bandit problem with switching costs (2004)Delay-Optimal Server Allocation in Multiqueue Multiserver Systems With Time-Varying Connectivities (2009)Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach (2020)Multi-Armed Bandit Problems (2007)Adapting to a Changing Environment: the Brownian Restless Bandits. (2008)Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challenges. (2015)On the Optimal Control of Two Queues with Server Setup Times and Its Analysis (1987)Optimal Dynamic Scheduling Policy for a Make-To-Stock Production System (1997)The cμ/θ Rule for Many-Server Queues with Abandonment (2010)
this work references cited by second hop

References

  • 1988Restless bandits: activity allocation in a changing world1,174 cited
  • 1993Dynamic server allocation to parallel queues with randomly varying connectivity685 cited
  • 1990On an index policy for restless bandits486 cited
  • 1985The c μ rule revisited236 cited
  • 2001Restless bandits, partial conservation laws and indexability202 cited
  • 2000ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES58 cited
  • 1993Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates35 cited
  • 2002On the stationary dynamics of parallel queues with random server connectivities31 cited
  • 1993Scheduling with asynchronous service opportunities with applications to multiple satellite systems25 cited

Cited by

  • 2019Multi-Armed Bandits: Theory and Applications to Online Learning in Networks35 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work