SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The autostrada queueing problem
7 references·15 citing·29 second hop
The autostrada queueing problem (1984)The autostrada queueing problemOn the optimal assignment of customers to parallel servers (1978)On the optimal assignment of …Two queues in parallel (1977)Two queues in parallelOptimality of the shortest line discipline (1977)Optimality of the shortest li…Two Similar Queues in Parallel (1961)Two Similar Queues in ParallelQueues, Inventories and Maintenance. (1960)Queues, Inventories and Maint…TWO QUEUES IN PARALLEL (1958)TWO QUEUES IN PARALLELQueues, Inventories, and Maintenance (1958)Queues, Inventories, and Main…Bad luck when joining the shortest queue (2008)Bad luck when joining the sho…Web server load balancing: A queueing analysis (2007)Web server load balancing: A …Analysis of two queues in parallel with jockeying and restricted capacities (2007)Analysis of two queues in par…An approximate analysis of the join the shortest queue (JSQ) policy (1996)An approximate analysis of th…Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach (1995)Bounding the mean response ti…Observing Queues Before Joining (1994)Observing Queues Before Joini…On the Shortest Queue Policy for the Tandem Parallel Queue (1992)On the Shortest Queue Policy …A numerically stable algorithm for two server queue models (1991)A numerically stable algorith…Distributed routing for load balancing (1989)Distributed routing for load …An approximation to the response time for shortest queue routing (1989)An approximation to the respo…An approximation to the response time for shortest queue routing (1989)An approximation to the respo…Optimally of shortest queue routing for dependent service stations (1987)Optimally of shortest queue r…On a numerical method for calculating state probabilities for queueing systems with more than one waiting line (1987)On a numerical method for cal…Algorithmic and approximation analyses of the shorter queue model (1987)Algorithmic and approximation…A note on waiting times in systems with queues in parallel (1987)A note on waiting times in sy…A simple dynamic routing problem (1980)Approximate analysis of fork/join synchronization in parallel queues (1988)Dynamic routing and jockeying controls in a two-station queueing system (1996)An analysis of the join the shortest queue (JSQ) policy (2003)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)Control Techniques for Complex Networks (2007)A Proof for the Queuing Formula: L = λ W (1961)Queueing Systems. Volume 1: Theory (1975)Theory, Volume 1, Queueing Systems (1975)Computing performance bounds of fork-join parallel programs under a multiprocessing environment (1998)Stochastic complement analysis of multi-server threshold queues with hysteresis (1999)A hybrid solution of fork/join synchronization in parallel queues (2001)Some Tactical Problems in Digital Simulation (1963)A hypercube queuing model for facility location and redistricting in urban emergency services (1974)Little's Law (2008)J.comput. appl. math (1990)A compensation approach for two-dimensional Markov processes (1993)Join the shortest queue: stability and exact asymptotics (2001)Analysis of the asymmetric shortest queue problem (1991)Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics (2018)Optimal control of two interacting service stations (1984)Deciding Which Queue to Join: Some Counterexamples (1986)Optimal control of service rates in networks of queues (1987)A Basic Dynamic Routing Problem and Diffusion (1978)Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling (1993)Analysis of join-the-shortest-queue routing for web server farms (2007)Analysis of A time‐shared processor (1964)Optimal disposal policies for a single‐item inventory system with returns (1977)Optimal design and control of queues (2005)
this work references cited by second hop

References

  • 1977Optimality of the shortest line discipline495 cited
  • 1960Queues, Inventories and Maintenance.383 cited
  • 1978On the optimal assignment of customers to parallel servers337 cited
  • 1961Two Similar Queues in Parallel219 cited
  • 1958Queues, Inventories, and Maintenance176 cited
  • 1977Two queues in parallel153 cited
  • 1958TWO QUEUES IN PARALLEL131 cited

Cited by

  • 1995Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach50 cited
  • 1989An approximation to the response time for shortest queue routing48 cited
  • 1989An approximation to the response time for shortest queue routing41 cited
  • 2007Web server load balancing: A queueing analysis39 cited
  • 1987Algorithmic and approximation analyses of the shorter queue model39 cited
  • 1987On a numerical method for calculating state probabilities for queueing systems with more than one waiting line37 cited
  • 1987A note on waiting times in systems with queues in parallel36 cited
  • 1996An approximate analysis of the join the shortest queue (JSQ) policy32 cited

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

1989
Distributed routing for load balancing
26 cited
  • 2007Analysis of two queues in parallel with jockeying and restricted capacities22 cited
  • 2008Bad luck when joining the shortest queue14 cited
  • 1987Optimally of shortest queue routing for dependent service stations14 cited
  • 1991A numerically stable algorithm for two server queue models14 cited
  • 1994Observing Queues Before Joining14 cited
  • 1992On the Shortest Queue Policy for the Tandem Parallel Queue13 cited