Functionality Analysis of General Routing Methods in Distribution Networks

Haddadi, Ali; Parsa, Mahdi

Functionality Analysis of General Routing Methods in Distribution Networks

Document Type : Original Research Article

Authors

Ali Haddadi ¹

Mahdi Parsa ²

¹ Department of Computer Engineering, Islamic Azad University, Tehran South Branch, Tehran, Iran

² Department of Information Technology Management, Islamic Azad University, South Tehran Branch, tehran, Iran

Abstract

In the 20th century, the collection, processing and distribution of information has been transformed by the use of distribution networks and related new approaches, and among other developments, we have seen the launch and development of various global distribution networks, the production and growth of the computer industry, and the launch of satellites. We have been in communication.
With technological advancements, these achievements are converging and the differences between the approaches to collecting, transmitting, storing and processing information are rapidly disappearing, and basically, with the increase in the power of collecting, processing and distributing information, the demand for more complex information processing in The environment of distributed networks increases. In order to communicate between nodes in networks, we need a backbone called routing approaches in distributed networks. These functions are basically composed of a large number of routers, they have the task of transmitting information. Algorithms should be implemented on these routers so that they can choose the best path for information transfer in this global village. In this article, we are going to review and analyze the practical views of routing in distributed networks and related general algorithms.

Keywords

Distribution Networks

Routing Method

Algorithm

Adaptive Approach

non-adaptive method

20.1001.1.27831361.1402.4.3.3.7

[1] Anaya-Arenas AM, Renaud J, Ruiz A. Relief distribution networks: a systematic review. Annals of Operations Research. 2014 Dec;223:53-79.

[2] Baran P. On distributed communications networks. IEEE transactions on Communications Systems. 1964 Mar;12(1):1-9.

[3] Youssef M, Ibrahim M, Abdelatif M, Chen L, Vasilakos AV. Routing metrics of cognitive radio networks: A survey. IEEE communications surveys & tutorials. 2013 Sep 16;16(1):92-109.

[4] Abdollahi M, Eshghi F, Kelarestaghi M, Bag-Mohammadi M. Opportunistic routing metrics: A timely one-stop tutorial survey. Journal of Network and Computer Applications. 2020 Dec 1;171:102802.

[5] Shirmarz A, Ghaffari A. Performance issues and solutions in SDN-based data center: a survey. The Journal of Supercomputing. 2020 Oct;76(10):7545-93.

[6] Moudi M, Othman M. A survey on emerging issues in interconnection networks. International Journal of Internet Technology and Secured Transactions. 2021;11(2):131-59.

[7] Rangaswamy K, Reddy GS. Adaptive Routing Algorithms in Distributed Networks. International Journal of Research. 2014 Sep;1(5):21-9.

[8] Wang F, Jiang D, Qi S. An adaptive routing algorithm for integrated information networks. China Communications. 2019 Jul 19;16(7):195-206.

[9] Singh SK, Das T, Jukan A. A survey on internet multipath routing and provisioning. IEEE Communications Surveys & Tutorials. 2015 Jul 23;17(4):2157-75.

[10] Pereira VM. Intradomain routing optimization based on evolutionary computation (Doctoral dissertation, Universidade do Minho (Portugal)).

[11] Bertsekas D, Gallager R. Data networks. Athena Scientific; 2021 Oct 2.

[12] Zanjireh MM, Larijani H. A survey on centralised and distributed clustering routing algorithms for WSNs. In2015 IEEE 81st Vehicular Technology Conference (VTC Spring) 2015 May 11 (pp. 1-6). IEEE.

[13] Zedan IE, El-Henawy IM, Abdallah MI, Mohamed ER. Comparative Study among Routing Algorithms under Different Circumstances. MEJ. Mansoura Engineering Journal. 2021 Mar 18;34(3):1-5.

[14] Németh G. On a new competitive measure for oblivious routing. International Journal of Advanced Computer Science and Applications. 2014;5(1).

[15] Nikoo M, Ramezani F, Hadzima-Nyarko M, Nyarko EK, Nikoo M. Flood-routing modeling with neural network optimized by social-based algorithm. Natural hazards. 2016 May;82:1-24.

[16] Bonaventura M, Nicosia V, Latora V. Characteristic times of biased random walks on complex networks. Physical Review E. 2014 Jan 9;89(1):012803.

[17] Reddy CK, Vinzamuri B. A survey of partitional and hierarchical clustering algorithms. InData clustering 2018 Sep 3 (pp. 87-110). Chapman and Hall/CRC.

[18] Karthikeyan N, Periyakaruppan K, Karthik S, Srihari K. Flooding Reduced-Destination Sequenced Distance Vector Routing Protocol. International Information Institute (Tokyo). Information. 2014 Aug 1;17(8):3901.