Dynamic Resource Coordination towards Reliable and Flexible Network Slicing

Simple item page
dc.contributor.advisorJue, Jason
dc.creatorIshigaki, Genya
dc.date.accessioned2022-03-30T20:51:24Z
dc.date.available2022-03-30T20:51:24Z
dc.date.created2021-08
dc.date.issued2021-05-19
dc.date.submittedAugust 2021
dc.date.updated2022-03-30T20:51:25Z
dc.description.abstractThe increasing demand for a diverse array of network applications entails a more flexible and reliable networking paradigm. Network slicing is envisioned to package a set of networking, computing, and storage resources in a coordinated manner, so that the network slice with the tailored set of resources satisfies service requirements unique to each network application. A key enabling technology of network slicing is network softwarization, exemplified by Software Defined Networking (SDN) and Network Function Virtualization (NFV), which enable swift migration of both networking and computing resources. While network slicing sets a conceptual foundation for next-generation networking for diverse applications, the resource coordination mechanism that dynamically operates and manages the resources remains a challenging issue. This is more so when considering the computational complexity induced by the dependency relationship among the softwarized resources and the uncertainty of future network states, such as network failure scenarios and traffic patterns. This dissertation features four resource allocation problems that collectively facilitate the agile operation and management of end-to-end network slices. The first two problems are related to the reliability aspect of network slicing. In particular, we discuss protection and recovery problems of interdependent network components from a resource allocation standpoint. The third problem deals with a dynamic bandwidth allocation in optical access networks. The dynamic adjustment of allocated bandwidth assists more effective resource utilization and the accommodation of different types of network services. Furthermore, SDN controller placement, which determines responsiveness to a request for end-to-end resource coordination, is examined as the fourth problem. The theoretical analysis and proposed algorithms for the problems not only solve the specific resource allocation tasks, but also provide fundamental insights to tackle similar allocation problems under entangled dependency and future uncertainty. In particular, the proposed learning-based approaches project an automated resource coordination system for more effective utilization of network resources in 5G and beyond networks.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/10735.1/9385
dc.language.isoen
dc.subjectResource allocation
dc.subjectComputer networks
dc.subjectEnd-to-end delay (Computer networks)
dc.subjectResource allocation
dc.titleDynamic Resource Coordination towards Reliable and Flexible Network Slicing
dc.typeThesis
dc.type.materialtext
thesis.degree.departmentComputer Science
thesis.degree.grantorThe University of Texas at Dallas
thesis.degree.levelDoctoral
thesis.degree.namePHD

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
ISHIGAKI-DISSERTATION-2021.pdf
Size:
2.24 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.84 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.84 KB
Format:
Plain Text
Description:
Download

Collections

UTD Theses and Dissertations