Characterizing selfishly constructed overlay routing networks

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2004, Pages 1329-1339

  Chun, Byung Gon ^a   Fonseca, Rodrigo ^a   Stoica, Ion ^a   Kubiatowicz, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NASH EQUILIBRIUM; NODE-DEGREE DISTRIBUTIONS; OVERLAY ROUTING; ROUTING NETWORKS;

GAME THEORY; MULTICASTING; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION LINKS; TOPOLOGY;

TELECOMMUNICATION NETWORKS;

EID: 8344222900     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2004.1357018     Document Type: Conference Paper

References (16)

1. Y.-H. Chu, S. G. Rao, and H. Zhang, "A case for end system multicast," in Proceedings of ACM SIGMETRICS, Santa Clara, CA, June 2000.
2. Y. Chawathe, "Scattercast: An architecture for Internet broadcast distribution as an infrastructure service," 2000.
3. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proceedings of SOSP. ACM, 2001.
4. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network,'' in Proceedings of SIGCOMM. ACM, August 2001.
5. I. Stoica. R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for Internet applications," in Proceedings of SIGCOMM. ACM, August 2001.
6. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," Lecture Notes in Computer Science, vol. 2218, 2001.
7. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," in Journal on Selected Areas in Communications. IEEE, January 2004.
8. A. Fabrikant,. A. Luthra, E. Maneva, C. Papadimitriou, and S. Shenker, "On a network creation game," in Proceedings of ACM PODC, 2003.
9. M. J. Osborne and A. Rubinstein, A Course in Game Theory, MIT Press, 1994.
10. J. Feigenbaum and S. Shenker, "Distributed algorithmic mechanism design: Recent results and future directions," in Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002.
11. C. Papadimitriou, "Algorithms, games, and the Internet," in Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, 2001.
12. R. Albert, H. Jeong, and A.-L. Barabási, "Error and attack tolerance of complex networks," in Nature 406, July 2000.
13. S.-T. Park, A. Khrabrov, D. M. Pennock, S. Lawrence, C. L. Giles, and L. H. Ungar, "Static and dynamic analysis of the Internet's susceptibility to faults and attacks," in Proceedings of IEEE INFOCOM, 2003.
14. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Annals of Discrete Mathematics, 1992.
15. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee, "How to model an internetwork," in Proceedings of IEEE INFOCOM, 1996.
16. D. J. Watts and S. H. Strogatz, "Collective dynamics of small-world networks," in Nature 393, June 1998.