SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Hyper-Scalable JSQ with Sparse Feedback
16 references·0 citing·32 second hop
Hyper-Scalable JSQ with Sparse Feedback (2019)Hyper-Scalable JSQ with Sparse FeedbackLoad Balancing in the Nondegenerate Slowdown Regime (2019)Load Balancing in the Nondege…Expected Values Estimated via Mean-Field Approximation are 1/N-Accurate (2017)Expected Values Estimated via…Universality of load balancing schemes on the diffusion scale (2016)Universality of load balancin…Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems (2016)Delay, Memory, and Messaging …Pull-based load distribution in large-scale heterogeneous service systems (2015)Pull-based load distribution …Power of d Choices for Large-Scale Bin Packing (2015)Power of d Choices for Large-…Mean field and propagation of chaos in multi-class heterogeneous loss models (2015)Mean field and propagation of…Pull-based load distribution in large-scale heterogeneous service systems (2014)Pull-based load distribution …On the Power of (Even a Little) Resource Pooling (2012)On the Power of (Even a Littl…Asymptotic independence of queues under randomized load balancing (2012)Asymptotic independence of qu…Randomized load balancing with general service time distributions (2010)Randomized load balancing wit…Martingale proofs of many-server heavy-traffic limits for Markovian queues (2007)Martingale proofs of many-ser…Martingale proofs of many-server heavy-traffic limits for Markovian queues (2007)Martingale proofs of many-ser…The power of two choices in randomized load balancing (2001)The power of two choices in r…A simple dynamic routing problem (1980)A simple dynamic routing prob…Optimality of the shortest line discipline (1977)Optimality of the shortest li…Central limit theorems for local martingales (1980)Queue-and-Idleness-Ratio Controls in Many-Server Service Systems (2009)Law of large numbers limits for many-server queues (2010)Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics (2018)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)On the optimal assignment of customers to parallel servers (1978)Control Techniques for Complex Networks (2007)Dynamic server allocation to parallel queues with randomly varying connectivity (1993)Principles on the Benefits of Manufacturing Process Flexibility (1995)Reducing Latency via Redundant Requests (2015)Queueing with redundant requests: exact analysis (2016)The Power of Slightly More than One Sample in Randomized Load Balancing (2017)Markov Models & Optimization (1993)The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)Optimal control of two interacting service stations (1984)Extremal Splittings of Point Processes (1985)Optimal control of service rates in networks of queues (1987)Chaoticity on path space for a queueing network with selection of the shortest queue among several (2000)Insensitivity in processor-sharing networks (2002)On the maximum queue length in the supermarket model (2006)Stability of join the shortest queue networks (2011)DECAY OF TAILS AT EQUILIBRIUM FOR FIFO JOIN THE SHORTEST QUEUE NETWORKS (2013)The hydrodynamic limit of a randomized load balancing network (2019)Point Processes and Queues (1981)Limit Theorems for Stochastic Processes (1987)Telephone Call Centers: Tutorial, Review, and Research Prospects (2003)Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems (2018)Experimenting in Equilibrium (2021)Scalable Load Balancing in Networked Systems: A Survey of Recent Advances (2022)A Staffing Algorithm for Call Centers with Skill-Based Routing (2005)Continuous approximation of collective system behaviour: A tutorial (2013)Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity (2014)
this work references cited by second hop

References

  • 2001The power of two choices in randomized load balancing1,402 cited
  • 1977Optimality of the shortest line discipline495 cited
  • 1980A simple dynamic routing problem315 cited
  • 2007Martingale proofs of many-server heavy-traffic limits for Markovian queues183 cited
  • 2014Pull-based load distribution in large-scale heterogeneous service systems162 cited
  • 2012Asymptotic independence of queues under randomized load balancing161 cited
  • 2007Martingale proofs of many-server heavy-traffic limits for Markovian queues155 cited
  • 2015Pull-based load distribution in large-scale heterogeneous service systems148 cited
  • 2012On the Power of (Even a Little) Resource Pooling110 cited
  • 2010Randomized load balancing with general service time distributions66 cited
  • 2017Expected Values Estimated via Mean-Field Approximation are 1/N-Accurate54 cited
  • 2019Load Balancing in the Nondegenerate Slowdown Regime42 cited
  • 2015Power of d Choices for Large-Scale Bin Packing38 cited
  • 2016Universality of load balancing schemes on the diffusion scale38 cited
  • 2016Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems32 cited

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

  • 2015Mean field and propagation of chaos in multi-class heterogeneous loss models30 cited
  • Cited by

    No citing works inside the corpus for this window.