Welcome to the InfoSci Platform
A Novel QoS Aware Shortest Path Algorithm for VSDN

A Novel QoS Aware Shortest Path Algorithm for VSDN

Amandeep Kaur Sandhu, Jyoteesh Malhotra
Copyright: © 2017 |Volume: 6 |Issue: 1 |Pages: 14
ISSN: 2155-6261|EISSN: 2155-627X|EISBN13: 9781522514831|DOI: 10.4018/IJWNBT.2017010101
Cite Article Cite Article

MLA

Sandhu, Amandeep Kaur, and Jyoteesh Malhotra. "A Novel QoS Aware Shortest Path Algorithm for VSDN." IJWNBT vol.6, no.1 2017: pp.1-14. http://doi.org/10.4018/IJWNBT.2017010101

APA

Sandhu, A. K. & Malhotra, J. (2017). A Novel QoS Aware Shortest Path Algorithm for VSDN. International Journal of Wireless Networks and Broadband Technologies (IJWNBT), 6(1), 1-14. http://doi.org/10.4018/IJWNBT.2017010101

Chicago

Sandhu, Amandeep Kaur, and Jyoteesh Malhotra. "A Novel QoS Aware Shortest Path Algorithm for VSDN," International Journal of Wireless Networks and Broadband Technologies (IJWNBT) 6, no.1: 1-14. http://doi.org/10.4018/IJWNBT.2017010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article describes how a rapid increase in usage of internet has emerged from last few years. This high usage of internet has occurred due to increase in popularity of multimedia applications. However, there is no guarantee of Quality of Service to the users. To fulfill the desired requirements, Internet Service Providers (ISPs) establish a service level agreement (SLA) with clients including specific parameters like bandwidth, reliability, cost, power consumption, etc. ISPs make maximum SLAs and decrease energy consumption to raise their profit. As a result, users do not get the desired services for which they pay. Virtual Software Defined Networks are flexible and manageable networks which can be used to achieve these goals. This article presents shortest path algorithm which improves the matrices like energy consumption, bandwidth usage, successful allocation of nodes in the network using VSDN approach. The results show a 40% increase in the performance of proposed algorithms with a respect to existing algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.