A comparative analysis and schematic modeling of multicast routing algorithms for latency optimization in multimedia traffic delivery using the dijkstra’s algorithms. – S.I.Ele, B.I.Ele, and A.O.Ofem
The objective of this article is to model a fast and efficient algorithm that can enhance latency in multimedia traffic delivery. The study investigate comparatively; two routing Algorithms used in multicast network – the Link State and Distant Vector Routing Algorithm using Dijkstra’s Algorithm, achieving analytic and complexity (Time and Space) examination of the Algorithm. The analysis was achieved by the rule of thumb. We analyzed the algorithm by counting the nested loops of the program. A simple loop over n items yields F(n) = n. a loop within a loop yields F(n) = n2 . A loop within a loop within a loop yields F(n) = n3. An algorithm with O(n) is of complexity n. O(1) algorithm is of constant Time algorithm, while O(n) is linear, O(n2) is quadratic, and O(log(n) is logarithmic. Our first algorithm we constructed is O(n2), which is a worst case scenario indicating that the program runs slower. Our second implementation yields O(n2 log(n2)) which is much better than our first implementation which yield O(n2). This indicate that our program runs much faster than the first one since log(n) is much smaller than n, so n2 log(n2) is much smaller than n*n = n2 . The result shows that in our second implementation, Latency will improve resulting in faster delivery during multimedia streaming. The case is opposite in our first implementation, which indicate that Latency will lag due to the worst case scenario.