A new and effective hierarchical overlay structure for Peer-to-Peer networks

Computer Communications

Volumn 34, Issue 7, 2011, Pages 862-874

  Xu, Ming ^a,b   Zhou, Shuigeng ^a,b   Guan, Jihong ^c  

^a FUDAN UNIVERSITY   (China)

^b Shanghai Key Laboratory of Intelligent Information Processing   (China)

^c TONGJI UNIVERSITY   (China)

Author keywords

Hierarchical architecture; Peer to Peer networks; Query processing

Indexed keywords

COMPLEX QUERIES; HASH VALUE; HIERARCHICAL ARCHITECTURES; INTRA-CLUSTER; MEMORY SPACE; MULTI-DIMENSIONAL RANGE QUERIES; NETWORK SIZE; OVERLAY STRUCTURES; P2P SYSTEM; PEER TO PEER; PUBLIC INTEREST; QUERY ROUTING; RANGE QUERY; ROUTING TABLE; SKIP-GRAPHS; SKIP-NET; SPEED-UPS; SUPER-PEER;

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; ENGINEERING RESEARCH; NETWORK ARCHITECTURE; OVERLAY NETWORKS; QUERY PROCESSING;

PEER TO PEER NETWORKS;

EID: 79952755946     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2010.10.005     Document Type: Article

References (36)

1. E.K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim A survey and comparison of peer-to-peer network schemes IEEE Communications Tutorials and Surveys 7 2 2005 72 93
2. I. Clarke, O. Sandberg, B. Wiley, T.W. Hong, Freenet: a distributed anonymous information storage and retrieval system, in: Proceedings of Workshop on Design Issues in Anonymity and Unobservability, 2000, pp. 311-320.
3. J. Frankel, T. Pepper, Gnutella, 2000. Available from: .
4. A. Heinla, P. Kasesalu, J. Tallinn, KaZaA, 2001. Available from: .
5. A. Heinla, P. Kasesalu, J. Tallinn, Skype, 2003. Available from: .
6. 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. (Pubitemid 32981961)
7. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: Proceedings of ACM SIGCOMM, 2001, pp. 161-172. (Pubitemid 32981962)
8. A. Rowstron, P. Druschel, Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms, 2001, pp. 329-350. (Pubitemid 33362020)
9. B.Y. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing, U.C. Berkeley Technical Report, UCB/CSD-01-1141, 2001.
10. R. Rodrigues, C. Blake, When multi-hop peer-to-peer lookup matters, in: Proceedings of 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04) and LNCS 3279, 2004, pp. 112-122. (Pubitemid 41190543)
11. N. Magharei, R. Rejaie, Y. Guo, Mesh or multiple-tree: a comparative study of live P2P streaming approaches, in: Proceedings of 26th IEEE International Conference on Computer Communications, 2007, pp. 1424-1432. (Pubitemid 47334368)
12. N. Magharei, and R. Rejaie PRIME: peer-to-peer receiver-driven mesh-based streaming IEEE/ACM Transactions on Networking 17 4 2009 1052 1065
13. D. Ren, Y.T.H. Li, and S.-H. Chan Fast-Mesh: a low-delay high-bandwidth mesh for peer-to-peer live streaming IEEE Transactions on Multimedia 11 8 2009 1446 1456
14. M. Schlosser, M. Sintek, S. Decker, W. Nejdl, Hypercup-hypercubes, ontologies and efficient search on p2p networks, in: Proceedings of International Workshop on Agents and Peer-to-Peer Computing, 2002, pp. 112-124.
15. E. Anceaume, R. Ludinard, A. Ravoaja, F. Brasileiro, PeerCube: a hypercube-based P2P overlay robust against collusion and churn, in: Proceedings of 2nd IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008, pp. 15-24.
16. K. Gummadi, R. Gummadiy, S. Gribblez, S. Ratnasamyx, S. Shenker, I. Stoica, The impact of DHT routing geometry on resilience and proximity, in: Proceedings of ACM SIGCOMM, 2003, pp. 381-394.
17. J. Aspnes, G. Shah, Skip graphs, in: Proceedings of 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 384-393.
18. N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, A. Wolman, SkipNet: a scalable overlay network with practical locality properties, in: Proceedings of 4th USENIX Symposium on Internet Technologies and Systems, 2003, pp. 113-126.
19. W. Pugh Skip lists: a probabilistic alternative to balanced trees Communications of the ACM 33 6 1990 668 676 (Pubitemid 21672422)
20. G.M. Morton, A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing, Technical Report, IBM Ltd., Ottawa, Ontario, March 1, 1966.
21. T. He, J. Ni, A.M. Segre, S. Wang, B.M. Knosp, SkipMard: a multi-attribute peer-to-peer resource discovery approach, in: Proceedings of Second International Multi-Symposiums on Computer and Computational Sciences, 2007, pp. 266-273.
22. T. Schütt, F. Schintke, A. Reinefeld, Structured overlay without consistent hashing: empirical results, in: Proceedings of Sixth IEEE International Symposium on Cluster Computing and the Grid Workshops, 2006, p. 8.
23. T. Schütt, F. Schintke, A. Reinefeld, Scalaris: reliable transactional P2P key/value store, in: Proceedings of Seventh ACM SIGPLAN workshop on Erlang, 2008, pp. 41-48.
24. T. Schütt, F. Schintke, A. Reinefeld, A structured overlay for multi-dimensional range queries, in: Proceedings of 13th International Euro-Par Conference on Parallel Processing, LNCS 4641, 2007, pp. 503-513.
25. S. Alaei, M. Ghodsi, and M. Toossi SkipTree: A new scalable distributed data structure on multidimensional data supporting range-queries Computer Communications 33 1 2010 73 82
26. A.G. Beltrán, P. Sage, P. Milligan, Skip tree graph: a distributed and balanced search tree for peer-to-peer networks, in: Proceedings of IEEE International Conference on Communications, 2007, pp. 1881-1886.
27. K. Aberer, P. Cudr-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt P-Grid: a self-organizing structured P2P system SIGMOD Record 32 3 2003 29 33 (Pubitemid 40290284)
28. A.M. Ouksel, and G. Moro G-Grid: A class of scalable and self-organizing data structures for multi-dimensional querying and content routing in P2P networks LNAI 2872 2004 123 137
29. E. Fredkin Trie memory Communications of the ACM 3 1960 490 500
30. B. Lampson, V. Srinivasan, and G. Varghese IP lookups using multiway and multicolumn search IEEE/ACM Transaction on Networks 7 3 1999 324 334
31. R. Sangireddy, N. Futamura, S. Aluru, and A.K. Somani Scalable, memory efficient, high-speed IP lookup algorithms IEEE/ACM Transactions on Networking 13 4 2005 802 812 (Pubitemid 41269123)
32. G. Schrack Finding neighbors of equal size in linear quadtrees and octrees in constant time Computer Vision, Graphics, and Image Processing: Image Understanding 55 3 1992 221 230
33. M.D. Adams, and D.S. Wise Fast additions on masked integers SIGPLAN Notices 41 5 2006 39 45 (Pubitemid 44323926)
34. R. Raman, and D.S. Wise Converting to and from dilated integers IEEE Transactions on Computers 57 4 2008 567 573 (Pubitemid 351411564)
35. D.S. Wise, Ahnentafel indexing into morton-ordered arrays, or matrix locality for free, in: Proceedings of EUROPAR 2000: Parallel Processing, LNCS 1900, 2000, pp. 774-783.
36. G.P. Jesi, PeerSim HOWTO: build a new protocol for the PeerSim 1.0 simulator, 2003. Available from: .