IDEAS home Printed from https://ideas.repec.org/a/igg/jwnbt0/v6y2017i1p1-14.html
   My bibliography  Save this article

A Novel QoS Aware Shortest Path Algorithm for VSDN

Author

Listed:
  • Amandeep Kaur Sandhu

    (Department of Computer Engineering & Technology, Guru Nanak Dev University Regional Campus, Jalandhar, India)

  • Jyoteesh Malhotra

    (Department of Electronics & Communication, Guru Nanak Dev University Regional Campus, Jalandhar, India)

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.

Suggested Citation

  • Amandeep Kaur Sandhu & Jyoteesh Malhotra, 2017. "A Novel QoS Aware Shortest Path Algorithm for VSDN," International Journal of Wireless Networks and Broadband Technologies (IJWNBT), IGI Global, vol. 6(1), pages 1-14, January.
    • Handle: RePEc:igg:jwnbt0:v:6:y:2017:i:1:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWNBT.2017010101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwnbt0:v:6:y:2017:i:1:p:1-14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.