Efficient Resource Allocation in Next-Generation Networks

Please enable javascript in your browser.

Gholamzadeh, Jafar | 2022

60 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 55694 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Movaghar, Ali
Abstract:
Network Function Virtualization (NFV) is a new paradigm for designing modern computer networks and data centers. NFV leverages the IT virtualization technologies to virtualize entire classes of network node functions into building blocks that may connect, or chain together to create communication services. In this research, we analysed and designed two offline and online algorithms for the problem of join optimization over placement and routing of network function chains in data centers. In the offline case, we showed that traditional randomized rouding works well and by help of chrnoff bound, we derive a new bound on performance gap. The online algorithm in both performance and resource violations, asymptotically achieves the best possible performance among all online algorithms with positive competitive ratio. We use massive simulations to show the applicability of the online solution to address real world issues of network design.
Keywords:
Virtualization ; Linear Programming ; Approximate Algorithm ; Resources Allocation ; Network Function Virtualization