Skip to main content
SpringerLink
Log in

A Novel Message Routing in Unstructured P2P Using CIS and Ant Search Algorithm

  • Conference paper
Computer Networks and Information Technologies (CNC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 142))

Abstract

Peer-to-Peer (P2P) overlay systems offer a substrate for the construction of large scale and distributed applications. P2P 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Li, X., Wu, J.: Cluster-based Intelligent Searching in Unstructured Peer-to-Peer Networks. In: 25th IEEE International Conference on Distributed Computing Systems, pp. 642–645. IEEE Press, Los Alamitos (2005)

    Google Scholar 

  2. Xiang, X., Jin, T.: Efficient secure message routing in structured P2P. In: International Conference on Networks Security, Wireless Communications and Trusted Computing, pp. 354–357. IEEE Press, Los Alamitos (2009)

    Google Scholar 

  3. Michlmayr, E.: Ant Algorithms for Search in Unstructured Peer-to-Peer Networks. In: 22nd International Conference on Data Engineering Workshops, pp. x142–x142. IEEE Press, Los Alamitos (2006)

    Chapter  Google Scholar 

  4. Lin, T., Lin, P., Wang, H., Chen, C.: Dynamic search algorithm in unstructured peer to peer Networks. IEEE Trans. Parallel Distrib. Syst. 19, 654–666 (2009)

    Google Scholar 

  5. Dorrigiv, R., Lopez-Ortiz, A., Prałat, P.: Search Algorithms for Unstructured Peer-to- Peer Networks. In: 32nd IEEE Conference on Local Computer Networks, pp. 343–352. IEEE Press, Los Alamitos (2007)

    Google Scholar 

  6. Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching. In: Endler, M., Schmidt, D.C. (eds.) Middleware 2003. LNCS, vol. 2672, pp. 21–50. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Chen, G., Low, C.P., Yang, Z.: Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest. IEEE Trans. Parallel Distrib. Syst. 19, 821–836 (2008)

    Article  Google Scholar 

  8. Tan, Y., Lin, Y., Chen, Z., Dong, T.: Research and Implementation on Routing Scheme Based on Interest Mining in unstructured P2P Systems. In: 7th International Conference on Web-Age Information Management Workshops, pp. 2–2. IEEE Press, Los Alamitos (2006)

    Google Scholar 

  9. Kraxberger, S., Payer, U.: Secure Routing Approach for Unstructured P2P Systems. In: 3rd IEEE International Conference on Emerging Security Information, Systems and Technologies, pp. 210–216. IEEE Press, Los Alamitos (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SNS College of Technology, Coimbatore, 641035, Tamilnadu, India

    M. Sadish Sendil, U. Kaleelurrahaman, M. Kavitha & S. Karthik

  2. Coimbatore Institute of Engineering and Technology, Coimbatore, 641109, Tamilnadu, India

    N. Nagarajan

Authors
  1. M. Sadish Sendil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Nagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. U. Kaleelurrahaman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Kavitha
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. S. Karthik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineers Network, Trivandrum, Kerala, India

    Vinu V Das

  2. ILAHIA College of Engineering, Kothamangalam, India

    Janahanlal Stephen

  3. Guru Jambheshwar University of Science and Technology, Hisar, Haryana, India

    Yogesh Chaba

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sendil, M.S., Nagarajan, N., Kaleelurrahaman, U., Kavitha, M., Karthik, S. (2011). A Novel Message Routing in Unstructured P2P Using CIS and Ant Search Algorithm. In: Das, V.V., Stephen, J., Chaba, Y. (eds) Computer Networks and Information Technologies. CNC 2011. Communications in Computer and Information Science, vol 142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19542-6_127

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19542-6_127

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19541-9

  • Online ISBN: 978-3-642-19542-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation