Browse > Article

TP2P: Topology-based Peer-to-Peer System for Efficient Resources Lookup  

Cha, Bong-Kwan (부산대학교 컴퓨터공학과)
Han, Dong-Yun (부산대학교 컴퓨터공학과)
Son, Young-Song (한국정보통신연구 홈네트워크)
Kim, Kyong-Sok (부산대학교 컴퓨터공학과)
Abstract
P2P systems are distributed data sharing systems, and each node in them plays the role of client as well as server. There are several studies using Distributed Hash Table, such as Chord, CAN, Tapestry, Pastry, but these systems don't consider the physical latency, therefore they have a weakness of difficulty to guarantee stable performance. To improve this problem, we present the TP2P system. This system is a self-organizing hierarchical overlay system and it uses Chord routing mechanism for lookup data. This system is organized by several subnets, each subnet is organized by physically close nodes, and global network organized by all nodes. In each subnet, one node finds a data, it saves in a node in the subnet, therefore it has higher probability to reduce physical lookup latency than Chord system. And each node has global information of some nodes in its subnet, and it is used to lookup data, therefore the number of hops decrease about 25% as well as the physical lookup latecy are reduced.
Keywords
P2P system; DHT; Chord; physical latency; hierarchical overlay network;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Y. Zhao, Y. Duan, and L. Huang, 'Brocade: Landmark Routing on Overlay Networks,' In Proceedings of the 1st International Workshop on Peer-to-Peer Systems, March 2002
2 B. Yang and H. Garcia-Molina, 'Designing a super-peer network,' ech. Rep. 2002-13, Stanford University, 2002
3 Shin, S. Lee, G., Lim, H. Yoon, and J. S. Ma, 'Grapes: Topolgy-based Hierarchical Virtual Net-work for Peer-to-peer Lookup Services,' In Pro-ceedings of the International Conference on Parallel Processing Workshops (ICPPW' 02), 2002
4 I.Stoica, R. Morris, D. Karger, M. F. Kaashoek and H. Balakrkshnan, 'Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.' In Proceedings of SIGCOMM, ACM, August 2001
5 A. Rowstron and P. Druschel, 'Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peerto-peer Systems,' In Proceedings of IFIP/ACM Middleware 2001, November 2001
6 B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, 'Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing,' Tech. Rep. UCB/CSD-01-1141, UC Berkeley, EECS, 2001
7 Gnutella. http://www.gnutella.com
8 S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker,'A Scalable Content-Addressable Network,' In Proceedings of SIGCOMM, ACM, August 2001
9 Napster. http://www.napster.com