Braess-like paradoxes in distributed computer systems

@article{Kameda2000BraesslikePI,
  title={Braess-like paradoxes in distributed computer systems},
  author={H. Kameda and E. Altman and T. Kozawa and Y. Hosokawa},
  journal={IEEE Trans. Autom. Control.},
  year={2000},
  volume={45},
  pages={1687-1691}
}
  • H. Kameda, E. Altman, +1 author Y. Hosokawa
  • Published 2000
  • Computer Science
  • IEEE Trans. Autom. Control.
  • We consider optimal distributed decisions in distributed computer systems. We identify a Braess like paradox in which adding capacity to the system may degrade the performance of all users. Unlike the original Braess paradox, we show that this behavior occurs only in the case of finitely many users and not in the case of infinite number of users. 
    Avoiding paradoxes in multi-agent competitive routing
    • 18
    • PDF
    On the severity of Braess's Paradox: Designing networks for selfish users is hard
    • 147
    • PDF
    Avoiding paradoxes in routing games
    • 14
    • PDF
    A survey on networking games in telecommunications
    • 550
    • PDF
    How harmful the paradox can be in the Braess/Cohen-Kelly-Jeffries networks
    • 38
    • PDF
    A Braess type paradox in power control over interference channels
    • 13
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 25 REFERENCES
    An algorithm for optimal static load balancing in distributed computer systems
    • 118
    • PDF
    Avoiding the Braess Paradox in Noncooperative Networks
    • 153
    • PDF
    Optimal static load balancing in distributed computer systems
    • 424
    Competitive routing in multiuser communication networks
    • 537
    • PDF
    Architecting noncooperative networks
    • 267
    • PDF
    A PARADOX OF CONGESTION IN A QUEUING NETWORK
    • 171
    • PDF
    On the relationship between Nash - Cournot and Wardrop equilibria
    • 339