Insensitive versus efficient dynamic load balancing in networks without blocking
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1350310 (Why is no real title available?)
- scientific article; zbMATH DE number 3219970 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3049368 (Why is no real title available?)
- A queueing analysis of max-min fairness, proportional fairness and balanced fairness
- A simple dynamic routing problem
- Deciding Which Queue to Join: Some Counterexamples
- Insensitive bandwidth sharing in data networks
- Insensitivity in processor-sharing networks
- Le théorème de représentation intégrale dans les ensembles convexes compacts
- Markov network processes with product form stationary distributions
- On linear functional operations and the moment problem for a finite interval in one or several dimensions
- On the Assignment of Customers to Parallel Queues
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Optimality of the shortest line discipline
- The moment problem for the standard \(k\)-dimensional simplex
Cited in
(6)- Asymptotics of insensitive load balancing and blocking phases
- Efficient Load Balancing by Adaptive Bypasses for the Migration on the Internet
- Large-system insensitivity of zero-waiting load balancing algorithms
- Universality of power-of-\(d\) load balancing in many-server systems
- From Erlang formula to robust control
- Insensitive load balancing in data networks
This page was built for publication: Insensitive versus efficient dynamic load balancing in networks without blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855000)