Skip to main content
SpringerLink
Log in

A Self-adaptive Algorithm for Topology Matching in Unstructured Peer-to-Peer Networks

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

Abstract

Peer-to-peer networks are overlay networks that are constructed over underlay networks. These networks can be structured or unstructured. In these networks, peers choose their neighbors without considering underlay positions, and therefore, the resultant overlay network may have a large number of mismatched paths. In a mismatched path, a message may meet an underlay position several times, which causes redundant network traffic and end-to-end delay. In some of the topology matching algorithms called the heuristic algorithms, each peer uses a local search operator for gathering information about the neighbors of that peer located in its neighborhood radius. In these algorithms, each peer also uses a local operator for changing the connections among the peers. These matching algorithms suffer from two problems; neither the neighborhood radius nor the local operator can adapt themselves to the dynamicity of the network. In this paper, a topology matching algorithm that uses learning automata to adapt the neighborhood radius and an adaptation mechanism inspired from the Schelling segregation model to manage the execution of the local operator is proposed. To evaluate the proposed algorithm, computer simulations were conducted and then the results were compared with the results obtained for other existing algorithms. Simulation results have shown that the proposed algorithm outperforms the existing algorithms with respect to end-to-end delay and number of mismatched paths.

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

Similar content being viewed by others

Notes

  1. Global Positioning System.

References

  1. Kwok, Y.K.: Peer-to-Peer Computing: Applications, Architecture, Protocols, and Challenges. CRC Press, Boca Raton (2011)

    Book  Google Scholar 

  2. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 407–418. ACM, Karlsruhe (2003)

  3. Clarke, I., Sandberg, O., Wiley, B., Hong, T.: Freenet: a distributed anonymous information storage and retrieval system. In: Designing Privacy Enhancing Technologies, pp. 46–66. Springer, Berkeley (2001)

  4. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput. Commun. Rev 31, 149–160 (2001)

    Article  Google Scholar 

  5. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. ACM SIGCOMM Comput. Commun. Rev 31, 161–172 (2001)

    Article  MATH  Google Scholar 

  6. Qiu, T., Chan, E., Ye, M., Chen, G., Zhao, B.Y.: Peer-exchange schemes to handle mismatch in peer-to-peer systems. J. Supercomput 48, 15–42 (2009)

    Article  Google Scholar 

  7. Liu, Y.: A two-hop solution to solving topology mismatch. IEEE Trans. Parallel Distrib. Syst. 19, 1591–1600 (2008)

    Article  Google Scholar 

  8. Liu, Y., Zhuang, Z., Xiao, L., Ni, L.M.: A distributed approach to solving overlay mismatching problem. In: Proceedings of the 24th International Conference on Distributed Computing Systems, pp. 132–139. IEEE Computer Society, Tokyo (2004)

  9. Hsiao, H.C., Liao, H., Yeh, P.S.: A near-optimal algorithm attacking the topology mismatch problem in unstructured peer-to-peer networks. IEEE Trans. Parallel Distrib. Syst. 21, 983–997 (2010)

    Article  Google Scholar 

  10. Singh, A., Haahr, M.: Decentralized clustering in pure p2p overlay networks using Schelling’s model. In: IEEE International Conference on Communications, pp. 1860–1866. IEEE Computer Society, Glasgow (2007)

  11. Rostami, H., Habibi, J.: Topology awareness of overlay P2P networks. Concurr. Comput. Pract. Exp 19, 999–1021 (2007)

    Article  Google Scholar 

  12. Leitão, J., Marques, J.P., Pereira, J., Rodrigues, L.: X-bot: a protocol for resilient optimization of unstructured overlay networks. IEEE Trans. Parallel Distrib. Syst. 23, 2175–2188 (2012)

    Article  Google Scholar 

  13. Ren, S., Guo, L., Jiang, S., Zhang, X.: SAT-Match: a self-adaptive topology matching method to achieve low lookup latency in structured p2p overlay networks. In: Parallel and Distributed Processing Symposium, pp. 83–94. IEEE Computer Society, Santa Fe (2004)

  14. Qiu, T., Wu, F., Chen, G.: A generic approach to make structured peer-to-peer systems topology-aware. In: Third International Symposium on Parallel and Distributed Processing and Applications, pp. 816–826. Springer, Nanjing (2005)

  15. Qiu, T., Chen, G., Ye, M., Chan, E., Zhao, B.Y.: Towards location-aware topology in both unstructured and structured P2P systems. In: International Conference on Parallel Processing, pp. 30–30. IEEE Computer Society, Xian (2007)

  16. Liu, Y., Zhuang, Z., Xiao, L., Ni, L.M.: AOTO: Adaptive overlay topology optimization in unstructured P2P systems. In: Global Telecommunications Conference, pp. 4186–4190. IEEE Computer Society, San Francisco (2003)

  17. Leitao, J., Marques, J.P., Pereira, J., Rodrigues, L.: X-bot: a protocol for resilient optimization of unstructured overlays. In: Proceedings of the 28th IEEE International Symposium on Reliable Distributed Systems, pp. 236–245. IEEE Computer Society, Niagara Falls (2009)

  18. Dumitrescu, M., Andonie, R.: Clustering superpeers in p2p networks by growing neural gas. In: Proceedings of the 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, pp. 311–318. IEEE Computer Society, Munich (2012)

  19. Babaoglu, O., Meling, H., Montresor, A.: Anthill: a framework for the development of agent-based peer-to-peer systems. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, pp. 15–22. IEEE Computer Society, Vienna (2002)

  20. Forestiero, A., Leonardi, E., Mastroianni, C., Meo, M.: Self-Chord: a bio-inspired p2p framework for self-organizing distributed systems. IEEE Trans. Netw 18, 1651–1664 (2010)

    Article  Google Scholar 

  21. Domic, N.G., Goles, E., Rica, S.: Dynamics and complexity of the schelling segregation model. Phys. Rev. E 83, 96–111 (2011)

    Article  Google Scholar 

  22. Thathachar, M., Sastry, P.S.: Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, Dordrecht (2004)

    Book  Google Scholar 

  23. Lalitha, B., Rao, C.D.S.: GPS based topology matching algorithm for p2p systems. Int. J. Adv. Res. Comput. Sci. Softw. Eng 3, 1–10 (2013)

    Google Scholar 

  24. Lalitha, B., Subba Rao, C.H.D.: Mitigation of topology mismatch problem based on node network positioning in unstructured p2p networks. i-manager’s J. Comput. Sci 1, 22–32 (2013)

    Google Scholar 

  25. Aggarwal, V., Feldmann, A., Scheideler, C.: Can ISPs and p2p users cooperate for improved performance? ACM SIGCOMM Comput. Commun. Rev 37, 29–40 (2007)

    Article  Google Scholar 

  26. Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1190–1199. IEEE Computer Society, New York (2002)

  27. Tian, R., Xiong, Y., Zhang, Q., Li, B., Zhao, B.Y., Li, X.: Hybrid overlay structure based on random walks. In: Peer-to-Peer Systems IV, pp. 152–162. Springer (2005)

  28. Zhang, X.Y., Zhang, Q., Zhang, Z., Song, G., Zhu, W.: A construction of locality-aware overlay network: mOverlay and its performance. IEEE J. Sel. Areas Commun 22, 18–28 (2004)

    Article  Google Scholar 

  29. Scheidegger, M., Braun, T.: Improved locality-aware grouping in overlay networks. In: Kommunikation in Verteilten Systemen, pp. 27–38. Springer, Bern (2007)

  30. Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Proceedings of the 4th International Conference on Hybrid Metaheuristics, pp. 1–15. Springer, Berlin, Heidelberg (2007)

  31. Ju, H.-J., Du, L.-J.: Nodes clustering method in large-scale network. In: Proceedings of the 8th International Conference on Wireless Communications, Networking and Mobile Computing, pp. 1–4. IEEE Computer Society, Shanghai (2012)

  32. Li, Y., Yu, Z.: An improved genetic algorithm for network nodes clustering. In: Proceedings of the Second International Conference on Information Computing and Applications, pp. 399–406. Springer Berlin Heidelberg, Qinhuangdao (2011)

  33. Jiang, Y., You, J., He, X.: A particle swarm based network hosts clustering algorithm for peer-to-peer networks. In: International Conference on Computational Intelligence and Security, pp. 1176–1179. IEEE Computer Society, Guangzhou (2006)

  34. Rostami, H., Habibi, J.: A mathematical foundation for topology awareness of p2p overlay networks. In: Grid and Cooperative Computing, pp. 906–918. Springer, Heidelberg (2005)

  35. Liu, Y., Xiao, L., Liu, X., Ni, L.M., Zhang, X.: Location awareness in unstructured peer-to-peer systems. IEEE Trans. Parallel Distrib. Syst. 16, 163–174 (2005)

    Article  Google Scholar 

  36. Hsiao, H.C., Liao, H., Huang, C.C.: Resolving the topology mismatch problem in unstructured peer-to-peer networks. IEEE Trans. Parallel Distrib. Syst. 20, 1668–1681 (2009)

    Article  Google Scholar 

  37. Papadakis, H., Fragopoulou, P., Markatos, E., Roussopoulos, M.: ITA: innocuous topology awareness for unstructured p2p networks. IEEE Trans. Parallel Distrib. Syst. 24, 1589–1601 (2013)

    Article  Google Scholar 

  38. Xiao, L., Liu, Y., Ni, L.M.: Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Trans. Comput. 54, 1091–1103 (2005)

    Article  Google Scholar 

  39. Yunhao, L., Xiao, L., Ni, L.M.: Building a scalable bipartite P2P overlay network. IEEE Trans. Parallel Distrib. Syst. 18, 1296–1306 (2007)

    Article  Google Scholar 

  40. Saghiri, A.M., Meybodi, M.R.: A distributed adaptive landmark clustering algorithm based on mOverlay and learning automata for topology mismatch problem in unstructured peer-to-peer networks. Int. J. Commun Syst (2015). doi:10.1002/dac.2977

    Google Scholar 

  41. Baumgart, I., Heep, B., Krause, S.: OverSim: A scalable and flexible overlay framework for simulation and real network applications. In: Peer-to-Peer Computing. pp, 87–88. IEEE Computer Society, Seattle, Washington (2009)

  42. Baumgart, I., Heep, B., Krause, S.: OverSim: A flexible overlay network simulation framework. In: IEEE Global Internet Symposium, pp. 79–84. IEEE Computer Society, Anchorage (2007)

  43. Baumgart, I., Gamer, T., Hübsch, C., Mayer, C.P.: Realistic underlays for overlay simulation. In: Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques, pp. 402–405. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), Brussels (2011)

  44. Li, L., Alderson, D., Willinger, W., Doyle, J.: A first-principles approach to understanding the internet’s router-level topology. ACM SIGCOMM Comput. Commun. Rev 34, 3–14 (2004)

    Article  Google Scholar 

  45. Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. In: First International Conference on Peer-to-Peer Computing, pp. 99–100. IEEE Computer Society, Linkoping (2001)

  46. Liu, Y., Xiao, L., Esfahanian, A.H., Ni, L.M.: Approaching optimal peer-to-peer overlays. In: Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, pp. 407–414. IEEE Computer Society, Atlanta (2005)

  47. SNAP: Network datasets: Gnutella peer-to-peer network, http://snap.stanford.edu/data/p2p-Gnutella04.html

  48. Mahadevan, P., Krioukov, D., Fomenkov, M., Huffaker, B., Dimitropoulos, X., Vahdat, A.: Lessons from Three Views of the Internet Topology. University of California, San Diego (2005)

    Google Scholar 

  49. Huffaker, B., Plummer, D., Moore, D., Claffy, K.C.: Topology discovery by active probing. In: Proceedings of Symposium on Applications and the Internet Workshops, pp. 90–96., Washington (2002)

  50. Narendra, K.S., Thathachar, M.A.L.: Learning Automata: An Introduction. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave., Tehran, Iran

    Ali Mohammad Saghiri & Mohammad Reza Meybodi

Authors
  1. Ali Mohammad Saghiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Reza Meybodi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Reza Meybodi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Saghiri, A.M., Meybodi, M.R. A Self-adaptive Algorithm for Topology Matching in Unstructured Peer-to-Peer Networks. J Netw Syst Manage 24, 393–426 (2016). https://doi.org/10.1007/s10922-015-9353-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-015-9353-9

Keywords

Search

Navigation