Comparative analysis of traditional load balancing algorithms in software-defined networks

dc.contributor.author	Umasuthan, G.
dc.contributor.author	Khedika, S.
dc.contributor.author	Ramanan, M.
dc.date.accessioned	2022-03-24T05:23:23Z
dc.date.available	2022-03-24T05:23:23Z
dc.date.issued	2022-01-19
dc.identifier.issn	1391-8796
dc.identifier.uri	http://ir.lib.ruh.ac.lk/xmlui/handle/iruor/5593
dc.description.abstract	Load Balancing is one of the efficiency measures of a network that are popular in data centers for efficient traffic management of huge data. Various load balancing algorithms are known to perform better in specific network architectures. Software-Defined Network (SDN) is a new paradigm in which the data plane and the control plane are decoupled while they are coupled together in the traditional networks. Path finding and Path selection are two major phases of any load balancing algorithm. Path finding refers to the algorithms that find paths between sender and receiver.	en_US
dc.language.iso	en	en_US
dc.publisher	Faculty of Science, University of Ruhuna, Matara, Sri Lanka	en_US
dc.subject	Load balancing	en_US
dc.subject	SDN	en_US
dc.subject	Least busy path	en_US
dc.subject	Dijkstra's algorithm	en_US
dc.subject	Weighted round robin	en_US
dc.title	Comparative analysis of traditional load balancing algorithms in software-defined networks	en_US
dc.type	Article	en_US