الفهرس 
Chapter 1 IntroductionOnly 14 pages are availabe for public view
 |  | from | 162 |  |  |
| | | from | 162 | | |
Abstract
”Software Defined Networking (SDN) is considered the next generation network that aims to separate the control plane and the data plane. The control plane is moved to the central unit that is called the controller while the other switches act as forwarders. Separating the control plane makes it easy to develop novel techniques that allow SD Networks in order to be flexible to respond to the network changes. In this thesis, an algorithm to improve the quality of service (QoS) for SDN is introduced. The objective of the algorithm queue management with ingress policing (QMIP) is to manage the queue for traffic requests with ingress policing. The proposed algorithm allows queue allocation according to characteristic of incoming traffic and creates a policy that specifies a fixed amount of bandwidth for the specified traffic or host that will use the network resources compared with other similar techniques to study its effectiveness. A simulation and analysis are done on a Floodlight controller and Mininet to test the performance of QMIP comparing with other queueing algorithms. The experiments done shows that QMIP over perform the other algorithms. In this thesis, the Dijkstra shortest path algorithm is also modified to forwards load based on link delay. The difference between the modified extended Dijkstra and the extended Dijkstra is that in the former the route is selected based on distance instead of the delay. The importance of the proposed method is evident when the delays are different on equal bandwidth links. Python programming language is used to realize the modified method and evaluate its performance by comparing it with the traditional Dijkstra’s method. The emulation is carried out using Mininet tool. The performance of the modified method outperforms the performance of the original one.This thesis explains two different algorithms to improve QoS in SDN, QMIP and modified Dijkstra algorithm. The two algorithms are different from each other. Many experiments have been made to study the effect of each algorithm compared to other traditional algorithms. Also, SDN was studied mathematically to model the switch performance and the shared queue versus priority queueing in SDN. Finally, the thesis ends with the conclusion.