Finding most reliable paths for software defined networks

Ali Malik, Benjamin Aziz, Mohamed Bader-El-Den

Research output: Chapter in Book/Report/Conference proceedingConference contribution

231 Downloads (Pure)

Abstract

In this paper, we introduce a new approach that computes the shortest-reliable end-to-end paths for centrally controlled networks like software-defined networks (SDNs). The proposed method aims to find the correlation between the routing mechanism and reliability with the purpose of decreasing the required time of backup path installation through reducing the number of required rules at the moment of failure towards guarantee the fast restoration of the affected path, hence leading to the reduction of the overhead on SDN network controller and the probability of the loss of packets. We also investigate the correlation between the network topology and its reliability and demonstrate the benefits from this relation through experiments using well-known SDN network simulation tools.
Original languageEnglish
Title of host publication2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC)
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1309-1314
Number of pages6
ISBN (Electronic)978-1509043729
ISBN (Print)978-1509043736
DOIs
Publication statusPublished - 20 Jul 2017
Event13th International on Wireless Communications and Mobile Computing Conference - Valencia, Spain
Duration: 26 Jun 201730 Jun 2017
http://iwcmc.org/2017/

Publication series

NameIEEE IWCMC Proceedings Series
PublisherIEEE
ISSN (Electronic)2376-6506

Conference

Conference13th International on Wireless Communications and Mobile Computing Conference
Abbreviated titleIWCMC
Country/TerritorySpain
CityValencia
Period26/06/1730/06/17
Internet address

Keywords

  • SDN
  • reliability

Fingerprint

Dive into the research topics of 'Finding most reliable paths for software defined networks'. Together they form a unique fingerprint.

Cite this