Avoiding paradoxes in multi-agent competitive routing

Computer Networks

Volumn 43, Issue 2, 2003, Pages 133-146

  Altman, Eitan ^a   El Azouzi, Rachid ^a   Pourtallier, Odile ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; MULTI AGENT SYSTEMS; TELECOMMUNICATION LINKS;

ROUTING;

COMPUTER NETWORKS;

EID: 0041888239     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(03)00231-7     Document Type: Article

References (19)

1. Altman E., El Azouzi R., Vyacheslav V. Non-cooperative routing in loss networks. Performance Evaluation. 49(1-4):2002;257-272.
2. Altman E., Başar T., Jiménez T., Shimkin N. Routing into two parallel links: game-theoretic distributed algorithms. Journal of Parallel and Distributed Computing. 61(9):2001;1367-1381.
3. Bean N.G., Kelly F.P., Taylor P.G. Braess's paradox in loss networks. Journal of Applied Probability. 34:1997;155-159.
4. Braess D. Ber ein paradoxen aus der verkehrsplanung. Unternehmensforschung. 12:1968;258-268.
5. Calvert B., Solomon W., Ziedins I. Braess's paradox in a queuing network with state depending routing. Journal of Applied Probability. 34:1997;134-154.
6. Cohen J.E., Kelly F.P. A paradox of congestion in a queuing network. Journal of Applied Probability. 27:1990;730-734.
7. Cohen J.E., Jeffries C. Congestion resulting from increased capacity in single-server queuing network. IEEE/ACM Transactions on Networking. 5(2):1997;1220-1225.
8. Dafermos S., Nagurney A. On some traffic equilibrium theory paradoxes. Journal of Transportation Resource B. 18:1984;101-110.
9. H. Kameda, E. Altman, T. Kozawa, A case where paradox like Braess's occurs in the Nash equilibrium but does not occur in the Wardrop equilibrium-situation of load balancing in distributed computer systems, Proceedings of IEEE CDC'99, Phoenix, Arizona, USA, December 1999.
10. Kameda H., Altman E., Kozawa T., Hosokawa Y. Braess-like paradoxes in distributed computer systems. IEEE Transactions on Automatic Control. 45(9):2001;1687-1691.
11. Kobayashi H. Modeling and Analysis, An Introduction to System Performance Evaluation Methodology. 1978;Addison-Wesley, Reading, MA.
12. Korilis Y.A., Lazar A.A., Orda A. Architecting non-cooperative networks. IEEE Journal on Selected Areas in Communications. 13(7):1995;1241-1251.
13. Korilis Y.A., Lazar A.A., Orda A. Capacity allocation under non-cooperative routing. IEEE Transactions on Automatic Control. 42(3):1997;309-325.
14. Korilis Y.A., Lazar A.A., Orda A. Avoiding the Braess paradox in non-cooperative network. Journal of Applied Probability. 36:1999;211-222.
15. J.L. Lutton, On link costs in networks, private communication, France Telecom.
16. Y. Massuda, Braess's paradox and capacity management in decentralized network, manuscript, 1999.
17. Orda A., Rom R., Shimkin N. Competitive routing in multi-user communication network. IEEE/ACM Transactions on Networking. 1:1993;510-520.
18. Rosen J.B. Existence and uniqueness of equilibrium points for concave. N -person games Econometrica. 33:1965;153-163.
19. Smith M.J. In a road network, increasing delay locally can reduce delay globally. Journal of Transportation Resource. 12:1978;419-422.