Title:
Building scalable software defined OpenFlow networks

dc.contributor.advisor Blough, Douglas M.
dc.contributor.author Yang, Hemin
dc.contributor.committeeMember Owen, Henry L.
dc.contributor.committeeMember Clark, Russell J.
dc.contributor.committeeMember Chang, Yusun
dc.contributor.committeeMember Fujimoto, Richard M.
dc.contributor.department Electrical and Computer Engineering
dc.date.accessioned 2020-09-08T12:38:48Z
dc.date.available 2020-09-08T12:38:48Z
dc.date.created 2019-08
dc.date.issued 2019-04-30
dc.date.submitted August 2019
dc.date.updated 2020-09-08T12:38:48Z
dc.description.abstract Software Defined Networking (SDN) is widely regarded as the next generation networking technique, which can create programmable, automated, and agile networks whilst reducing costs. The core of SDN is to separate and logically centralize network control from its data plane. To achieve this separation, most SDN implementations use the de facto southbound protocol OpenFlow as the communication interface between the control and data planes. However, the scalability problem bottlenecks the deployment of SDN OpenFlow for large networks. The roots of SDN OpenFlow scalability problem are the centralized control architecture and the unmatched capabilities of OpenFlow switches to deal with the massive events generated by the fine-grained granularity control mechanism. The objective of this thesis is to address the fundamental problems of scaling SDN OpenFlow networks. On the control plane, this work first investigates the scalability performance of all existing control architectures in order to answer the question, ``which control plane architecture scales the best?" The simulation results show that the hierarchical control architecture and the distributed control plane are the most two scalable control architectures. With this conclusion, this work then aims to address the most important challenge, eastbound/westbound interface design, for the distributed control plane, which is more feasible for scaling across geographies than the hierarchical one. As for the data plane, this research works around the hardware manufacturing related limitations such as CPU and bus bandwidth by improving the utilization of the existing precise hardware resources and reducing control overheads to mitigate the scalability problem. Specifically, machine learning techniques are exploited to improve proactive flow entry deletion and flow entry eviction. The provided theoretical analysis and simulation results in this thesis lay out the foundation for the deployment of large scale SDN OpenFlow networks.
dc.description.degree Ph.D.
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/63497
dc.language.iso en_US
dc.publisher Georgia Institute of Technology
dc.subject SDN
dc.subject OpenFlow
dc.subject Scalability
dc.subject Simulation
dc.subject Traffic engineering
dc.subject Proactive flow entry deletion
dc.subject Flow entry eviction
dc.subject Machine learning
dc.title Building scalable software defined OpenFlow networks
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Blough, Douglas M.
local.contributor.corporatename School of Electrical and Computer Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 361410e1-2656-48cf-8d91-a4cd3d538c29
relation.isOrgUnitOfPublication 5b7adef2-447c-4270-b9fc-846bd76f80f2
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
thesis.degree.level Doctoral
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
YANG-DISSERTATION-2019.pdf
Size:
2.07 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
3.86 KB
Format:
Plain Text
Description: