Jiunn-Jye Lee
ABSTRACT
In a structured peer-to-peer network, frequent join and leave of peer members cause huge maintenance overhead. To deal with this churn problem, we proposed a sector-based routing model (SBRM). The key space is divided into several sectors and each sector has a peer member acting as the relay proxy of the sector. Then the cost of join and leave can be greatly reduced. In this paper we choose Chord as the underlying structured network and perform a series of simulation. Analysis and simulation results show that SBRM achieve lower communication cost when a member joined or left the system, and message routing path length is also shortened.
- P. H. K. Xue and J. Li. Fs-chord: A new p2p model with fractional steps joining. Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services, AICT/ICIW'06 2006, page 98, Febrary 19--25 2006. Google Scholar
Digital Library
- A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, pages 329--350, November 12--16 2001. Google ScholarDigital Library
- M. H. R. K. S. Ratnasamy, P. Francis and S. Shenker. A scalable content addressable network. Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 161--172, 2001. Google ScholarDigital Library
- I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishna. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 149--160, August 27--31 2001. Google ScholarDigital Library
- B. Wang and P. He. L-chord: Routing model for chord based on layer-dividing. Proceedings of the IEEE International Conference on Computational Intelligence and Security, ICCIS'07, pages 262--265, December 15--19 2007. Google ScholarDigital Library
- J. K. Y. Zhao and 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, 2001. Google ScholarDigital Library
- B. Yang and H. Garcia-Molina. Designing a super-peer network. Proceedings of the IEEE International Conference on Data Engineering, ICDE'03, pages 49--60, December 15--19 2003.Google Scholar
Index Terms
- A sector-based routing model over structured peer-to-peer networks
Recommendations
An adaptive sector-based routing model over structured peer-to-peer networks
It is common that members of a peer-to-peer network join and leave the system at any time. But in a structured peer-to-peer network, frequent joining and leaving may cause huge maintenance overhead. To deal with this churn problem, we proposed a two-...
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems, provide efficient mechanisms for resource placement and location. A key distinguishing feature of current DHT systems, such as Chord, Pastry, CAN and Tapestry, is ...
Performance analysis of structured peer-to-peer overlays for mobile networks
Distributed Hash Table DHT based Peer-to-Peer P2P overlays have been widely researched and deployed in many applications such as file sharing, IP telephony, content distribution and media streaming applications. However, their deployment has largely ...
Comments