Leveraging Heterogeneity Make Resource Location Efficient in Peer-to-Peer Networks

Abstract:

Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, the heterogeneity is an inherent characteristic of P2P systems. In this paper, according to the previous researches in P2P resource sharing networks, we first conclude and classify the heterogeneity in P2P networks, and then analyze each type of P2P systems that utilize heterogeneity in P2P network. The above analysis and conclusion will become a good guidance to design new resource locating algorithm which takes advantage of heterogeneity in P2P networks.

• Periodical: Advanced Materials Research (Volumes 295-297)
• Pages: 1945-1950
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.295-297.1945
• Online since: July 2011
• Authors: Ya Dong Gong, Yong Xiang Wen, He Ping Deng, Zhan Ran Gu
• Keywords: Efficiency, Heterogeneity, Peer-to-Peer (P2P), Resource Location

References

[1] Napster, http://www.napster.com, 2003.

[2] B. Yang, and H. Garcia-Molina, Improving search in peer-to-peer networks, Proc. of the 22nd IEEE International Conference on Distributed Computing, Vienna, Austria, pp.5-14, 2002.

DOI: 10.1109/icdcs.2002.1022237

[3] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peer-to-peer networks, Proc. of the 16th ACM International Conference on Supercomputing New York, USA, pp.84-95, 2002.

DOI: 10.1145/514191.514206

[4] A. Crespo, and H. Garcia-Molina, Routing indices for peer-to-peer systems, Proc. of the 22nd International Conference on Distributed Computing, Vienna, Austria, pp.23-32, 2002.

DOI: 10.1109/icdcs.2002.1022239

[5] S. C. Rhea, and J. Kubiatowicz, Probabilistic location and routing, Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, USA, pp.1248-1257, 2002.

DOI: 10.1109/infcom.2002.1019375

[6] Gnutella, http://www.gnutella.com, 2006.

[7] A. Rowstron, and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, Proc. of the 18th IFIP/ACM International Conference of Distributed Systems Platforms, Heidelberg, Germany, pp.329-350, 2001.

DOI: 10.1007/3-540-45518-3_18

[8] K. Hildrum, J. Kubiatowicz, S. Rao, and B. Y. Zhao, Distributed object location in a dynamic network, Proc. of 14th ACM Symposium on Parallel Algorithms and Architectures, Crete Island, Greece, 2002.

DOI: 10.1145/564870.564877

[9] P. Maymounkov, and D. Mazieres, Kademlia: A peer-to-peer information system based on the XOR metric, Proc. of the 1st International Workshop on Peer-to-Peer Systems, Cambridge, MA, USA, 2002.

DOI: 10.1007/3-540-45748-8_5

[10] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content-addressable network, Proc. of the 2001 ACM Annual Conference of the Special Interest Group on Data Communication, (2001)

DOI: 10.1145/964723.383072

[11] CHAWATHE, Y., RATNASAMY, S., BRESLAU, L., LANHAM, N., AND SHENKER, S. Making Gnutella-like p2p systems scalable, Proc. of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe, Germany, p.407–418. 2003.

DOI: 10.1145/863955.864000

[12] E. Adar and B.A. Huberman, Free Riding on Gnutella, http://www.firstmonday.dk/issues/ issue5_10/adar/, 2003.

DOI: 10.5210/fm.v5i10.792

[13] S. Saroiu, P. Gummadi, and S. Gribble, A Measurement Study of Peer-to-Peer File Sharing Systems, Proc. Multimedia Computing and Networking Conference, 2002.

DOI: 10.1117/12.449977

[14] L. Guo, S. Jiang, L. Xiao, and X. Zhang, Fast and Low Cost P2P Searching by Exploiting Localities in Peer Community and Individual Peers, Journal of the Parallel and Distributed Computing, vol. 65, no. 6, pp.729-742, 2005.

DOI: 10.1016/j.jpdc.2005.01.007

[15] Chen Wang, and Li Xiao, An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, vol. 18, no. 2, (2007)

DOI: 10.1109/tpds.2007.20

[16] M. Bawa, GS Manku, and P. Raghavan, SETS: Search Enhanced by Topic Segmentation. Proc. of the SIGIR, (2003)

DOI: 10.1145/860435.860491

[17] SyuYang Chen, Wen-Hsien Tseng, Hsing Mei, A Multilayer Topic-Group based P2P Network, Proc. of the 20th International Conference on Advanced Information Networking and Applications, vol. 2, pp.702-706, (2006)

DOI: 10.1109/aina.2006.38

[18] B. T. Loo et al., The Case for a Hybrid P2P Search Infrastructure, Proc. of the 3rd IPTPS, San Diego, California, USA, 2004.

[19] SRIPANIDKULCHAI, K., MAGGS, B., AND ZHANG, H, Efficient content location using interest-based locality in peer-to-peer systems, Proc. of IEEE INFOCOM, 2003.

DOI: 10.1109/infcom.2003.1209237

[20] R. Zhang and Y. C. Hu., Assisted Peer-to-Peer Search with Partial Indexing, Proc. of IEEE INFOCOM, 2005.

[21] Sen, S.,Wang, J, Analyzing peer-to-peer traffic across large networks. ACM/IEEE Transactions on Networking, (2004)

DOI: 10.1109/tnet.2004.826277

[22] Saroiu, S., Gummadi, P.K., Gribble, S.D, Measuring and analyzing the characteristics of napster and gnutella hosts, Multimedia Systems, vol. 9, p.170–184, (2003)

DOI: 10.1007/s00530-003-0088-1

[23] V. Lo, D. Zhou, Y. Liu, C. GauthierDickey, J. Li, Scalable Supernode Selection in Peer-to-Peer Overlay Networks, Proc. of Hot Topics in Peer-to-Peer Systems, (2005)

DOI: 10.1109/hot-p2p.2005.17

[24] YANG, B. AND GARCIA-MOLINA, H. 2002a, Designing a super-peer network, Technical Report., Stanford University, http://dbpubs.stanford.edu/pub/2002-13.

[25] A. Mizrak, Y. Cheng, V. Kumar, and S. Savage, Structured superpeers: Leveraging heterogeneity to provide constant-time lookup, Proc. of the IEEE Workshop on Internet Applications, 2003.

DOI: 10.1109/wiapp.2003.1210294

[26] W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, and A. L¨oser, Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-To-Peer Networks, Proc. of the International World Wide Web Conference, 2003.

DOI: 10.1145/775152.775229

[27] K. Eger and U. Killat. Bandwith trading in unstructured P2P content distribution networks. Proc. of the IEEE P2P, Cambridge, UK, p.39–46, 2006.

DOI: 10.1109/p2p.2006.6

[28] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, Splitstream: High-bandwith content distribution in cooperative environments, Proc. of IPTPS, Berkeley, USA, 2003.

DOI: 10.1007/978-3-540-45172-3_27

[29] Couto da Silva, A., Leonardi, E., Mellia, M., Meo, M, A bandwith-aware scheduling strategy for p2p-tv systems, Proc. of the 8th International Conference on Peer-to-Peer Computing, Aachen, 2008.

DOI: 10.1109/p2p.2008.38

[30] BHAGWAN, R., SAVAGE, S., AND VOELKER, G, Understanding Availability, Proc. of the 2nd International Workshop on Peer-to-Peer Systems, Berkeley, CA, 2003.

[31] J. Sacha, J. Dowling, R. Cunningham, and R. Meier, Discovery of Stable Peers in a Self-Organising Peer-to-Peer Gradient Topology. Proc. Sixth Int'l Conf. Distributed Applications and Interoperable Systems, p.70–83, 2006.

DOI: 10.1007/11773887_6

[32] F. Wang, J. Liu, Y. Xiong, Stable Peers: Existence, Importance, and Application in Peer-to-Peer Live Video Streaming, Proc. of the IEEE Infocom, Phoenix, AZ, 2008.

DOI: 10.1109/infocom.2008.194