An Effective Routing Algorithm for Load balancing in Unstructured Peer-to-Peer Networks

Authors

  • Anil V. Turukmane Professor, School of Computer Science & Engineering, VIT- AP University, Amaravati, Vijaywada, AP, India
  • Naresh Tangudu Associate Professor, Department of IT, Aditya Institute of Technology and Management, Tekkali-532201, A.P, India
  • B. Sreedhar Assistant professor, Department of CSE Srinivasa Ramanujan Institute of Technology, Anantapur, AP, India
  • D. Ganesh Associate Professor, Department of CSE, School of Computing, Mohan Babu University (erstwhile Sree Vidyanikethan Engineering College), Tirupati, AP, India.
  • P. S. Sagarika Reddy UG Scholar, Department of CSE, Sree Vidyanikethan Engineering College, Tirupathi, AP, India.
  • Umamaheswararao Batta Department of CSE, KoneruLakshmaiah Education Foundation, Vaddeswaram, AP, India.

Keywords:

Unorganized P2P networks, load distribution, routing, congestion management

Abstract

Both Academics and industry experts in computer networking are showing a growing interest in peer-to-peer (P2P) networking. In recent years, researchers have attempted to use decentralized peer-to-peer networks to deliver Live Streaming (LS) & Video-on-Demand (VoD). Most of these studies have centered on the properties of the overlaying graph (P2P overlay) that connects the set of interested peers and on the creation of distributed P2P blocks scheduling algorithms for content transfer among the participating peers. Both excessive network traffic and unpredictable delay are significant issues for unstructured p2p systems. Flooding and dynamic query, two of the most used search methods in decentralized p2p networks, are ineffective in dealing with these issues because they lack a heuristic. Existing congestion control designs are not well suited for P2P live streaming traffic, and there has been a paucity of study on the network congestion of these systems. In this work we are proposing an efficient load balancing scheme called Routing Algorithm for Covering Dynamic Time to avoid congestion control for transmitting large amount of data in unstructured Peer-to-peer networks. We are evaluating the proposed efficient Load Balancing mechanismin terms of load distribution rate with virtual servers & performance rate and proved that our proposed scheme works efficiently when compared to existing load balancing schemes.

Downloads

Download data is not yet available.

References

S. Rantnasamy,P. Francis,M. Handley,R. Karp and S.Shenker. A Scalable Content-Addressable Network. In ACMSIGCOMM,2016.

I.Stoica,R.Morris, D.Karger, M.F.Kaashoek and H.Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup ServiceforInternetApplications.InACMSIGCOMM,2016.

A.RowstronandP.Druschel. Pastry:Scalable,Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In proceedings of the 2nd IFIP/ACM International Middleware Conference, 2017.

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph and J. Kubiatowicz. Tapestry: An Infrastructure for Fault Tol- erant Wide-area Location and Routing. IEEE Journal on Selected Areas in Communications, 12(1):41-53, 2014.

F. Kaashoek and D. Karger. Koorde: A simple degree-optimal distributed hash table. In proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2018.

H. Shen, C. Xu, and G. Chen. Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network. In proceedings of the 18th IEEE International Parallel and Distributed Pro- cessing Symposium (IPDPS), 2018.

S. Saroiu, P. K. Gummadi and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In proceedings of 9th Multimedia Computing and Networking (MMCN), 2018.

Saurabh Tewari, Performance Study of Peer-to-Peer File Sharing, Ph.D Thesis, University of California, Los Angeles, 2017.

Kim and L. Hoffman, “Napster and other Internet peer-to-peer applications,” George Washington University, available: citeseer.ist.psu.edu/kim01pricing.html,2015.

Stoica, Morris, R. Karger, D. Kaashoek, M and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” Proc. of SIGCOMM 2017.

Rowston and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” Proc. of IFIP / ACM Middleware, Heidelberg, Germany, 2011.

S. Ratnasamy, P. Francis, M. Handley and R .Karp, “A scalable content-addressable network,” In Proc. Of SIGCOMM, 2011.

Ganesh, Davanam, Thummala Pavan Kumar, and Malchi Sunil Kumar. "Optimised Levenshtein centroid cross‐layer defence for multi‐hop cognitive radio networks." IET Communications 15.2 (2021): 245-256.

Davanam, Ganesh, T. Pavan Kumar, and M. Sunil Kumar. "Novel Defense Framework for Cross-layer Attacks in Cognitive Radio Networks." International Conference on Intelligent and Smart Computing in Data Analytics: ISCDA 2020. Springer Singapore, 2021.

Davanam, Ganesh, T. Pavan Kumar, and M. Sunil Kumar. "Efficient energy management for reducing cross layer attacks in cognitive radio networks." Journal of Green Engineering 11 (2021): 1412-1426.

Davanam, Ganesh, et al. "Multi-Controller Model for Improving the Performance of IoT Networks." Energies 15.22 (2022): 8738.

Stephanos Androutsellis-Theotokis, “White Paper-A Survey of Peer-to-Peer File Sharing Technologies,”

Ganesh, Davanam, T. Pavan Kumar, and M. Sunil Kumar. "A Dynamic and adaptive learning mechanism to reduce cross layer attacks in cogntive networks." Materials Today: Proceedings (2020).

Kumar, M. Sunil, and D. Harshitha. "Process innovation methods on business process reengineering." Int. J. Innov. Technol. Explor. Eng (2019).

Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-to-peer networks,” in Proc. 16th ACM Conf. Super- comput., 2017, pp. 84–95.

Balaji, K., P. Sai Kiran, and M. Sunil Kumar. "Resource aware virtual machine placement in IaaS cloud using bio-inspired firefly algorithm." Journal of Green Engineering 10 (2020): 9315-9327.

A. D. Sarma, A. R. Molla, and G. Pandurangan, “Efficient random walk sampling in distributed networks,” J. Parallel Distrib. Comput., vol. 77, pp. 84–94, 2018.

D. Tsoumakos and N. Roussopoulos, “Adaptive probabilistic search for peer-to-peer networkss,” in Proc. 3rd Int. Conf. Peer-to-Peer Comput., 2013, pp. 102–109.

R. L. Pereira, T.Vaza¨o, and R. Rodrigues, “Adaptive search radius— Using hop count to reduce P2P traffic,” Comput. Netw., vol. 56, no. 2, pp. 642–660, 2017.

A. Kurve, C. Griffin, D. J. Miller, and G. Kesidis, “Optimizing cluster formation in super-peer networks via local incentive design,” Peer-to-Peer Netw. Appl., vol. 8, no. 1, pp. 1–21, 2015.

J.-S. Li and C.-H. Chao, “An efficient super-peer overlay construction and broadcasting scheme based on perfect difference graph,” IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 5, pp. 594–606, May 2018.

G. J. Fakasa and B. Karakostas, “An efficient super-peer overlay construc- tion and broadcasting scheme based on perfect difference graph,” Inform. Softw. Technol., vol. 46, no. 6, pp. 423–431, 2014.

Z. Xu and L. N. Bhuyan, “Effective load balancing in P2P systems,” in Proc. IEEE Int. Symp. Cluster Comput. Grid, 2006, pp. 81–88.

G. Sreenu, P. M. Dhanya, and S. M. Thampi, “Enhancement of BATER- CAST using reinforcement learning to effectively manage free riders,” in Advances in Computing and Communications. New York, NY, USA: Springer, 2011, pp. 126–136.

L. R. Merino, A. F. Anta, L. Lo´pze, and V. Cholvi, “Self-managed topolo- gies in P2P networks,” Comput. Netw., vol. 53, no. 10, pp. 1722–1736, 2009

E. Pournaras, G. Exarchakos, and N. Antonopoulos, “Load-driven neighbourhood reconfiguration of Gnutella overlay,” Comput. Commun., vol. 31, no. 13, pp. 3030–3039, 2018

R. Morales and I. Gupta, “Avmon: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems,” IEEE Trans. Parallel Distrib. Syst., vol. 20, no. 4, pp. 446–459, Apr. 2019.

Burada, S., Swamy, B. E., & Kumar, M. S. (2022). Computer-Aided Diagnosis Mechanism for Melanoma Skin Cancer Detection Using Radial Basis Function Network. In Proceedings of the International Conference on Cognitive and Intelligent Computing (pp. 619-628). Springer, Singapore.

Prasad, T. G., Turukmane, A. V., Kumar, M. S., Madhavi, N. B., Sushama, C., & Neelima, P. (2022). Cnn Based Pathway Control To Prevent Covid Spread Using Face Mask And Body Temperature Detection. Journal of Pharmaceutical Negative Results, 1374-1381.

AnanthaNatarajan, V., M. Sunil Kumar, and V. Tamizhazhagan. "Forecasting of Wind Power using LSTM Recurrent Neural Network." Journal of Green Engineering 10 (2020).

H. Mashayekhi and J. Habibi, “Combining search and trust models in unstructured peer-to-peer networks,” J. Supercomput., vol. 53, no. 1, pp. 65–85, 2018.

J. A. Torkestani, “A distributed resource discovery algorithm for P2P grids,” J. Netw. Comput. Appl., vol. 35, no. 6, pp. 2028–2036, 2017.

S. Merugu, S. Srinivasan, and E. Zegura, “Adding structure to unstructured peer-to-peer networks: The use of small-world graphs,” J. Parallel Distrib. Comput., vol. 65, no. 2, pp. 142–153, 2015.

K. Wu, C. Wu, and L. Liu, “State-based search strategy in unstructured P2P,” in Proc. IEEE 13th Int. Symp. Object/Component/Service-Oriented Real-Time Distrib. Comput., 2017, pp. 381–386.

Natarajan, V. A., Kumar, M. S., Tamizhazhagan, V., & Chevdumoi, R. M. (2022). PREDICTION OF SOIL PH FROM REMOTE SENSING DATA USING GRADIENT BOOSTED REGRESSION ANALYSIS. Journal of Pharmaceutical Negative Results, 29-36.

Sunil Kumar, M., & Rama Mohan Reddy, A. (2016). An Efficient Approach for Evolution of Functional Requirements to Improve the Quality of Software Architecture. In Artificial Intelligence and Evolutionary Computations in Engineering Systems (pp. 775-792). Springer, New Delhi.

Park, G. et al. (2021). Adaptive Load Balancing Mechanism for Server Cluster. In: , et al. Computational Science and Its Applications - ICCSA 2021. Lecture Notes in Computer Science, vol 3983. Springer, Berlin, Heidelberg

H. Nurwasito and R. Rahmawati, "Weighted Response Time Algorithm for Web Server Load Balancing in Software Defined Networks," 2021 3rd International Conference on Electronics Representation and Algorithm (ICERA), Yogyakarta, Indonesia, 2021, pp. 143-148, doi: 10.1109/ICERA53111.2021.9538792.

Downloads

Published

05.12.2023

How to Cite

Turukmane, A. V. ., Tangudu, N. ., Sreedhar, B. ., Ganesh, D. ., Reddy, P. S. S. ., & Batta, U. . (2023). An Effective Routing Algorithm for Load balancing in Unstructured Peer-to-Peer Networks. International Journal of Intelligent Systems and Applications in Engineering, 12(7s), 87–97. Retrieved from https://ijisae.org/index.php/IJISAE/article/view/4037

Issue

Vol. 12 No. 7s (2024)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.

IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.