2022 International Conference for Advancement in Technology (ICONAT) 2022
DOI: 10.1109/iconat53423.2022.9725862
|View full text |Cite
|
Sign up to set email alerts
|

Traffic Load Balancing in SDN Using Round-Robin and Dijkstra Based Methodology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 6 publications
0
5
0
Order By: Relevance
“…The development of SDN and the complex and ever-changing needs of the real network environment have increased the difficulty of selecting the optimal path. In path selection problems, a single metric parameter cannot be selected as a constraint to make reliable path planning [47]. This will lead to some unnecessary congestion and reduce link utilization.…”
Section: Mitigation Mechanisms Based On the Re-routing Strategymentioning
confidence: 99%
“…The development of SDN and the complex and ever-changing needs of the real network environment have increased the difficulty of selecting the optimal path. In path selection problems, a single metric parameter cannot be selected as a constraint to make reliable path planning [47]. This will lead to some unnecessary congestion and reduce link utilization.…”
Section: Mitigation Mechanisms Based On the Re-routing Strategymentioning
confidence: 99%
“…In a scenario where the servers have similar characteristics, the study shows that the round-robin algorithm has a better performance compared to the IP Hash algorithm. Furthermore, the work by Kumar et al 14 implemented round-robin and random load-balancing strategies in a client-server SDN-based architecture, comparing them with the Dijkstra approach. Their findings indicated better performance of the round-robin algorithm in certain network topology, whereas the Dijkstra algorithm exhibited superior throughput in a fat-tree topology.…”
Section: Related Workmentioning
confidence: 99%
“…This time delay is the power communication delay. The Dijkstra algorithm [30] is used to calculate the shortest route between the control node and the action application node as well as the longest way to collect the node data.…”
Section: Communication Network Model Constructionmentioning
confidence: 99%