HyPeer: Structured overlay with flexible-choice routing

Computer Networks

Volumn 55, Issue 1, 2011, Pages 300-313

  Serbu, Sabina ^a   Felber, Pascal ^a   Kropf, Peter ^a  

^a UNIVERSITY OF NEUCHÂTEL   (Switzerland)

Author keywords

Distributed hash table; Fault tolerance; Load balancing; Peer to peer; Routing

Indexed keywords

AVERAGE PATH LENGTH; COMMUNICATION PATH; DESIGN OBJECTIVES; DISTRIBUTED HASH TABLE; DISTRIBUTED HASH TABLES; EXPERIMENTAL EVALUATION; GREEDY ROUTING; HYPERCUBE; HYPERCUBE STRUCTURE; LOAD BALANCE; LOAD-BALANCING; LOW LATENCY; MULTIPLE ROUTING; PEER TO PEER; REDUNDANT PATHS; ROUTING; ROUTING PERFORMANCE; RUNTIMES; STRUCTURED OVERLAYS;

DESIGN; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL ARCHITECTURES; QUALITY ASSURANCE; ROUTING ALGORITHMS; TELECOMMUNICATION NETWORKS;

FAULT TOLERANCE;

EID: 78651361523     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2010.09.006     Document Type: Article

References (21)

1. I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, in: Proceedings of ACM SIGCOMM, 2001, pp. 149-160.
2. M.F. Kaashoek, D.R. Karger, Koorde: a simple degree-optimal distributed hash table, in: Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS), 2003, pp. 323-336.
3. D. Malkhi, M. Naor, D. Ratajczak, Viceroy: a scalable and dynamic emulation of the butterfly, in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002, pp. 183-192.
4. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content addressable network, in: Proceedings of ACM SIGCOMM, 2001, pp. 161-172.
5. A. Rowstron, and P. Druschel Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems Lecture Notes in Computer Science 2218 2001 329 350
6. B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz Tapestry: a resilient global-scale overlay for service deployment IEEE Journal on Selected Areas in Communications 22 1 2004 41 53
7. P. Maymounkov, D. Mazieres, Kademlia: a peer-to-peer information system based on the xor metric, in: Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS), 2002, pp. 53-65.
8. S. Serbu, P. Kropf, P. Felber, Fault-tolerant P2P networks: how dependable is greedy routing?, in: Workshop on Dependable Application Support in Self-Organising Networks (DSN), 2007.
9. H. Shen, Y. Zhu, Plover: a proactive low-overhead file replication scheme for structured p2p systems, in: Proceedings of IEEE International Conference on Communications (ICC), 2008, pp. 5619-5623.
10. G.S. Manku, Randomized ID selection for peer to peer networks, in: Proceedings of the Principles of Distributed Computing (PODC), 2004.
11. T. Locher, S. Schmid, R. Watternhofer, eQuus: a provably robust and locality-aware peer-to-peer system, in: Proceedings of the Sixth International Conference on Peer-to-Peer Computing, 2006, pp. 3-11.
12. M. Schlosser, M. Sintek, S. Decker, W. Nejdl, Hypercup - hypercubes, ontologies and efficient search on P2P networks, in: First Workshop on Agents and P2P Computing Springer (AP2PC), in: LNCS, vol. 2530, 2002, pp. 112-124.
13. J.I. Alvarez-Hamelin, A.C. Viana, M.D. Amorim, DHT-based functionalities using hypercubes, in: Proceedings of World Computer Congress IFIP WCC, vol. 212, 2006, pp. 157-176.
14. J. Aspnes, Z. Diamadi, G. Shah, Fault-tolerant routing in peer-to-peer systems, in: Proceedings 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002, pp. 223-232.
15. J. Aspnes, Z. Diamadi, G. Shah, Greedy routing in peer-to-peer systems, extended version of 'Fault-tolerant routing in peer-to-peer systems' from PODC, in: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, 2006.
16. M. Castro, P. Drushel, A. Ganesh, A. Rowstron, D. Wallach, Secure routing for structured peer-to-peer overlay networks, in: Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI), 2002, pp. 299-314.
17. E. Oh, J. Chen, Parallel routing in hypercube networks with faulty nodes, in: International Conference on Parallel and Distributed Systems (ICPADS), 2001, pp. 338-345.
18. S. Serbu, S. Bianchi, P. Kropf, and P. Felber Dynamic load sharing in peer-to-peer systems: when some peers are more equal than others IEEE Internet Computing 11 4 2007 53 61
19. F. Dabek, R. Cox, F. Kaashoek, R. Morris, Vivaldi: a decentralized network coordinate system, in: Proceedings of ACM SIGCOMM, 2004, pp. 15-26.
20. S. Seetharaman, V. Hilt, M. Hofmann, M. Ammar, Preemptive strategies to improve routing performance of native and overlay layers, in: Proceedings of INFOCOM, 2007.
21. V. Aggarwal, O. Akonjang, and A. Feldmann Improving user and ISP experience through ISP-aided P2P locality Proceedings of 11th IEEE Global Internet Symposium GI'08 2008 IEEE Computer Society Washington, DC, USA