Open Research will be updating the system on Tuesday, 14 July 2026, from 8:15 to 9:00 AM. We apologise for any inconvenience caused.

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Virtual Network Function Service Provisioning for Offloading Tasks in MEC by Trading off Computing and Communication Resource Usages

Loading...
Thumbnail Image

Date

Authors

Ma, Yu
Liang, Weifa
Huang, Meitian
Liu, Yang
Guo, Song

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Abstract

Mobile edge computing (MEC) has emerged as a promising technology that offers resource-intensive yet delaysensitive applications from the edge of mobile networks. With the emergence of complicated and resource-hungry mobile applications, offloading user tasks to cloudlets of nearby mobile edgecloud networks is becoming an important approach to leverage the processing capability of mobile devices, reduce mobile device energy consumptions, and improve experiences of mobile users. In this paper we study the joint VNF instance deployment and offloading task request assignment in MEC, by explicitly exploring a non-trivial tradeoff between usages of different types of resources. We aim to maximize the number of request admissions while minimizing their admission cost. To this end, we first formulate the cost minimization problem that admits all requests, by assuming that there are sufficient computing resources to accommodate the requested VNF instances of all requests, for which we formulate an Integer Linear Program solution and an efficient heuristic. We then deal with the throughput maximization problem by admitting as many requests as possible, subject to computing resource capacity at each cloudlet, for which we devise an efficient algorithm. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising

Description

Keywords

Citation

Source

INFOCOM 2019 - IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2019

Book Title

Entity type

Access Statement

License Rights

Restricted until

2099-12-31
abcd