Skip to main content
SpringerLink
Log in

Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

The growing popularity of Peer-to-Peer (P2P) technology in real applications in recent years has sparked increasing interest from both academia and industry in designing resilient P2P networks for these applications. Routing is a crucial technique to support successful P2P applications, and designing robust routing mechanisms is still a technical challenge for P2P systems and applications due to their inherent dynamics. This paper addresses the issue of resilient routing in unstructured P2P networks. To this end, we first propose a novel query routing approach to improving query performance in unstructured P2P networks, and then develop a mobile agent based network reconfiguration mechanism that provides a combined node and link failure diagnosis and restoration to maintain routing performance even in dynamic network environments. Simulated results show that the proposed query routing approach can achieve a good tradeoff between query hit rates and space costs in scale-free networks and that the mobile agent based network reconfiguration mechanism outperforms the existing methods in different types of network topologies.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

References

  1. Gnutella. Available: http://www.ieee.org/ (2000)

  2. KaZaA. Available: http://www.kazaa.com/ (2001)

  3. Skype. Available: http://www.skype.com/ (2003)

  4. Jiang, S., Guo, L., Zhang, X., Wang, H.D.: LightFlood: minimizing redundant messages and maximizing the scope of peer-to-peer search. IEEE Trans. Parallel Distrib. Syst. 19(5), 601–614 (2008)

    Article  Google Scholar 

  5. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of IEEE Conference on Computer Communications, pp. 7–11. Paris, France (2004)

  6. Bisnik, N., Abouzeid, A.: Optimizing random walk search algorithms in P2P networks. Comput. Netw. 51(6), 1499–1514 (2007)

    Article  MATH  Google Scholar 

  7. Nelakuditi, S., Lee, S., Yu, Y., Zhang, Z.-L., Chuah, C.-N.: Fast local rerouting for handling transient link failures. IEEE/ACM Trans. Netw. 15(2), 359–372 (2007)

    Article  Google Scholar 

  8. Li, X., Ji, H., Yu, F.R., Zheng, R.M.: A FCM-Based peer grouping scheme for node failure recovery in wireless P2P file sharing. In: Proceedings of IEEE Conference on Communications, pp. 1–5. Dresden, Germany (2009)

  9. Chopra, D., Schulzrinne, H., Marocco, E., Ivov, E.: Peer-to-peer overlays for real-time communication: security issues and solutions. IEEE Commun. Surv. Tutor. 11(1), 4–12 (2009)

    Article  Google Scholar 

  10. Markopulu, A., Iannaccone, G., Bhattacharya, S., Chuah, C.-N., Diot, C.: Characterization of failures in an IP backbone. In: Proceedings of IEEE INFOCOM, pp. 2307–2317. Hong Kong, China (2004)

  11. Avresky, D., Natchev, N.: Dynamic reconfiguration in computer clusters with irregular topologies in the presence of multiple node and link failures. IEEE Trans. Comput. 54(5), 603–615 (2005)

    Article  Google Scholar 

  12. Schollmeier, G., Charzinski, J., Kirstadter, A., Reichert, C., Schrodi, K.J., Glickman, Y., Winkler, C.: Improving the resilience in IP networks. In: IEEE Workshop on High Performance Switching and Routing, pp. 91–96. Torino, Italy (2003)

  13. Coleri, S., Varaiya, P.: Fault tolerant and energy efficient routing for sensor networks. In: IEEE Global Telecommunications Conference, pp. 10–15. Dallas, Texas, USA (2004)

  14. Ruan, L., Liu, Z.: Upstream node initiated fast restoration in MPLS networks. In: IEEE International Conference on Communications, pp. 959–964. Seoul, Korea (2005)

  15. Jin, D.P., Chen, W.T., Xiao, Z.Y., Zeng, L.G.: Single link switching mechanism for fast recovery in tree-based recovery schemes. In: IEEE International Conference on Communications, pp. 1–5. Beijing, China (2008)

  16. Choi, H., Subramaniam, S., Choi, H.A.: On double link failure recovery in WDM optical networks. In: IEEE International Conference on Communications, pp. 808–816. New York, USA (2002)

  17. Clouqueur, M., Grover, W.D.: Mesh-restorable networks with complete dual failure restorability and with selectively enhanced dual-failure restorability properties. In: SPIE Optical Networking and Communications Conference, pp. 1–12. Boston, USA (2002)

  18. Leonard, D., Yao, Z.M., Rai, V., Loguinov, D.: On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. IEEE/ACM Trans. Netw. 15(3), 644–656 (2007)

    Article  Google Scholar 

  19. Zhu, Y.W.: Resilient P2P anonymous routing by using redundancy. In: Proceedings of the International Workshop on Networking, Architecture, and Storages, pp. 103–110. Shenyang, China (2006)

  20. Ferreira, R.A., Ramanathan M.K., Awan, A., Grama, A., Jagannathan, S.: Search with probabilistic guarantees in unstructured peer-to-peer networks. In: Proceedings of IEEE Conference on Peer-to-Peer Computing, pp. 165–172. Konstanz, Germany (2005)

  21. Tsoumakos, D., Roussopoulos, N.: Analysis and comparison of P2P search methods. In: Proceedings of 1st International Conference on Scalable Information Systems, p. 25. Hongkong, China (2006)

  22. Li X., Wu J.: Searching techniques in Peer-to-Peer networks. In: Wu, J. (ed.) Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. Auerbach Publications,Talyor and Francis Group, Boston (2005)

  23. Shen, X., Yu, H., Buford, J., Akon, M.: Handbook of Peer-to-Peer Networking. Springer, Heidelberg (2010)

    Book  MATH  Google Scholar 

  24. Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A local search mechanism for peer-topeer networks. In: Proceedings of the 11th International Conference on Information and Knowledge Management, pp. 300–307. McLean, Virginia, USA (2002)

  25. Yang, B., Garcia-Molina, H.: Improving search in Peer-to-Peer networks. In: Proceedings of the International Conference on Distributed Computing Systems, pp. 5–14. Vienna, Austria (2002)

  26. Lv, Q, Cao, P, Cohen, E, Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th International conference on Supercomputing, pp. 84–95. New York, USA (2002)

  27. Steinmetz, R., Wehrle, K.: P2P Systems and Applications. Springer, Heidelberg (2005)

    Book  Google Scholar 

  28. Michlmayr, E.: Ant algorithms for search in unstructured peer-to-peer networks. In: Proceedings of the 22nd International Conference on Data Engineering Workshops, p. 142. Atlanta, GA, USA (2006)

  29. Morselli, R., Bhattacharjee, B., Srinivasan, A., Marsh, M. A.: Efficient lookup on unstructured topologies. In: Proc. of the 24th Annual ACM Aymposium on Principles of Distributed Computing, pp. 77–86. Las Vegas, Nevada, USA (2005)

  30. Connelly, B.D., Bowron, C. W., Xiao, L., Tan, P.N., Wang, C.: Adaptively routing P2P queries using association analysis. In: Proceedings of the 35th International Conference on Parallel Processing, pp. 281–288. Columbus, Ohio, USA (2006)

  31. Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: Proceedings of 3rd International Conference on Peer-to-Peer Computing, pp. 102–109. Linköping, Sweden (2003)

  32. Ravindran, K.: Reconfigurable peer-to-peer connectivity overlays for information assurance applications. In: Proceedings of 32th International Conference on Parallel Processing, pp. 1–7. Dresden, Germany (2009)

  33. Maj, A., Jurowicz, J., Kozlak, J., Cetnarowicz, K.: A multi-agent system for dynamic network reconfiguration. Multi-Agent Syst Appl III, LNAI 2691, 511–521 (2003)

    Article  Google Scholar 

  34. Wang, S.Q., Xuan, D., Zhao, W.: Analyzing and enhancing the resilience of structured peer-to-peer systems. J. Parallel Distrib. Comput. 65, 207–219 (2005)

    Article  MATH  Google Scholar 

  35. Kong, J.S., Bridgewater, S.A., Roychowdhury, V.P.: Resilience of structured P2P systems under churn: the reachable component method. Comput. Commun. 31, 2109–2123 (2008)

    Article  Google Scholar 

  36. Qazi, S., Moors, T.: Scalable resilient overlay networks using destination-guided detouring. In: Proceedings of IEEE International Conference on Communications, pp. 428–434. Glasgw, Scotland. (2007)

  37. Kvalbein, A., Hansen, A.F., Cicic, T., Gjessing, S., Lysne, O.: Multiple routing configurations for fast IP network recovery. IEEE Trans. Netw. 17(2), 473–486 (2009)

    Article  Google Scholar 

  38. Acosta, J.R., Avresky, D.R.: Dynamic network reconfiguration in presence of multiple node and link failures using autonomous agents. In: Proceedings of IEEE Conference on Collaborative Computing: Networking, Applications and Worksharing, pp. 10–20. San Jose, CA, USA (2005)

  39. Duato, J., Casado, R., Bermudez, A., Quiles, F.J.: A protocol for deadlock-free dynamic reconfiguration in high-speed local area networks. IEEE Trans. Parallel Distrib. Syst. 12(2), 115–132 (2001)

    Article  Google Scholar 

  40. Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative Byzantine fault tolerance. Commun. ACM 51(11), 86–95 (2008)

    Article  Google Scholar 

  41. Jesi, G.P.: PeerSim HOWTO: Build a new protocol for the PeerSim 1.0 Simulator. Available: http://peersim.sourceforge.net/ (2001)

Download references

Acknowledgments

This work was supported by National Natural Science Foundation of China under grants No. 60873040 and No. 60873070. Jihong Guan was also supported by the Program for New Century Excellent Talents in the University of China Grant No. NCET-06-0376 and the "Shuguang" Scholar Program of Shanghai Education Development Foundation. Ming Xu was also supported by the Science and Technology Program of Shanghai Maritime University Grant No. 20110049.

Author information

Authors and Affiliations

  1. College of Information Engineering, Shanghai Maritime University, 1550 Haigang Ave, 201306, Shanghai, China

    Ming Xu

  2. Shanghai Key Lab of Intelligent Information Processing, and School of Computer Science, Fudan University, 200433, Shanghai, China

    Shuigeng Zhou

  3. Department of Computer Science and Technology, Tongji University, 201804, Shanghai, China

    Jihong Guan

Authors
  1. Ming Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuigeng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jihong Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuigeng Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, M., Zhou, S. & Guan, J. Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents. J Netw Syst Manage 20, 309–352 (2012). https://doi.org/10.1007/s10922-011-9203-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-011-9203-3

keywords

Search

Navigation