Skip to main content
Fig. 3 | EURASIP Journal on Wireless Communications and Networking

Fig. 3

From: A bat algorithm for SDN network scheduling

Fig. 3

Comparison of results between greedy, dynamic programming, and bat algorithm—bar chart. The optimal solution, greedy solution, and the solution of the discrete bat algorithm can be calculated for each set of data. In Fig. 3, the vertical axis represents the correct rate and the horizontal axis represents the same meaning in Fig. 2. It can be concluded that results for each data obtained by greedy algorithm and dynamic programming algorithm are relatively similar, but they all get lower ratio of idle network than that of bat algorithm. The bat algorithm has achieved better results than greedy algorithm and dynamic programming algorithm for each set of data, and results of bat algorithm achieves higher ratio of idle network occpied by request

Back to article page
\