The extended Dijkstra's algorithm considers not only the edge weights but also the node weights for finding shortest paths from a source node to all other nodes in a given graph. To show the advantage of the extended Dijkstra's algorithm, this paper proposes a load-balancing algorithm and a multicast algorithm in Software Defined Networking (SDN) on the basis of the extended Dijkstra's algorithm for a graph derived from the underlying SDN topology. We use Pyretic to implement the proposed algorithms and compare them with related ones under the Abilene network topology with the Mininet emulation tool. As shown by the comparisons, the proposed algorithms outperform basic algorithms.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 firstname.lastname@example.org