Skip to main content
SpringerLink
Log in

Resource discovery in the peer to peer networks using an inverted ant colony optimization algorithm

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

In recent years, the attractiveness of Peer-to-Peer (P2P) networks has been grown rapidly due to the easiness of use. The P2P system is a decentralized relationship model in which every party has the analogous abilities and either party can start a relationship session. In these networks, due to the high number of users, the resource discovery process becomes one of the important parts of the P2P networks. But, in many previously proposed methods, there is a common problem that is called load balancing. If the balance of workload is inefficient, it reduces the resource utilization. Therefore, in this article, we propose the Inverted Ant Colony Optimization (IACO) algorithm, a variety of the basic Ant Colony Optimization (ACO) algorithm, to improve load balancing among the peers. In the proposed method, the effect of pheromone on the selected paths by ants is inverted. In this approach, ants start to traverse the graph from the requester peer and each ant chooses the best peer for moving. Then, requirements and pheromone amount are updated. Finally, we simulate the method and evaluate its performance in comparison to the ACO algorithm in different terms. The obtained results show that the performance of the IACO is better than the ACO algorithm in terms of load balancing, waiting time and resource utilization.

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

Similar content being viewed by others

Notes

  1. www.napster.com

  2. www.Gnutellaforums.com

  3. The nosey peers are peers which have the most links to others.

References

  1. Asghari S, Navimipour NJ (2016) Service composition mechanisms in the multi-cloud environments: a survey. Int J New Comput Archit Appl (IJNCAA) 6:40–48

    Google Scholar 

  2. Asghari S, Navimipour NJ (2016) Review and comparison of meta-heuristic algorithms for service composition in cloud computing. Majlesi J Multimed Process 4

  3. Ashouraie M, Jafari Navimipour N (2015) Priority-based task scheduling on heterogeneous resources in the expert cloud. Kybernetes 44:1455–1471

    Article  Google Scholar 

  4. Navimipour NJ, Rahmani AM, Navin AH, Hosseinzadeh M (2015) Expert cloud: a cloud-based framework to share the knowledge and skills of human resources. Comput Hum Behav 46:57–74

    Article  Google Scholar 

  5. Afrooz S, Navimipour NJ (2017) Memory designing using quantum-dot cellular automata: systematic literature review, classification and current trends. J Circ Syst Comput 26:1730004

    Article  Google Scholar 

  6. Krynicki K, Jaen J, Mocholi JA (2013) On the performance of ACO-based methods in p2p resource discovery. Appl Soft Comput 13(12):4813–4831

    Article  Google Scholar 

  7. Mirtaheri SL, Sharifi M (2014) An efficient resource discovery framework for pure unstructured peer-to-peer systems. Comput Netw 59:213–226

    Article  Google Scholar 

  8. Navimipour NJ, Milani FS (2015) A comprehensive study of the resource discovery techniques in peer-to-peer networks. P2P Netw Appl 8:474–492

    Google Scholar 

  9. Akbari Torkestani J (2012) A distributed resource discovery algorithm for P2P grids. J Netw Comput Appl 35(11):2028–2036

    Article  Google Scholar 

  10. Han X, Cuevas Á, Crespi N, Cuevas R, Huang X (2014) On exploiting social relationship and personal background for content discovery in P2P networks. Futur Gener Comput Syst 40(11):17–29

    Article  Google Scholar 

  11. Deng Y, Wang F, Ciura A (2009) Ant colony optimization inspired resource discovery in P2P grid systems. J Supercomput 49:4–21

    Article  Google Scholar 

  12. Wang L (2011) SoFA: an expert-driven, self-organization peer-to-peer semantic communities for network resource management. Expert Syst Appl 38(1):94–105

    Article  Google Scholar 

  13. Beydoun G, Low G, Tran N, Bogg P (2011) Development of a peer-to-peer information sharing system using ontologies. Expert Syst Appl 38(8):9352–9364

    Article  Google Scholar 

  14. Navimipour NJ, Rahmani AM, Navin AH, Hosseinzadeh M (2014) Resource discovery mechanisms in grid systems: a survey. J Netw Comput Appl 41:389–410

    Article  Google Scholar 

  15. Navimipour NJ, Asghari S (2017) Energy-aware service composition mechanism in grid computing using an ant colony optimization algorithm. 대한전자공학회 학술대회, pp 282–286

  16. Aznoli F, Navimipour NJ (2016) Cloud services recommendation: reviewing the recent advances and suggesting the future research directions. J Netw Comput Appl 77:73–86

    Article  Google Scholar 

  17. Navimipour NJ (2015) A formal approach for the specification and verification of a trustworthy human resource discovery mechanism in the expert cloud. Expert Syst Appl 42:6112–6131

    Article  Google Scholar 

  18. Keshanchi B, Navimipour NJ (2016) Priority-based task scheduling in the cloud systems using a memetic algorithm. J Circ Syst Comput 25:1650119

    Article  Google Scholar 

  19. Vakili A, Navimipour NJ (2017) Comprehensive and systematic review of the service composition mechanisms in the cloud environments. J Netw Comput Appl 81:24–36

    Article  Google Scholar 

  20. Azad P, Navimipour JN (2017) An energy-aware task scheduling in cloud computing using a hybrid cultural and ant colony optimization algorithm. Int J Cloud Appl Comput 7:20–40

    Google Scholar 

  21. Milani BA, Navimipour NJ (2017) A systematic literature review of the data replication techniques in the cloud environments. Big Data Res 10:1–7. https://doi.org/10.1016/j.bdr.2017.06.003.

    Article  Google Scholar 

  22. Sharif SH, Mahmazi S, Navimipour NJ, Aghdam BF (2013) A review on search and discovery mechanisms in social networks. Int J Inf Eng Electron Bus 5:64–73

    Google Scholar 

  23. Asghari S, Azadi K (2017) A reliable path between target users and clients in social networks using an inverted ant colony optimization algorithm. Karbala Int J Mod Sci 3(3):143–152. https://doi.org/10.1016/j.kijoms.2017.05.004.

    Article  Google Scholar 

  24. Bakratsas M, Basaras P, Katsaros D, Tassiulas L (2017) Hadoop mapreduce performance on SSDs for analyzing social networks. Big Data Res. https://doi.org/10.1016/j.bdr.2017.06.001

  25. Merz P, Gorunova K (2007) Fault-tolerant resource discovery in peer-to-peer grids. J Grid Comput 5:319–335

    Article  Google Scholar 

  26. A. Arunachalam and O. Sornil (2015) "Issues of Implementing Random Walk and Gossip Based Resource Discovery Protocols in P2P MANETs & Suggestions for Improvement," Procedia Comput Sci, 57:509–518

  27. Meshkova E, Riihijärvi J, Petrova M, Mähönen P (2008) A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Comput Netw 52:2097–2128

    Article  Google Scholar 

  28. Trunfio P, Talia D, Papadakis H, Fragopoulou P, Mordacchini M, Pennanen M, Popov K, Vlassov V, Haridi S (2007) Peer-to-peer resource discovery in grids: models and systems. Futur Gener Comput Syst 23:864–878

    Article  Google Scholar 

  29. Gaeta R, Sereno M (2011) Generalized probabilistic flooding in unstructured peer-to-peer networks. IEEE Trans Parallel Distrib Syst 22:2055–2062

    Article  Google Scholar 

  30. Lua EK, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun Surv Tutorials 7:72–93

    Article  Google Scholar 

  31. Kirk P (2003) Gnutella protocol development. Retrieved June, vol. 27, pp 2011

  32. Ghamri-Doudane S, Agoulmine N (2007) Enhanced DHT-based P2P architecture for effective resource discovery and management. J Netw Syst Manag 15:335–354

    Article  Google Scholar 

  33. Maymounkov P, Mazieres D (2002) Kademlia: a peer-to-peer information system based on the xor metric. In: Peer-to-peer systems Springer, pp 53–65

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

    Article  Google Scholar 

  35. Yang B, Garcia-Molina H (2003) Designing a super-peer network. In: Data engineering, 2003. Proceedings. 19th international conference on, pp 49–60

  36. Tan Y-H, Lü K, Lin Y-P (2012) Organisation and management of shared documents in super-peer networks based semantic hierarchical cluster trees. P2P Netw Appl 5:292–308

    Google Scholar 

  37. Stokes M (2002) Gnutella2 specifications part one. Rapport technique

  38. Stokes M (2003) Gnutella2 specification document–first draft. Gnutella2 website http://www.gnutella2.com/gnutella2_draft. htm

  39. Haasn MI (2011) Semantic technology and super-peer architecture for internet based distributed system resource discovery. Int J New Comput Archit Appl (IJNCAA) 1:848–865

    Google Scholar 

  40. Ali HA, Ahmed MA (2012) HPRDG: a scalable framework hypercube-P2P-based for resource discovery in computational grid. In: Computer Theory and Applications (ICCTA), 2012 22nd International Conference on, pp 2–8

  41. Yang M, Yang Y (2010) An efficient hybrid peer-to-peer system for distributed data sharing. IEEE Trans Comput 59:1158–1171

    Article  MathSciNet  Google Scholar 

  42. Liu M, Harjula E, Ylianttila M (2013) An efficient selection algorithm for building a super-peer overlay. J Internet Serv Applic 4:1–12

    Article  Google Scholar 

  43. Loo BT, Huebsch R, Stoica I, Hellerstein JM (2004) The case for a hybrid P2P search infrastructure. In: Peer-to-peer systems III. Springer, pp 141–150

  44. Papadakis H, Trunfio P, Talia D, Fragopoulou P (2008) Design and implementation of a hybrid P2P-based grid resource discovery system. In: Making grids work. Springer, pp 89–101

  45. Napster L (2001) Napster. URL: http://www.napster.com

  46. Jin X, Chan S-HG (2010) Unstructured peer-to-peer network architectures. In: Handbook of peer-to-peer networking. Springer, pp 117–142

  47. Mashayekhi H, Habibi J (2010) Combining search and trust models in unstructured peer-to-peer networks. J Supercomput 53:66–85

    Article  Google Scholar 

  48. Zaharia M, Keshav S (2008) Gossip-based search selection in hybrid peer-to-peer networks. Concurr Comput Pract Exper 20:139–153

    Article  Google Scholar 

  49. Barjini H, Othman M, Ibrahim H (2010) An efficient hybridflood searching algorithm for unstructured peer-to-peer networks. Inf Comput Appl:173–180

  50. Kumar A, Xu J, Zegura EW (2005) Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, pp 1162–1173

  51. Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making gnutella-like p2p systems scalable. In: proceedings of the 2003 conference on applications, technologies, architectures, and protocols for. Comput Commun:407–418

  52. Dorigo M, Maniezzo V, Colorni A (1991) The ant system: an autocatalytic optimizing process

  53. Jaén J, Mocholí JA, Catalá A, Navarro E (2011) Digital ants as the best cicerones for museum visitors. Appl Soft Comput 11:111–119

    Article  Google Scholar 

  54. Mocholi JA, Martinez V, Jaen J, Catala A (2012) A multicriteria ant colony algorithm for generating music playlists. Expert Syst Appl 39:2270–2278

    Article  Google Scholar 

  55. Krauter K, Buyya R, Maheswaran M (2002) A taxonomy and survey of grid resource management systems for distributed computing. Softw Pract Exper 32:135–164

    Article  Google Scholar 

  56. Souri A, Navimipour NJ (2014) Behavioral modeling and formal verification of a resource discovery approach in grid computing. Expert Syst Appl 41:3831–3849

    Article  Google Scholar 

  57. Asghari S, Navimipour J (2017) Cloud services composition using an inverted ant colony optimization algorithm. Int. J. Bio-Inspired Comput in press. Google Scholar

  58. Dias JC, Machado P, Silva DC, Abreu PH (2014) An inverted ant colony optimization approach to traffic. Eng Appl Artif Intell 36:122–133

    Article  Google Scholar 

  59. Yu Q, Chen L, Li B (2015) Ant colony optimization applied to web service compositions in cloud computing. Comput Electr Eng 41:18–27

    Article  Google Scholar 

  60. Wang D, Yang Y, Mi Z (2015) A genetic-based approach to web service composition in geo-distributed cloud environment. Comput Electr Eng 43:129–141

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Young Researchers and Elite Club, Tabriz Branch, Islamic Azad University, Tabriz, Iran

    Saied Asghari & Nima Jafari Navimipour

Authors
  1. Saied Asghari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nima Jafari Navimipour
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nima Jafari Navimipour.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Asghari, S., Navimipour, N.J. Resource discovery in the peer to peer networks using an inverted ant colony optimization algorithm. Peer-to-Peer Netw. Appl. 12, 129–142 (2019). https://doi.org/10.1007/s12083-018-0644-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-018-0644-2

Keywords

Search

Navigation