Publication Type:

Journal Article

Source:

International Journal of Pure and Applied Mathematics, Academic Press, Volume 114, Number 12 Special Issue, p.715-729 (2017)

URL:

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032227692&partnerID=40&md5=4fe22aed452155f2f2dca28bd72b89d7

Abstract:

<p>Network virtualization in a data center network offers a promising solution to address the resource latency demands imposed by load balancing applications. Load balancing traffic in virtualized Software Defined Networks enables us to optimize resource utilization, maximize throughput, minimize response time and avoid overloading of a single resource. In this paper, we have used a network virtualization platform, OpenVirteX, to implement server load balancing algorithms with path selection to achieve minimum latency. Random, round robin, and least connections algorithms are implemented to balance the load on servers. A path selection algorithm to compute the minimum latency path is implemented. The experiments performed on the virtual network show that the least connections algorithm with path selection does efficient server load balancing with minimum latency than the random and round robin server load balancing with path selection.</p>

Notes:

cited By 0

Cite this Research Publication

K. Nalinadevi, Sriram, S., Raahul, C., Raaj, H., and Sangeetha, B., “Server load balancing with path selection in virtualized software defined networks”, International Journal of Pure and Applied Mathematics, vol. 114, pp. 715-729, 2017.

207
PROGRAMS
OFFERED
6
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS