Abstract

Peer-to-Peer (P2P) applications have been extensively used for file sharing and accounts for more than 70% of the traffic in the internet. The inherent characteristics of P2P make it advantageous in content distribution when compared to client-server architecture. In a P2P network, there is no clear distinction between client and server nodes, as every peer is both a client and a server at the same time. Thus, the time required to distribute data is lesser when compared to the client-server method. Due to the distributed and scalability of P2P, structured P2P approaches have also been proposed for ad-hoc networks. The potential for distributed P2P networking applications using a structured lookup algorithm such as Chord is enormous. However, whilst it has been proven that a structured approach improves lookup performance in a high bandwidth wired network; overlay networks may create unnecessary overhead that could negatively impact performance given an unstable environment such as a Wireless Mesh Network (WMN). In this paper, it is proposed to study existing CHORD protocols on WMN when nodes are static and dynamic.

References

• Ian F. Akyildiz, Xudong Wang, Weilin Wang, Wireless mesh networks: a survey, Computer Networks 47 (2005) 445–487.
• J. Jun, M. L. Sichitiu, The nominal capacity of wireless mesh networks, IEEE Wireless Communications 10 (5) (2003) 8–14.
• Stratis Ioannidis, Peter Marbach. On the design of hybrid peer-to-peer systems [J]. ACM SIGMETRICS Performance Evaluation Review, 2008, 36(1): 157-168
• Bartosz Biskupski, Jim Dowling, Jan Sacha. Properties and mechanisms of self-organizing MANET and P2P systems [J]. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 2007, 2(1):1-34.
• Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan,"Chord: A scalable peer-to-peer lookup protocol for internet applications," IEEE/ACM Transactions on Networking, Vol. 11, No. 1, pp. 17–32, 2003.
• Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker. A scalable contentaddressable network. In SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 161–172, New York, NY, USA, 2001. ACM Press.
• Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp. 329-350,November 12-16, 2001.
• Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Comput. Sci. Div. , Univ. California, Berkeley, Tech. Rep. UCB/CSD-01-1141, 2001.
• Xianghan Zheng and Vladimir Oleshchuk, Improvement Of Chord Overlay For P2psip-Based Communication Systems, International Journal of Computer Networks & Communications (IJCNC), Vol. 1, No. 3, October 2009
• Jani, H. and C. Gonzalo, Evaluation of DHTs from the viewpoint of interpersonal communications, in Proceedings of the 6th international conference on Mobile and ubiquitous multimedia. 2007, ACM: Oulu, Finland.
• J. Li, J. Jannotti, D. De Couto, D. R. Karger, and R. Morris, "A scalable location service for geographic ad hoc routing," in Proc. 6th ACM Int. Conf. Mobile Computing and Networking, Boston, MA, Aug. 2000, pp. 120–130.
• Napster. [Online]. Available: http://www. napster. com/
• Gnutella. [Online]. Available: http://gnutella. wego. com/
• D. Liben-Nowell, H. Balakrishnan, and D. R. Karger, "Analysis of the evolution of peer-to-peer systems," in Proc. 21st ACM Symp. Principles of Distributed Computing (PODC), Monterey, CA, July 2002, pp. 233–242.