Network function virtualization (NFV) and software-dened networking (SDN) are two recent networking paradigms that strive to increase manageability, scalability, pro- grammability and dynamism. The former decouples network functions and hosting devices, while the latter decouples the data and control planes. As more and more service providers adopt these new paradigms, there is a growing need to address multi-failure conditions, particularly those arising from large-scale disaster events. Overall, addressing the virtual network function (VNF) placement and routing problem is crucial to deploy NFV surviv- ability. In particular, many studies have inspected non-survivable VNF provisioning, however no known work have proposed survivable/resilient solutions for multi-failure scenarios. In light of the above, this work proposes and deploys a survivable multi-objective provisioning solution for NFV infrastructures. Overall, this study initially proposes multi- objective solutions to eciently solve the VNF mapping/placement and routing problem. In particular, a integer linear programming (ILP) optimization and a greedy heuristic meth- ods try to maximize the requests acceptance rate while minimizing costs and implementing trac engineering (TE) load-balancing. Next, these schemes are expanded to perform \risk- aware" virtual function mapping and trac routing in order to improve the reliability of user services. Furthermore, additionally to the ILP optimization and greedy heuristic schemes, a metaheuristic genetic algorithm (GA) is also introduced, which is more suitable for large- scale networks. Overall, these solutions are then tested in idealistic and realistic stressor scenarios in order to evaluate their performance, accuracy and reliability.
| Identifer | oai:union.ndltd.org:USF/oai:scholarcommons.usf.edu:etd-8403 |
| Date | 09 April 2018 |
| Creators | Oliveira, Diogo |
| Publisher | Scholar Commons |
| Source Sets | University of South Flordia |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Graduate Theses and Dissertations |
Page generated in 0.0015 seconds