Open Access Open Access  Restricted Access Subscription or Fee Access

Efficient Message Routing in Unstructured P2P Using CIS and Ant Search Algorithms

U. Kaleelurrahaman, L.M. Nithya, V. Jeyakrishnan

Abstract


Peer-to-Peer overlay systems offer a substrate for the construction of large scale and distributed applications. Peer-to-Peer applications are differentiated in to two major forms, structured P2P and unstructured P2P. Unlike structured P2P, unstructured P2P does not maintain any technique to keep track of the other peers in the network. Communications between the peers are carried out by either flooding or random walk mechanism. But these mechanisms consume lot of bandwidth during communication. In this paper we propose a novel message routing mechanism which uses the CIS and ant algorithm to provide efficient communication between peers.

Keywords


Ant Search Algorithm, CIS Algorithm, Message Routing, Peer-to-Peer

Full Text:

PDF

References


Xiuqi Li and Jie Wu, “Cluster-based Intelligent Searching in Unstructured Peer-to-Peer Networks” - Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, 2005.

“Efficient secure message routing in structured P2P” - Xu Xiang, Tan Jin- et al, International Conference on Networks Security, Wireless Communications and Trusted Computing.

E. Michlmayr ,“Ant Algorithms for Search in Unstructured Peer-to-Peer Networks”, Data Engineering workshop, Proceedings, 22nd International Conference 2006.

P. Lin, T. Lin and H. Wang, “Dynamic search algorithm in unstructured peer to peer Networks”, IEEE Trans. Parallel and distributed systems, volume.19, May -2006

Shichang Sun Abraham, A. Guiyong Z Hang Hong bo Liu,“A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks” , Computer information systems and industrial management applicationa, 2007. CISIM‟07. 6th International Conference.

Haitao Chen, Zhenghu Gong, Zunguo Huang, “Self-learning Routing in Unstructured P2P Network”, International journal of information technology, volume 11, no.12, 2005

Piotr Karwaczynski, Jaka Mocnik,“IP-based Clustering for Peer-to-Peer Overlays”, Journal of Software, volume 2, no 2, Aug-2007

Zhao Kun Niu Zhendong Zhao Yumin Yang Jun,“Group-Based Search in Unstructured Peer-to-Peer Networks”, Global Telecommunications Conference, GLOBE COM-2009

Reza Dorrigiv, Alejandro Lopez, Pawel Pralat,“Search Algorithms for Unstructured Peer-to- Peer Networks”, 32nd IEEE Conference on Local computer Networks 2007.

Yunfei ZHANG, et al,(2006) „Recent Advances in Research on P2P Networks‟- Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies.

Vishnumurthy .V and Francis .P, (2006 ) „On Heterogeneous Overlay Construction and Random Node Selection in Unstructured p2p Networks,‟ Proc. IEEE INFOCOM.

Reynolds .P and Vahdat .A, (2003 ) „Efficient Peer-to-Peer Keyword Searching,‟ Proc. Int‟l Middleware Conf.

Enhancing Search Performance in Unstructured P2P Networks Based on Users‟ Common Interest, IEEE transactions on parallel and distributed systems, vol. 19, no. 6, June 2008

Research and implementation on routing scheme based on interest mining in unstructured peer to peer system, webage information management workshops, 2006.

Kraxberger, S. Payer, U.” Secure Routing Approach for Unstructured P2P Systems”, Emerging Security Information, Systems and Technologies, 2009. SECURWARE '09. Third International Conference, June 2009.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.