Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Load balancing in processor sharing systems

10 references·10 citing·39 second hop

FromToDepth

this work references cited by second hop

References

1996Potential Games3,617 cited
1973A class of games possessing pure-strategy Nash equilibria2,008 cited
1999Worst-Case Equilibria1,962 cited
1994The Traffic Assignment Problem: Models and Methods1,043 cited
2006Selfish Routing and the Price of Anarchy686 cited
2016Selfish Routing and the Price of Anarchy647 cited
2001Potential Games with Continuous Player Sets449 cited
1979Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System253 cited
2007Analysis of join-the-shortest-queue routing for web server farms219 cited
1983Individual versus Social Optimization in the Allocation of Customers to Alternative Servers164 cited

Cited by

2022Scalable Load Balancing in Networked Systems: A Survey of Recent Advances67 cited
2015Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems53 cited
2018On the scheduling of operations in a chat contact center42 cited
2015Blocking probabilities of elastic and adaptive calls in the Erlang multirate loss model under the threshold policy34 cited
2011M/M/1-PS queue and size-aware task assignment

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

28 cited

2016Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay26 cited

2021Inefficiency in stochastic queueing systems with strategic customers23 cited

2017Line Balancing in Parallel M / M /1 Lines and Loss Systems as Cooperative Games20 cited

2017Whittle indexability in egalitarian processor sharing systems20 cited

2011Dispatching problem with fixed size jobs and processor sharing discipline18 cited