Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers

DOI10.1145/567112.567113zbMath1326.68045OpenAlexW1999022743MaRDI QIDQ3455536

Odile Pourtallier, Hisao Kameda

Publication date: 7 December 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/567112.567113

zbMATH Keywords

Nash equilibriumnoncooperative gameload balancingperformance optimizationdistributed decisionBraess paradoxWardrop equilibriumhomogeneous distributed system

Mathematics Subject Classification ID

Noncooperative games (91A10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems ⋮ Nash equilibrium based fairness ⋮ Optimal routing for multiclass networks ⋮ Inefficiency in stochastic queueing systems with strategic customers ⋮ EFFECTS OF SYMMETRY ON GLOBALIZING SEPARATED MONOPOLIES TO A NASH-COURNOT OLIGOPOLY ⋮ Magnitude of inefficiency ⋮ A survey on networking games in telecommunications ⋮ Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems ⋮ A paradox in optimal flow control of \(M/M/n\) queues ⋮ Load balancing congestion games and their asymptotic behavior

This page was built for publication: Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers