Routing algorithm optimization for Software Defined Network WAN

Research output: Contribution to Book/Report typesChapterResearchpeer-review

Abstract

Software Defined Network (SDN) provides a new fine-grained interface enables the routing algorithm to have a global view of the network throughputs, connectivity and flows at the data-path. This paper aims to provide a novel approach for dynamic routing algorithm for Software Defined Network in Wide Area Network (SDN-WAN); based on using a modified shortest-widest path algorithm with a fine-grained statistical method from the OpenFlow interface, called Shortest-Feasible OpenFlow Path (SFOP). This algorithm is designed to identify the optimal route from source to destination, providing efficient utilization of the SDN-WAN resources. It achieves this aim by considering both the flow requirements and the current state of the network. SFOP computes the optimal path which provides the feasible bandwidth with the lowest hop count (delay). That will present better stability in SDN communication, QoS, and usage of available resources. Moreover, this algorithm will be the base for an SDN controller because it extracts the widest available bandwidth from source to destination for a single path. It enables the controller to decide whether it is enough to use this simple algorithm only, or if a more complicated algorithm that provides larger bandwidth such as multiple-path algorithms is needed. Finally, a testbed has been implemented using MATLAB Simulator, Pox controller, and Mininet emulator will be discussed. The latency comparison of SFOP algorithm with three other algorithm’s latencies shows that this algorithm finds better latency for an optimal path. Evidence will be shown that demonstrates that SFOP has good stability in dynamic changes of SDN-WAN.
Original languageEnglish
Title of host publication2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA)
Place of PublicationU.S.
PublisherIEEE
ISBN (Print)9781509032471
DOIs
Publication statusPublished - 1 Dec 2016

Fingerprint

Wide area networks
Routing algorithms
Computer networks
Bandwidth
Controllers
Dynamic routing algorithms
Testbeds
MATLAB
Telecommunication networks
Interfaces (computer)
Statistical methods
Quality of service
Simulators
Throughput

Keywords

  • Matlab
  • Mininet
  • OpenFlow
  • Pox
  • SDN
  • WAN

Cite this

Al-Sadi, A., Al-Sherbaz, A., Xue, J., & Turner, S. J. (2016). Routing algorithm optimization for Software Defined Network WAN. In 2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA) U.S.: IEEE. https://doi.org/10.1109/AIC-MITCSA.2016.7759945
Al-Sadi, Ameer ; Al-Sherbaz, Ali ; Xue, James ; Turner, Scott J. / Routing algorithm optimization for Software Defined Network WAN. 2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA). U.S. : IEEE, 2016.
@inbook{2bca3e5ff2f348ae8aeeef085025f2a9,
title = "Routing algorithm optimization for Software Defined Network WAN",
abstract = "Software Defined Network (SDN) provides a new fine-grained interface enables the routing algorithm to have a global view of the network throughputs, connectivity and flows at the data-path. This paper aims to provide a novel approach for dynamic routing algorithm for Software Defined Network in Wide Area Network (SDN-WAN); based on using a modified shortest-widest path algorithm with a fine-grained statistical method from the OpenFlow interface, called Shortest-Feasible OpenFlow Path (SFOP). This algorithm is designed to identify the optimal route from source to destination, providing efficient utilization of the SDN-WAN resources. It achieves this aim by considering both the flow requirements and the current state of the network. SFOP computes the optimal path which provides the feasible bandwidth with the lowest hop count (delay). That will present better stability in SDN communication, QoS, and usage of available resources. Moreover, this algorithm will be the base for an SDN controller because it extracts the widest available bandwidth from source to destination for a single path. It enables the controller to decide whether it is enough to use this simple algorithm only, or if a more complicated algorithm that provides larger bandwidth such as multiple-path algorithms is needed. Finally, a testbed has been implemented using MATLAB Simulator, Pox controller, and Mininet emulator will be discussed. The latency comparison of SFOP algorithm with three other algorithm’s latencies shows that this algorithm finds better latency for an optimal path. Evidence will be shown that demonstrates that SFOP has good stability in dynamic changes of SDN-WAN.",
keywords = "Matlab, Mininet, OpenFlow, Pox, SDN, WAN",
author = "Ameer Al-Sadi and Ali Al-Sherbaz and James Xue and Turner, {Scott J}",
year = "2016",
month = "12",
day = "1",
doi = "10.1109/AIC-MITCSA.2016.7759945",
language = "English",
isbn = "9781509032471",
booktitle = "2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA)",
publisher = "IEEE",

}

Al-Sadi, A, Al-Sherbaz, A, Xue, J & Turner, SJ 2016, Routing algorithm optimization for Software Defined Network WAN. in 2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA). IEEE, U.S. https://doi.org/10.1109/AIC-MITCSA.2016.7759945

Routing algorithm optimization for Software Defined Network WAN. / Al-Sadi, Ameer; Al-Sherbaz, Ali; Xue, James; Turner, Scott J.

2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA). U.S. : IEEE, 2016.

Research output: Contribution to Book/Report typesChapterResearchpeer-review

TY - CHAP

T1 - Routing algorithm optimization for Software Defined Network WAN

AU - Al-Sadi, Ameer

AU - Al-Sherbaz, Ali

AU - Xue, James

AU - Turner, Scott J

PY - 2016/12/1

Y1 - 2016/12/1

N2 - Software Defined Network (SDN) provides a new fine-grained interface enables the routing algorithm to have a global view of the network throughputs, connectivity and flows at the data-path. This paper aims to provide a novel approach for dynamic routing algorithm for Software Defined Network in Wide Area Network (SDN-WAN); based on using a modified shortest-widest path algorithm with a fine-grained statistical method from the OpenFlow interface, called Shortest-Feasible OpenFlow Path (SFOP). This algorithm is designed to identify the optimal route from source to destination, providing efficient utilization of the SDN-WAN resources. It achieves this aim by considering both the flow requirements and the current state of the network. SFOP computes the optimal path which provides the feasible bandwidth with the lowest hop count (delay). That will present better stability in SDN communication, QoS, and usage of available resources. Moreover, this algorithm will be the base for an SDN controller because it extracts the widest available bandwidth from source to destination for a single path. It enables the controller to decide whether it is enough to use this simple algorithm only, or if a more complicated algorithm that provides larger bandwidth such as multiple-path algorithms is needed. Finally, a testbed has been implemented using MATLAB Simulator, Pox controller, and Mininet emulator will be discussed. The latency comparison of SFOP algorithm with three other algorithm’s latencies shows that this algorithm finds better latency for an optimal path. Evidence will be shown that demonstrates that SFOP has good stability in dynamic changes of SDN-WAN.

AB - Software Defined Network (SDN) provides a new fine-grained interface enables the routing algorithm to have a global view of the network throughputs, connectivity and flows at the data-path. This paper aims to provide a novel approach for dynamic routing algorithm for Software Defined Network in Wide Area Network (SDN-WAN); based on using a modified shortest-widest path algorithm with a fine-grained statistical method from the OpenFlow interface, called Shortest-Feasible OpenFlow Path (SFOP). This algorithm is designed to identify the optimal route from source to destination, providing efficient utilization of the SDN-WAN resources. It achieves this aim by considering both the flow requirements and the current state of the network. SFOP computes the optimal path which provides the feasible bandwidth with the lowest hop count (delay). That will present better stability in SDN communication, QoS, and usage of available resources. Moreover, this algorithm will be the base for an SDN controller because it extracts the widest available bandwidth from source to destination for a single path. It enables the controller to decide whether it is enough to use this simple algorithm only, or if a more complicated algorithm that provides larger bandwidth such as multiple-path algorithms is needed. Finally, a testbed has been implemented using MATLAB Simulator, Pox controller, and Mininet emulator will be discussed. The latency comparison of SFOP algorithm with three other algorithm’s latencies shows that this algorithm finds better latency for an optimal path. Evidence will be shown that demonstrates that SFOP has good stability in dynamic changes of SDN-WAN.

KW - Matlab

KW - Mininet

KW - OpenFlow

KW - Pox

KW - SDN

KW - WAN

U2 - 10.1109/AIC-MITCSA.2016.7759945

DO - 10.1109/AIC-MITCSA.2016.7759945

M3 - Chapter

SN - 9781509032471

BT - 2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA)

PB - IEEE

CY - U.S.

ER -

Al-Sadi A, Al-Sherbaz A, Xue J, Turner SJ. Routing algorithm optimization for Software Defined Network WAN. In 2016 Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications (AIC-MITCSA). U.S.: IEEE. 2016 https://doi.org/10.1109/AIC-MITCSA.2016.7759945