Hits:

Indexed by:Journal Papers

Date of Publication:2020-02-01

Journal:IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

Included Journals:EI、SCIE

Volume:31

Issue:2

Page Number:393-407

ISSN No.:1045-9219

Key Words:Cloud computing; Multicast algorithms; Heuristic algorithms; Approximation algorithms; Throughput; Task analysis; Bandwidth; Mobile edge-cloud networks (MEC); distributed resource allocation and provisioning; NFV-enabled multicast requests; virtualized network function (VNF); VNF instance placement and sharing; service function chains (SFCs); throughput maximization; Steiner tree problems; online algorithms

Abstract:Mobile Edge Computing (MEC) reforms the cloud paradigm by bringing unprecedented computing capacity to the vicinity of end users at the mobile network edge. This provides end users with swift and powerful computing and storage capacities, energy efficiency, and mobility- and context-awareness support. Furthermore, Network Function Virtualization (NFV) is another promising technique that implements various network functions for many applications as pieces of software in servers or cloudlets in MEC networks. The provisioning of virtualized network services in MEC can improve user service experiences, simplify network service deployment, and ease network resource management. However, user requests arrive dynamically and different users demand different amounts of resources, while the resources in MEC are dynamically occupied or released by different services. It thus poses a significant challenge to optimize the performance of MEC through efficient computing and communication resource allocations to meet ever-growing resource demands of users. In this paper, we study NFV-enabled multicasting that is a fundamental routing problem in an MEC network, subject to resource capacities on both its cloudlets and links. Specifically, we first devise an approximation algorithm for the cost minimization problem of admitting a single NFV-enabled multicast request. We then develop an efficient algorithm for the throughput maximization problem for the admissions of a given set of NFV-enabled multicast requests. We third devise an online algorithm with a provable competitive ratio for the online throughput maximization problem when NFV-enabled multicast requests arrive one by one without the knowledge of future request arrivals. We finally evaluate the performance of the proposed algorithms through experimental simulations. Simulation results demonstrate that the proposed algorithms are promising.