Placements of virtual network functions for effective network functions virtualization

In the future wireless networks, network function virtualization will lay the foun- dation for establishing a new resource management framework to e ciently utilize network resources. The rst part of this thesis deals in the minimization of the to- tal latency for a network and how to solve it e ciently. A model of users, Virtual Network Functions (vNFs) and hosting devices have been considered and was used to nd the minimum latency using Integer Linear Programming (ILP). The problem is NP-hard and takes exponential time to solve in the worst case. A Stable Matching based heuristic has been proposed to solve the problem in polynomial time and then the local search is utilized to improve the e ciency of the result. The second part of this thesis proposes the problem of fair allocation of the vNFs to hosting devices. A mathematical programming based model (ILP) has been designed to solve the problem which takes exponential time to solve in the worst case, due to its NP-hard nature. Thus an heuristic approach has been provided to solve the problem in polynomial time