SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Round-Robin Routing Policy: Value Functions and Mean Performance with Job- and Server-specific Costs
16 references·0 citing·35 second hop
Round-Robin Routing Policy: Value Functions and Mean Performance with Job- and Server-specific Costs (2014)Round-Robin Routing Policy: Value Functio…Performance Modeling and Design of Computer Systems: Queueing Theory in Action (2013)Performance Modeling and Desi…Minimizing slowdown in heterogeneous size-aware dispatching systems (2012)Minimizing slowdown in hetero…Size- and state-aware dispatching problem with queue-specific job sizes (2011)Size- and state-aware dispatc…Multi-layered round robin routing for parallel servers (2006)Multi-layered round robin rou…Optimal state-free, size-aware dispatching for heterogeneous -type systems (2005)Optimal state-free, size-awar…A simple solution for the M/D/c waiting time distribution (2001)A simple solution for the M/D…Minimizing response times and queue lengths in systems of parallel queues (1999)Minimizing response times and…Optimal Load Balancing on Distributed Homogeneous Unreliable Processors (1998)Optimal Load Balancing on Dis…Optimality of the round-robin routing policy (1994)Optimality of the round-robin…On the Optimality of the Generalized Shortest Queue Policy (1990)On the Optimality of the Gene…Joining the right queue: a state-dependent decision rule (1990)Joining the right queue: a st…Extremal Splittings of Point Processes (1985)Extremal Splittings of Point …The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks (1983)The Proof of a Folk Theorem o…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…Applying a New Device in the Optimization of Exponential Queuing Systems (1975)Control Techniques for Complex Networks (2007)Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues and Other Stochastic Models. (1986)Introduction to Queueing Networks (1987)Queueing-theoretic solution methods for models of parallel and distributed systems (1994)Hitting-time and occupation-time bounds implied by drift analysis with applications (1982)Optimal control of two interacting service stations (1984)Optimal control of admission to a quenching system (1985)A survey of Markov decision models for control of networks of queues (1993)Structural results for the control of queueing systems using event-based dynamic programming (1998)Queues and Inventories. (1966)QUEUES AND INVENTORIES (1967)Poisson Arrivals See Time Averages (1982)On queues with service and interarrival times depending on waiting times (2007)Cooperation in Service Systems (2009)Coordinated Logistics: Joint Replenishment with Capacitated Transportation for a Supply Chain (2013)Queueing systems, volume II: computer applications (1977)Introduction to Queueing Theory (1982)An introduction to queueing theory (1993)Task assignment in a heterogeneous server farm with switching delays and general energy-aware cost structure (2014)Scalable Load Balancing in Networked Systems: A Survey of Recent Advances (2022)An Introduction to Queueing Networks (1990)Sample path methods in the control of queues (1995)Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems (2004)The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)A Basic Dynamic Routing Problem and Diffusion (1978)Optimal static load balancing in distributed computer systems (1985)Optimal control of service rates in networks of queues (1987)Optimal routing and buffer allocation for a class of finite capacity queueing systems (1992)Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach (2002)Dynamic priority allocation via restless bandit marginal productivity indices (2007)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

  • 1977Optimality of the shortest line discipline495 cited
  • 2013Performance Modeling and Design of Computer Systems: Queueing Theory in Action495 cited
  • 1978On the optimal assignment of customers to parallel servers337 cited
  • 1980A simple dynamic routing problem315 cited
  • 1985Extremal Splittings of Point Processes254 cited
  • 1990On the Optimality of the Generalized Shortest Queue Policy93 cited
  • 2005Optimal state-free, size-aware dispatching for heterogeneous -type systems85 cited
  • 2001A simple solution for the M/D/c waiting time distribution67 cited
  • 1994Optimality of the round-robin routing policy62 cited
  • 1998Optimal Load Balancing on Distributed Homogeneous Unreliable Processors58 cited
  • 1983The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks57 cited
  • 2011Size- and state-aware dispatching problem with queue-specific job sizes54 cited
  • 1990Joining the right queue: a state-dependent decision rule45 cited
  • 1999Minimizing response times and queue lengths in systems of parallel queues42 cited
  • 2006Multi-layered round robin routing for parallel servers35 cited

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

  • 2012Minimizing slowdown in heterogeneous size-aware dispatching systems32 cited
  • Cited by

    No citing works inside the corpus for this window.