SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The Effect of Increasing Routing Choice on Resource Pooling
7 references·16 citing·36 second hop
The Effect of Increasing Routing Choice on Resource Pooling (1998)The Effect of Increasing Routing Choice o…Dynamic control of Brownian networks: state space collapse and\n\t\t equivalent workload formulations (1997)Dynamic control of Brownian n…Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling (1993)Dynamic routing in open queue…Loss Networks (1991)Loss NetworksBrownian Motion and Stochastic Flow Systems. (1987)Brownian Motion and Stochasti…Comparison Methods for Queues and Other Stochastic Models. (1986)Comparison Methods for Queues…Blocking When Service Is Required From Several Facilities Simultaneously (1985)Blocking When Service Is Requ…Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues…Scalable Load Balancing in Networked Systems: A Survey of Recent Advances (2022)Scalable Load Balancing in Ne…Optimal Load Balancing with Locality Constraints (2020)Optimal Load Balancing with L…Supermarket model on graphs (2019)Supermarket model on graphsSearch Among Queues Under Quality Differentiation (2019)Search Among Queues Under Qua…SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS (2019)SCALABLE LOAD BALANCING IN NE…Asymptotically Optimal Load Balancing Topologies (2018)Asymptotically Optimal Load B…Supermarket model on graphs (2017)Supermarket model on graphsExpected Values Estimated via Mean-Field Approximation are 1/N-Accurate (2017)Expected Values Estimated via…Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay (2016)Randomized Assignment of Jobs…The Power of Randomized Routing in Heterogeneous Loss Systems (2015)The Power of Randomized Routi…Mean field and propagation of chaos in multi-class heterogeneous loss models (2015)Mean field and propagation of…The Supermarket Game (2013)The Supermarket GameOn the power of two choices: Balls and bins in continuous time (2005)On the power of two choices: …Functional central limit theorems for a large network in which customers join the shortest of several queues (2004)Functional central limit theo…Fast Jackson Networks with Dynamic Routing (2002)Fast Jackson Networks with Dy…Fast Jackson networks (1999)Fast Jackson networksNetworks of Waiting Lines (1957)Jobshop-Like Queueing Systems (1963)The power of two choices in randomized load balancing (2001)Randomized load balancing with general service time distributions (2010)Stability of join the shortest queue networks (2011)Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems (2015)Optimality of the shortest line discipline (1977)Introduction to Queueing Networks (1987)Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers (2005)Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse (2012)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Stochastic Differential Equations: Theory and Applications. (1976)MULTI-DIMENSIONAL DIFFUSION PROCESSES (1980)Optimal Control and Trunk Reservation in Loss Networks (1990)Improving Service by Informing Customers About Anticipated Delays (1999)Chaoticity on path space for a queueing network with selection of the shortest queue among several (2000)A class of mean field interaction models for computer and communication systems (2008)Size expansions of mean field approximation: Transient and steady-state analysis (2018)Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime (2020)Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime (2020)Heavy-Traffic Limits for Queues with Many Exponential Servers (1981)Open Queueing Networks in Heavy Traffic (1984)Brownian Models of Queueing Networks with Heterogeneous Customer Populations (1988)Dynamic Scheduling with Convex Delay Costs: The Generalized $c|mu$ Rule (1995)A broader view of Brownian networks (2003)Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime (2004)Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic (2004)Dynamic server allocation to parallel queues with randomly varying connectivity (1993)Stability, queue length, and delay of deterministic and stochastic queueing networks (1994)Optimal Investment Policies for a Firm With a Random Risk Process: Exponential Utility and Minimizing the Probability of Ruin (1995)Time-changed Lévy processes and option pricing (2003)Selection, Growth, and the Size Distribution of Firms (2007)A Continuous-Time Version of the Principal–Agent Problem (2008)Effective bandwidths at multi-class queues (1991)Networks of infinite-server queues with nonstationary Poisson input (1993)Marked point processes as limits of Markovian arrival streams (1993)
this work references cited by second hop

References

  • 1987Brownian Motion and Stochastic Flow Systems.1,091 cited
  • 1986Comparison Methods for Queues and Other Stochastic Models.938 cited
  • 1984Comparison Methods for Queues and Other Stochastic Models720 cited
  • 1991Loss Networks601 cited
  • 1985Blocking When Service Is Required From Several Facilities Simultaneously293 cited
  • 1993Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling170 cited
  • 1997Dynamic control of Brownian networks: state space collapse and\n\t\t equivalent workload formulations148 cited

Cited by

  • 2022Scalable Load Balancing in Networked Systems: A Survey of Recent Advances67 cited
  • 1999Fast Jackson networks66 cited
  • 2017Expected Values Estimated via Mean-Field Approximation are 1/N-Accurate54 cited
  • 2019SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS53 cited
  • 2004Functional central limit theorems for a large network in which customers join the shortest of several queues42 cited
  • 2017Supermarket model on graphs37 cited
  • 2005On the power of two choices: Balls and bins in continuous time36 cited
  • 2002Fast Jackson Networks with Dynamic Routing

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

32 cited
  • 2015Mean field and propagation of chaos in multi-class heterogeneous loss models30 cited
  • 2018Asymptotically Optimal Load Balancing Topologies27 cited
  • 2016Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay26 cited
  • 2019Supermarket model on graphs26 cited
  • 2015The Power of Randomized Routing in Heterogeneous Loss Systems25 cited
  • 2020Optimal Load Balancing with Locality Constraints22 cited
  • 2019Search Among Queues Under Quality Differentiation22 cited
  • 2013The Supermarket Game19 cited