SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An approximation to the response time for shortest queue routing
7 references·3 citing·34 second hop
An approximation to the response time for shortest queue routing (1989)An approximation to the response time for…Approximate analysis of fork/join synchronization in parallel queues (1988)Approximate analysis of fork/…The shortest queue problem (1985)The shortest queue problemThe autostrada queueing problem (1984)The autostrada queueing probl…A simple dynamic routing problem (1980)A simple dynamic routing prob…A 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)Optimality of the shortest li…An analysis of the join the shortest queue (JSQ) policy (2003)An analysis of the join the s…Dynamic routing and jockeying controls in a two-station queueing system (1996)Dynamic routing and jockeying…An approximate analysis of the join the shortest queue (JSQ) policy (1996)An approximate analysis of th…A spectral method for confidence interval generation and run length control in simulations (1981)Matrix-geometric solutions in stochastic models (1985)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)Control Techniques for Complex Networks (2007)Theory, Volume 1, Queueing Systems (1975)Performance analysis of parallel processing systems (1988)Acyclic fork-join queuing networks (1989)The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds (1989)Queues, Inventories and Maintenance. (1960)On the optimal assignment of customers to parallel servers (1978)An approximation to the response time for shortest queue routing (1989)Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach (1995)Web server load balancing: A queueing analysis (2007)Two Similar Queues in Parallel (1961)J.comput. appl. math (1990)A compensation approach for two-dimensional Markov processes (1993)Join the shortest queue: stability and exact asymptotics (2001)Matrix-Geometric Solutions to Stochastic Models (1984)Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues and Other Stochastic Models. (1986)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)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)Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics (2018)Resource Sharing for Efficiency in Traffic Systems (1981)Optimality of routing and servicing in dependent parallel processing systems (1991)An approximation for the mean response time for shortest queue routing with general interarrival and service times (1993)Braess's paradox in a queueing network with state-dependent routing (1997)
this work references cited by second hop

References

  • 1977Optimality of the shortest line discipline495 cited
  • 1988Approximate analysis of fork/join synchronization in parallel queues332 cited
  • 1980A simple dynamic routing problem315 cited
  • 1978A Basic Dynamic Routing Problem and Diffusion168 cited
  • 1977Two queues in parallel153 cited
  • 1985The shortest queue problem83 cited
  • 1984The autostrada queueing problem51 cited

Cited by

  • 1996An approximate analysis of the join the shortest queue (JSQ) policy32 cited
  • 1996Dynamic routing and jockeying controls in a two-station queueing system17 cited
  • 2003An analysis of the join the shortest queue (JSQ) policy15 cited

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