Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

On the Value Function of the M/G/1 FCFS and LCFS Queues

16 references·1 citing·35 second hop

FromToDepth

this work references cited by second hop

References

1975Queueing Systems. Volume 1: Theory1,964 cited
2001The power of two choices in randomized load balancing1,402 cited
1977Optimality of the shortest line discipline495 cited
1978On the optimal assignment of customers to parallel servers337 cited
1980A simple dynamic routing problem315 cited
1986Deciding Which Queue to Join: Some Counterexamples235 cited
2007Analysis of join-the-shortest-queue routing for web server farms219 cited
1986Deciding which queue to join: Some counterexamples189 cited
2002Asymptotic convergence of scheduling policies with respect to slowdown87 cited
2005Optimal state-free, size-aware dispatching for heterogeneous -type systems85 cited
1994Optimality of the round-robin routing policy62 cited
1998Optimal Load Balancing on Distributed Homogeneous Unreliable Processors58 cited
1987Joining the right queue: A Markov decision-rule56 cited
2011Size- and state-aware dispatching problem with queue-specific job sizes54 cited
1984The autostrada queueing problem51 cited
1990On job assignment for a parallel system of processor sharing queues

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

43 cited

Cited by

2014Round-Robin Routing Policy: Value Functions and Mean Performance with Job- and Server-specific Costs10 cited