See this document in CiteSeerX!

Characterizing Selfishly Constructed Overlay (2004)  (Make Corrections)  
Routing Networks Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica, and John...



  Home/Search   Context   Related

 
View or download:
ieeeinfocom.org/2004/Papers...28_4.PDF
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ieeeinfocom.or...echnicalprogram (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We analyze the characteristics of overlay routing networks generated by selfish nodes playing competitive network construction games. We explore several networking scenarios--- some simplistic, others more realistic---and analyze the resulting Nash equilibrium graphs with respect to topology, performance, and resilience. We find a fundamental tradeoff between performance and resilience, and show that limiting the degree of nodes is of great importance in controlling this balance. Further, by... (Update)

Active bibliography (related documents):   More   All
0.4:   Appears in Proceedings of the 23rd IEEE.. - Characterizing..   (Correct)
0.4:   Characterizing Selfishly Constructed Overlay Routing.. - Chun, Fonseca, Stoica.. (2004)   (Correct)
0.2:   An Empirical Study of Routing Bias in Variable-Degree Networks - Shudong Jin Department   (Correct)

Similar documents based on text:   More   All
0.2:   Selfish Caching in Distributed Systems: A.. - Chun, Chaudhuri.. (2004)   (Correct)
0.1:   Statistical Analysis of TLS-Based Prony Techniques - Steedly, Ying, Moses (1994)   (Correct)
0.1:   Resource Management Policies for E-commerce Servers - Menascé, Almeida, al.   (Correct)

BibTeX entry:   (Update)

@misc{ byung-gon-characterizing,
  author = "Routing Networks Byung-Gon",
  title = "Characterizing Selfishly Constructed Overlay",
  url = "citeseer.ist.psu.edu/699234.html" }
Citations (may not include all citations):
1225   Chord: A scalable peer-to-peer lookup service for Internet a.. - Stoica, Morris et al. - 2001
1023   A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
402   A case for end system multicast - Chu, Rao et al. - 2000
344   How to model an internetwork - Zegura, Calvert et al. - 1996
307   Resilient overlay networks - Andersen, Balakrishnan et al. - 2001
282   A Course in Game Theory (context) - Osborne, Rubinstein - 1994
188   Collective dynamics of small-world networks (context) - Watts, Strogatz - 1998
79   Tapestry: A resilient global-scale overlay for service deplo.. - Zhao, Huang et al. - 2004
77   Scattercast: An architecture for Internet broadcast distribu.. (context) - Chawathe - 2000
61   Error and attack tolerance of complex networks (context) - Albert, Jeong et al. - 2000
61   Distributed algorithmic mechanism design: Recent results and.. - Feigenbaum, Shenker - 2002
59   Pastry: Scalable, decentralized object location, and routing.. - Rowstron, Druschel - 2001
24   Annals of Discrete Mathematics (context) - Hwang, Richards et al. - 1992
22   a network creation game (context) - Fabrikant, Luthra et al. - 2003
17   Algorithms, games, and the Internet - Papadimitriou - 2001
4   Static and dynamic analysis of the Internet's susceptibility.. - Park, Khrabrov et al. - 2003

Documents on the same site (http://www.ieee-infocom.org/2004/technicalprogram.htm):   More
Multiple Source, Multiple Destination Network Tomography - Rabbat, Nowak, Coates (2004)   (Correct)
Large Wireless Networks under Fading, Mobility, and Delay.. - Toumpis, Goldsmith (2004)   (Correct)
Random Walks in Peer-to-Peer Networks - Gkantsidis, Mihail, Saberi (2004)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC