Browse > Article

An Efficient Content Sharing Scheme in Structured P2P Systems  

Bae, Joon-Hyun (경북대학교 전자전기컴퓨터학부)
Kim, Sang-Wook (경북대학교 전자전기컴퓨터학부)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.15, no.6, 2009 , pp. 430-434 More about this Journal
Abstract
In this paper, we propose an efficient content sharing scheme for structured P2P overlay network. The main idea of this paper is to exploit the identified routing table instead of anonymous one using social relationships among nodes. The contribution of this paper is to present a means of mitigating the problem of 'free riding' and the threat of misrouting attack by malicious nodes.
Keywords
DHT; P2P Routing; Content Sharing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 L. A. Adamic, R.M. Lukose, A. R. Puniyani, and B. A. Huberman, 'Search in power-law networks,' Physical Review E, Vol.64, 046135, 2001   DOI
2 L A. Adamic and E. Adar. 'How to search a social network,' Social Networks, Vol.27, No.3, pp. 187-203, 2005   DOI   ScienceOn
3 M. Castro, P. Drushel, P. Ganesh, A. Rowstron, and D. Wallach, 'Secure Routing for Structured Peer-to-Peer Overlay Networks,' In Proc. of OSDI'02, Boston, Massachusetts, USA. 2002
4 D. J. Watts, P. S. Dodds, and M. E. J. Newman, 'Identity and search in social networks,' Science, Vol.296, pp. 1302-1305, 2002   DOI   ScienceOn
5 S. Marti, P. Ganesan, and H. Grarcia-Monila, 'SPROUT: P2P Routing with Social Networks,' Current Trends in Database Technology, LNCS 3268, 2005   DOI   ScienceOn
6 S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, 'A scalable content-addressable network,' In Proc. ACM SIGCOMM'01, San Diego, California, USA, pp. 161-172, 2001   DOI
7 E. Adar and B. A. Huberman, 'Free Riding on Gnutella,' First Monday, Vol.5, No.10, 2000
8 A. Rowstron and P. Druschel, 'Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems,' In IFIP/ACM Internal Conf. Dist. Syst. Platform (Middleware), Heidelberg, Germany, pp. 329-350, 2001
9 I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishan, “Chord: a scalable peer-to-peer lookup protocol for internet applications,” IEEE/ACM Transactions on Networking, Vol.11, No.1, pp. 17-32, 2003   DOI   ScienceOn