SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Two Similar Queues in Parallel
0 references·16 citing·38 second hop
Two Similar Queues in Parallel (1961)Two Similar Queues in ParallelJoin the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics (2018)Join the Shortest Queue with …Herding in Queues with Waiting Costs: Rationality and Regret (2011)Herding in Queues with Waitin…Analysis of join-the-shortest-queue routing for web server farms (2007)Analysis of join-the-shortest…Braess's paradox in a queueing network with state-dependent routing (1997)Braess's paradox in a queuein…Upper and lower bounds for the waiting time in the symmetric shortest queue system (1994)Upper and lower bounds for th…Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling (1993)Dynamic routing in open queue…An approximation for the mean response time for shortest queue routing with general interarrival and service times (1993)An approximation for the mean…A compensation approach for two-dimensional Markov processes (1993)A compensation approach for t…The Power-Series Algorithm Applied to the Shortest-Queue Model (1992)The Power-Series Algorithm Ap…Optimality of routing and servicing in dependent parallel processing systems (1991)Optimality of routing and ser…Analysis of the asymmetric shortest queue problem (1991)Analysis of the asymmetric sh…J.comput. appl. math (1990)J.comput. appl. mathPower Series for Stationary Distributions of Coupled Processor Models (1988)Power Series for Stationary D…The shortest queue problem (1985)The shortest queue problemA Basic Dynamic Routing Problem and Diffusion (1978)A Basic Dynamic Routing Probl…Two queues in parallel (1977)Two queues in parallelOptimality of the shortest line discipline (1977)Heavy-Traffic Limits for Queues with Many Exponential Servers (1981)The power of two choices in randomized load balancing (2001)Universality of Power-of-$d$ Load Balancing in Many-Server Systems (2016)Universality of Power-of-d Load Balancing in Many-Server Systems (2018)Scalable Load Balancing in Networked Systems: A Survey of Recent Advances (2022)On the Stochastic Matrices Associated with Certain Queuing Processes (1953)Boundary Value Problems in Queueing System Analysis (1983)Matrix-Geometric Solutions to Stochastic Models (1984)Analysis of the asymmetric shortest queue problem with threshold jockeying (1991)On the analysis of randomized load balancing schemes (1997)Queueing Models with Multiple Waiting Lines (2001)Brownian Motion and Stochastic Flow Systems. (1987)Introduction to Queueing Networks (1987)Dynamic control of Brownian networks: state space collapse and\n\t\t equivalent workload formulations (1997)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)Matrix-geometric solutions in stochastic models (1985)Bounds for performance characteristics: a systematic approach via cost structures (1998)A BEHAVIORAL MODEL OF RATIONAL CHOICE (1955)Regret Theory: An Alternative Theory of Rational Choice Under Uncertainty (1982)A Simple Model of Herd Behavior (1992)Optimal Design of Social Comparison Effects: Setting Reference Groups and Reference Points (2013)Equilibrium in Queues Under Unknown Service Times and Service Value (2014)Disclosing Product Availability in Online Retail (2020)On the optimal assignment of customers to parallel servers (1978)Point Processes and Queues (1981)Load balancing in processor sharing systems (2010)Stochastic Differential Equations (1972)Queueing Systems. Volume 1: Theory (1975)STOCHASTIC DIFFERENTIAL EQUATIONS: THEORY AND APPLICATIONS (1976)Resource pooling in queueing networks with dynamic routing (1992)On the Power of (Even a Little) Resource Pooling (2012)TWO QUEUES IN PARALLEL (1958)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)A TWO-NODE JACKSON NETWORK WITH INFINITE SUPPLY OF WORK (2005)Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks (2009)Join the shortest queue: stability and exact asymptotics (2001)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2007Analysis of join-the-shortest-queue routing for web server farms219 cited
  • 1993Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling170 cited
  • 1978A Basic Dynamic Routing Problem and Diffusion168 cited
  • 1977Two queues in parallel153 cited
  • 1990J.comput. appl. math129 cited
  • 1993A compensation approach for two-dimensional Markov processes114 cited
  • 2018Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics105 cited
  • 1991Analysis of the asymmetric shortest queue problem90 cited
  • 1994Upper and lower bounds for the waiting time in the symmetric shortest queue system88 cited
  • 2011Herding in Queues with Waiting Costs: Rationality and Regret84 cited
  • 1985The shortest queue problem83 cited
  • 1988Power Series for Stationary Distributions of Coupled Processor Models82 cited
  • 1993An approximation for the mean response time for shortest queue routing with general interarrival and service times65 cited
  • 1991Optimality of routing and servicing in dependent parallel processing systems64 cited
  • 1997

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

Braess's paradox in a queueing network with state-dependent routing
63 cited
  • 1992The Power-Series Algorithm Applied to the Shortest-Queue Model61 cited