Abstract-A new era in telecommunications is emerging. Virtualised networking functions and resources will offer network operators a way to shift the balance of expenditure from capital to operational, opening up networks to new and innovative services. This paper introduces the concept of Edge-as-a-Service (EaaS), a means of harnessing the flexibility of virtualised network functions and resources to enable network operators to break the tightly coupled relationship they have with their infrastructure and to enable more effective ways of generating revenue. To achieve this vision, we envisage a virtualised service access interface that can be used to programmatically alter access network functions and resources available to service providers in an elastic fashion. EaaS has many technically and economically difficult challenges that must be addressed before it can become a reality; the main challenges are summarised in this paper.

No abstract

No abstract

Network Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service Function Chains (SFCs), that are customized and configured to meet specific service requirements. However, due to the limited footprint of the Infrastructure Providers (InPs), these SFCs may have to transcend multiple InPs/domains. In this regard, determining the optimal set of InPs in which to embed the SFC request emerges as a complex problem for several reasons. First, the large number of possible combinations for selecting the InPs to embed the different sub-chains of the request makes this problem computationally complex, rendering optimal solutions only after long computations, especially in large scale networks, which is unfeasible for delay sensitive applications. Second, the unwillingness of InPs to disclose their internal information, which may be vital for making embedding decisions, usually implies the provisioning of single-domain solutions, which are unsuitable in this working scenario. In this regard, this paper first formulates the multi-domain service deployment problem under multiple request constraints, such as bandwidth or delay, among others. Then, due to the NP-hardness nature of the above problem, this paper proposes an algorithm that is aided by a multi-stage graph for computing a request embedding solution in a distributed manner, solving the problem in acceptable run-times. Results from different simulations reveal that the proposed algorithm is optimized in terms of acceptance ratio and embedding cost, with up to 60.0% and 88.7% improvements in terms of embedding cost and execution time, respectively, for some scenarios, in comparison with a benchmark state-of-the-art algorithm.

In Network Virtualization Environments, the capability of operators to allocate resources in the Substrate Network (SN) to support Virtual Networks (VNs) in an optimal manner is known as Virtual Network Embedding (VNE). In the same context, online VN migration is the process meant to reallocate components of a VN, or even an entire VN among elements of the SN in real time and seamlessly to end‐users. Online VNE without VN migration may lead to either over‐ or under‐utilization of the SN resources. However, VN migration is challenging due to its computational cost and the service disruption inherent to VN components reallocation. Online VN migration can reduce migration costs insofar it is triggered proactively, not reactively, at critical times, avoiding the negative effects of both under‐ and over‐triggering. This paper presents a novel online cost‐efficient mechanism that self‐adaptively learns the exact moments when triggering VN migration is likely to be profitable in the long term. We propose a novel self‐adaptive mechanism based on Reinforcement Learning that determines the right trigger online VN migration times, leading to the minimization of migration costs while simultaneously considering the online VNE acceptance ratio.