SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Heavy-Traffic Optimal Size- and State-Aware Dispatching
16 references·0 citing·31 second hop
Heavy-Traffic Optimal Size- and State-Aware Dispatching (2024)Heavy-Traffic Optimal Size- and State-Awa…Heavy Traffic Queue Length Behavior in a Switch Under the MaxWeight Algorithm (2016)Heavy Traffic Queue Length Be…Performance Modeling and Design of Computer Systems: Queueing Theory in Action (2013)Performance Modeling and Desi…Is Tail-Optimal Scheduling Possible? (2012)Is Tail-Optimal Scheduling Po…Asymptotically tight steady-state queue length bounds implied by drift conditions (2012)Asymptotically tight steady-s…Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences (2010)Elements of Queueing Theory: …Optimal Load Balancing on Distributed Homogeneous Unreliable Processors (1998)Optimal Load Balancing on Dis…Stability of Generalized Jackson Networks (1994)Stability of Generalized Jack…Rate conservation laws: A survey (1994)Rate conservation laws: A sur…Optimality of the round-robin routing policy (1994)Optimality of the round-robin…Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling (1993)Dynamic routing in open queue…APPROXIMATIONS FOR THE GI/G/m QUEUE (1993)APPROXIMATIONS FOR THE GI/G/m…Poisson Arrivals See Time Averages (1982)Poisson Arrivals See Time Ave…A simple dynamic routing problem (1980)A simple dynamic routing prob…On the optimal assignment of customers to parallel servers (1978)On the optimal assignment of …Optimality of the shortest line discipline (1977)Optimality of the shortest li…Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)Letter to the Editor—A Proof …The Queueing Network Analyzer (1983)Applied Probability and Queues (1987)Server Staffing to Meet Time-Varying Demand (1996)Reverse logistics network design with stochastic lead times (2005)Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System (2007)Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks (1992)Applied Probability and Queues (2003)Stein’s method for steady-state diffusion approximations of $M/\mathit{Ph}/n+M$ systems (2017)The Power of Slightly More than One Sample in Randomized Load Balancing (2017)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)Control Techniques for Complex Networks (2007)The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)Extremal Splittings of Point Processes (1985)Asymptotic results for multiplexing subexponential on-off processes (1999)The supremum of a negative drift random walk with dependent heavy-tailed steps (2000)Analysis, Design, and Control of Queueing Systems (2002)Stability conditions for multiclass fluid queueing networks (1996)Stability of Queueing Networks (2008)Stability of queueing networks (2008)A Classified Bibliography of Research on Optimal Design and Control of Queues (1977)Analysis of SRPT scheduling (2001)Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)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 Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance (1986)Queueing systems with vacations ? A survey (1986)Telephone Call Centers: Tutorial, Review, and Research Prospects (2003)A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems (2017)SRPT for multiserver systems (2018)Open problems in queueing theory inspired by datacenter computing (2021)
this work references cited by second hop

References

  • 1982Poisson Arrivals See Time Averages1,220 cited
  • 1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline562 cited
  • 1977Optimality of the shortest line discipline495 cited
  • 2013Performance Modeling and Design of Computer Systems: Queueing Theory in Action495 cited
  • 1993APPROXIMATIONS FOR THE GI/G/m QUEUE408 cited
  • 2010Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences354 cited
  • 1978On the optimal assignment of customers to parallel servers337 cited
  • 1980A simple dynamic routing problem315 cited
  • 2012Asymptotically tight steady-state queue length bounds implied by drift conditions185 cited
  • 1994Stability of Generalized Jackson Networks170 cited
  • 1993Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling170 cited
  • 2016Heavy Traffic Queue Length Behavior in a Switch Under the MaxWeight Algorithm110 cited
  • 2012Is Tail-Optimal Scheduling Possible?83 cited
  • 1994Rate conservation laws: A survey73 cited
  • 1994Optimality of the round-robin routing policy62 cited

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

1998
Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
58 cited

Cited by

No citing works inside the corpus for this window.