A structured hierarchical P2P model based on a rigorous binary tree code algorithm

Future Generation Computer Systems

Volumn 23, Issue 2, 2007, Pages 201-208

  Liu, Hongjun ^a   Luo, Ping ^a   Zeng, Zhifeng ^b  

^a TSINGHUA UNIVERSITY   (China)

^b Department of Computer Science and Technology ^*  (China)

Author keywords

DHT; P2P; Rigorous binary tree code algorithm; Super peer

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTER NETWORKS; HIERARCHICAL SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS); TREES (MATHEMATICS);

PEER TO PEER SYSTEMS; RIGOROUS BINARY TREE CODE ALGORITHM; SUPER PEER;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748581309     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2006.04.016     Document Type: Article

References (27)

1. Napster. http://www.napster.com/
2. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker, Making gnutella-like networks scalable, in: ACM SIGCOMM, 2003, pp. 407-418, Gnutella, http://gnutella.wego.com/
3. B. Yang, H. Garcia-Molina, Comparing hybrid peer-to-peer systems, in: Proc. of the 27th Intl. Conf. on Very Large Databases, September 2001
4. D.M. Lewin, Consistent hashing and random trees: Algorithms for caching in distributed networks, Master thesis, Department of EECS, MIT, 1998. Available at the MIT library, http://thesis.mit.edu/
5. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, R. Panigrahy, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web, in: Proceedings of the 29th ACM Symposium on Theory of Computing, STOC, 4-6 May 1997, pp. 654-663
6. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, in: Proc. ACM SIGCOMM 2001, 2001, pp. 149-160
7. I. Clarke, O. Sandberg, B. Wiley, T. Hong, Freenet: A distributed anonymous information storage and retrieval system, in: Proceedings of ICSI Workshop on Design Issues in Anonymity and Unobservability, Berkeley, California, June 2000, Freenet.sourceforge.net
8. KaZaA, http://www.kazaa.com/
9. B. Yang, H. Garcia-Molina, Designing a super-peer network, Technical Report, Stanford University, 2002. Available at http://www-db.stanford.edu/~byang/pubs/superpeer.pdf
10. Taylor I.J. From P2P to Web Services and Grids. Peer in a Client/Server Word (2005), Springer-Verlag London Limited
11. I. Gupta, K. Birman, P. Linga, A. Demers, R. Van Renesse, Kelips: building an efficient and stable P2P DHT through increased memory and background overhead, in: 2nd International Peer-To-Peer Systems Workshop, IPTPS 2003, Berkeley, CA, USA, February 2003
12. M. Freedman, D. Mazieres, Sloppy hashing and self-organizing clusters, in: 2nd International Peer-To-Peer Systems Workshop, IPTPS 2003, Berkeley, CA, USA, February 2003
13. S. Zhou, Study on the distributed routing algorithm and its security for Peer-to-Peer computing, Ph.D. Thesis, Chengdu, University of Electronic Science and Technology of China, 2004
14. TTL(Time To Live), http://www.fact-index.com/t/ti/time_to_live.html
15. R. Schollmeier, A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications, in: Proceedings of the first International Conference on Peer-to-Peer Computing, P2P2001
16. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in: Proc. ACM SIGCOMM, San Diego, CA, August 2001, 2001
17. A. Rowstron, P. Druschel, Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems, in: Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, November 2001
18. R.L. Rivest, The MD5 Message Digest Algorithm, RFC1320, April 1992
19. B. Zhao, J. Kubiatowicz, A. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, April 2001
20. National Institute of Standards and Technology, NIST FIPS PUB 180, Secure Hash Standard, U.S. Department of Commerce, May 93
21. Ripeanu M., Iamnitchi A., and Foster I. Mapping the gnutella network. IEEE Internet Computing 6 1 (2002) 50-57
22. T. Saroiu, P. Krishna Gummadi, S.D. Gribble, A measurement study of peer-to-peer file sharing systems, in: Proceedings of Multimedia Computing and Networking 2002, MMCN '02, San Jose, CA, USA, January 2002
23. K. Truelove, Gnutella and the transient web, Whitepaper, 2002
24. L. Garces-Erice, E. Biersack, P. Felber, K. Ross, G. UrvoyKeller, Hierarchical peer-to-peer systems, in: Proceedings of EuroPar, Klagenfurt, Austria, 2003
25. Q. Lv, S. Ratnasamy, S. Shenker, Can heterogeneity make gnutella scalable? in: Proc. IPTPS, March 2002
26. W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, A. Löser, Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks, in: Proceedings of the 12th International World Wide Web Conference, Budapest, Hungary, 2003
27. A. Mizrak, Y. Cheng, V. Kumar, S. Savage, Structured super-peers: Leveraging heterogeneity to provide constant-time lookup, in: IEEE Workshop on Internet Applications, 2003