Impact of neighbor selection on performance and resilience of structured P2P networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3640 LNCS, Issue , 2005, Pages 264-274

  Chun, Byung Gon ^a   Zhao, Ben Y ^b   Kubiatowicz, John D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT NEIGHBOR SELECTION; NODE CAPACITY; PEER-TO-PEER; TARGETED ATTACKS;

COMPUTER NETWORKS; COMPUTER SIMULATION; MATHEMATICAL MODELS; REDUNDANCY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646018611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558989_24     Document Type: Conference Paper

References (20)

1. ALBERT, R., JEONG, H., AND BARABASI, A.-L. Error and attack tolerance of complex networks. Nature 406 (July 2000), 378-381.
2. CASTRO, M., DRUSCHEL, P., GANESH, A., AND ROWSTRON, A. Secure routing for structured peer-to-peer overlay networks. In Proc. of USENIX OSDI (December 2002).
3. CASTRO, M., DRUSCHEL, P., HU, Y. C., AND ROWSTRON, A. Exploiting network proximity in peer-to-peer overlay networks, technical report msr-tr-2002-82, 2002.
4. CHAWATHE, Y., RATNASAMY, S., BRESLAU, L., LANHAM, N., AND SHENKER, S. Making gnutella-like p2p systems scalable. In Proc. of ACM SIGCOMM (2003).
5. CHUN, B., CULLER, D., ROSCOE, T., BAVIER, A., PETERSON, L., WAWRZONIAK, M., AND BOWMAN, M. Planetlab: An overlay testbed for broad-coverage services. In ACM Computer Communication Review (July 2003).
6. CHUN, B.-G., FONSECA, R., STOICA, I., AND KUBIATOWICZ, J. Characterizing selfishly constructed overlay routing networks. In Proceedings of IEEE INFOCOM (2004).
7. GUMMADI, K. P., GUMMADI, R., GRIBBLE, S. D., RATNASAMY, S., SHENKER, S., AND STOICA, I. The impact of dht routing geometry on resilience and proximity. In Proc. of ACM SIGCOMM (2003).
8. RAO, A., LAKSHMINARAYANAN, K., SURANA, S., KARP, R., AND STOICA, I. Load balancing in structured p2p systems. In Proc. of IPTPS (2003).
9. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. A scalable content-addressable network. In Proc. of SIGCOMM (August 2001), ACM.
10. RATNASAMY, S., HANDLEY, M., KARP, R., AND SHENKER, S. Topologically-aware overlay construction and server selection. In Proc. of IEEE INFOCOM (2002).
11. RHEA, S., GEELS, D., ROSCOE, T., AND KUBIATOWICZ, J. Handling churn in a dht. In Proc. of the USENIX Annual Technical Conference (June 2004).
12. ROWSTRON, A., AND DRUSCHEL, P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of Middleware (Nov 2001), ACM.
13. SAROIU, S., GUMMADI, P. K., AND GRIBBLE, S. D. A measurement study of peer-to-peer file sharing systems. In Proc. of MMCN (2002).
14. SINGH, A., CASTRO, M., DRUSCHEL, P., AND ROWSTRON, A. Defending against eclipse attacks on overlay networks. In Proc. of the ACM SIGOPS European Workshop (September 2004).
15. STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of SIGCOMM (August 2001), ACM.
16. WALDVOGEL, M., AND RINALDI, R. Efficient topology-aware overlay network. In Proc. of HotNets (2002).
17. ZEGURA, E. W., CALVERT, K. L., AND BHATTACHARJEE, S. How to model an internetwork. In Proc. of IEEE INFOCOM (1996).
18. ZHANG, H., GOEL, A., AND GOVINDAN, R. Incrementally improving lookup latency in distributed hash table systems. In Proc. of ACM SIGMETRICS (2003).
19. ZHAO, B. Y., DUAN, Y., HUANG, L., JOSEPH, A., AND KUBIATOWICZ, J. Brocade: Landmark routing on overlay networks. In Proc. of IPTPS (2002).
20. ZHAO, B. Y., HUANG, L., RHEA, S. C., STRIBLING, J., JOSEPH, A. D., AND KUBIA-TOWICZ, J. D. Tapestry: A global-scale overlay for rapid service deployment. IEEE J-SAC 22, 1 (January 2004), 41-53.