text: In this paper, we propose an end to end joint radio and virtual network function (VNF) resource allocation for next-generation networks providing different types of services with different requirements in term of latency and data rate. We consider both the access and core parts of the network and formulate a novel optimization problem whose aim is to perform the radio resource allocation jointly with VNF embedding, scheduling, and resource allocation such that the network cost, defined as the consumed energy and the number of utilized network servers, is minimized. The proposed optimization problem is non-convex, NP-hard, and mathematically intractable, and hence, we use an alternative search method (ASM) to decouple the main problem into some sub-problems of lower complexity. We propose a novel heuristic algorithm for embedding and scheduling of VNFs by proposing a novel admission control (AC) algorithm. We compare the performance of the proposed algorithm with a greedy-based solution in terms of the acceptance ratio and the number of active servers. Our simulation results show that the proposed algorithm outperforms the conventional ones.
  @cite_25: Software-Defined Networking and Network Functions Virtualization have initiated a new landscape within the telecom market landscape. Initial proof-of-concept prototypes for NFV-enabled solutions are being developed at the same time SDN models are identified as the futures solutions within the telecom realm. In this article, we provide a brief overview of the application and state-of-the-art of SDN and NFV technologies over optical networks. At the same time, we provide the first formalisation model for the VNF complex scheduling problem, using the complex job formalisation. The article aims at being used as starting point in order to optimally solve the scheduling problem of virtual network functions that compose network services to be provisioned within the SDN paradigm. Finally, we also provide an example of the virtualization of the routing function over an SDN-enabled domain.
  @cite_7: 
  @cite_3: Network function virtualization has received attention from both academia and industry as an important shift in the deployment of telecommunication networks and services. It is being proposed as a path towards cost efficiency, reduced time-to-markets, and enhanced innovativeness in telecommunication service provisioning. However, efficiently running virtualized services is not trivial as, among other initialization steps, it requires first mapping virtual networks onto physical networks, and thereafter mapping and scheduling virtual functions onto the virtual networks. This paper formulates the online virtual function mapping and scheduling problem and proposes a set of algorithms for solving it. Our main objective is to propose simple algorithms that may be used as a basis for future work in this area. To this end, we propose three greedy algorithms and a tabu search-based heuristic. We carry out evaluations of these algorithms considering parameters such as successful service mappings, total service processing times, revenue, cost etc, under varying network conditions. Simulations show that the tabu search-based algorithm performs only slightly better than the best greedy algorithm.
summary: T he fifth generation of wireless cellular networks (5G) provides a wide range of services black with various requirements that should be guaranteed in the network @cite_3 @cite_7 . In the traditional network, dedicated and specific hardware equipment are required. Therefore, in order to provide a new service in these networks, it is necessary for each operator to purchase the hardware resources and install it on the network @cite_25 .