{"title":"Analysis and simulations of routing protocols with two different algorithms","authors":"Sutep Sowsanit, S. Pattanavichai","doi":"10.1109/ICTKE.2014.7001536","DOIUrl":null,"url":null,"abstract":"The objective of this study is to evaluate efficiency of routing protocols between Dijkistra's and Kruskal's algorithm. The application of routing protocols is presented. It is used to compute complicated routing paths and the efficiency of routing algorithms. Extensive simulations are being carried out with two different algorithms. The network loads in the performance plots are characterized by two important parameters (a number of vertices) - 9 nodes and 10 nodes. The simulation results showed that the performance of Dijkistra's algorithm is better than Kruskal's algorithm when the network loads are increased from 9 nodes to 10 nodes. In this simulation, Dijkstra's algorithm provides the shortest path among the nodes.","PeriodicalId":120743,"journal":{"name":"2014 Twelfth International Conference on ICT and Knowledge Engineering","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Twelfth International Conference on ICT and Knowledge Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTKE.2014.7001536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The objective of this study is to evaluate efficiency of routing protocols between Dijkistra's and Kruskal's algorithm. The application of routing protocols is presented. It is used to compute complicated routing paths and the efficiency of routing algorithms. Extensive simulations are being carried out with two different algorithms. The network loads in the performance plots are characterized by two important parameters (a number of vertices) - 9 nodes and 10 nodes. The simulation results showed that the performance of Dijkistra's algorithm is better than Kruskal's algorithm when the network loads are increased from 9 nodes to 10 nodes. In this simulation, Dijkstra's algorithm provides the shortest path among the nodes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
