SPRM: Source Path Routing Model for Software Defined Networks

dc.contributor.advisorKorkmaz, Turgay
dc.contributor.authorKomajwar, Sharvari
dc.contributor.committeeMemberQuarles, John
dc.contributor.committeeMemberJadliwala, Murtuza
dc.contributor.committeeMemberTosun, Ali Saman
dc.contributor.committeeMemberErgur, Alperen
dc.creator.orcidhttps://orcid.org/0000-0001-7647-4630
dc.date.accessioned2024-02-12T14:41:28Z
dc.date.available2024-02-12T14:41:28Z
dc.date.issued2021
dc.descriptionThis item is available only to currently enrolled UTSA students, faculty or staff. To download, navigate to Log In in the top right-hand corner of this screen, then select Log in with my UTSA ID.
dc.description.abstractSoftware Defined Networking (SDN) has emerged as a promising paradigm to make network management easier by separating control and network management from the forwarding functions. SDN has shown to be successful in the context of local area network(LAN). However, in the context of wide area network(WAN), SDN faces various scalability issues such as how to compute/install a path for each incoming flow without causing overhead on the control and the data plane, or how to update the network state consistently when policy changes or link/node failures occur. In contrast to this reactive mode of operation, SDN can also use proactive mode of operation and provide better scalability. However, this comes with the cost of loosing per-flow management flexibility, which allows to highly utilize network resources. To address the scalability issues while maintaining the same performance level, we need to find a balanced mode of operation within the spectrum of reactive and proactive modes. Accordingly, we propose a new Source-Path Routing Model (SPRM) by combining the best of proactive and reactive approaches along with a simple packet programming mechanism. Specifically, we pre-calculate and pre-install multiple paths (proactive part) but then select/assign one of these paths for an incoming flow based on the available dynamic network state information(NSI) (reactive part). We program the selected path ID and a command into each packet do dynamically decide how to forward them through the underlying network. We also utilize SPRM to effectively cope with the link failures by using multiple paths as backup to each other. Our simulation results show that SPRM performs much better than the pure Reactive SDN in terms of path establishment delay and flow table size while (a) maintaining its performance gains in terms of link utilization and load balancing, and (b) quickly recovering from a link failure without causing extra memory overhead on the data plane.
dc.description.departmentComputer Science
dc.format.extent117 pages
dc.format.mimetypeapplication/pdf
dc.identifier.isbn9798538136483
dc.identifier.urihttps://hdl.handle.net/20.500.12588/4117
dc.languageen
dc.subjectLink Failure
dc.subjectRouting
dc.subjectScalability
dc.subjectSoftware defined network
dc.subjectSDN
dc.subject.classificationComputer science
dc.subject.classificationComputer engineering
dc.subject.classificationInformation technology
dc.titleSPRM: Source Path Routing Model for Software Defined Networks
dc.typeThesis
dc.type.dcmiText
dcterms.accessRightspq_closed
thesis.degree.departmentComputer Science
thesis.degree.grantorUniversity of Texas at San Antonio
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Komajwar_utsa_1283D_13405.pdf
Size:
1.2 MB
Format:
Adobe Portable Document Format