A novel mobile edge network architecture with joint caching-delivering and horizontal cooperation

Saputra, Yuris Mulya and Hoang, Dinh Thai and Nguyen, Diep N. and Dutkiewicz, Eryk (2021) A novel mobile edge network architecture with joint caching-delivering and horizontal cooperation. IEEE Transactions on Mobile Computing, 20 (1). 19 – 31. ISSN 15361233

Full text not available from this repository.

Abstract

Mobile edge caching/computing (MEC) has been emerging as a promising paradigm to provide ultra-high rate, ultra-reliable, and/or low-latency communications in future wireless networks. In this paper, we introduce a novel MEC network architecture that leverages the optimal joint caching-delivering with horizontal cooperation among mobile edge nodes (MENs). To that end, we first formulate the content-access delay minimization problem by jointly optimizing the content caching and delivering decisions under various network constraints (e.g., network topology, storage capacity and users' demands at each MEN). However, the strongly mutual dependency between the decisions makes the problem a nested dual optimization that is proved to be NP-hard. To deal with it, we propose a novel transformation method to transform the nested dual problem to an equivalent mixed-integer nonlinear programming (MINLP) optimization problem. Then, we design a centralized solution using an improved branch-and-bound algorithm with the interior-point method to find the joint caching and delivering policy which is within 1 percent of the optimal solution. Since the centralized solution requires the full network topology and information from all MENs, to make our solution scalable, we develop a distributed algorithm which allows each MEN to make its own decisions based on its local observations. Extensive simulations demonstrate that the proposed solutions can reduce the total average delay for the whole network up to 40 percent compared with other current caching policies. Furthermore, the proposed solutions also increase the cache hit ratio for the network up to 4 times, thereby dramatically reducing the traffic load on the backhaul network. © 2002-2012 IEEE.

Item Type: Article
Additional Information: Cited by: 43; All Open Access, Green Open Access
Uncontrolled Keywords: Branch and bound method; Integer programming; Mathematical transformations; Nonlinear programming; NP-hard; Topology; Branch-and-bound algorithms; Extensive simulations; Future wireless networks; Horizontal cooperations; Low-latency communication; Mixed-integer nonlinear programming; Optimization problems; Transformation methods; Network architecture
Subjects: T Technology > T Technology (General)
Divisions: Vocational School
Depositing User: Sri JUNANDI
Date Deposited: 04 Nov 2024 02:01
Last Modified: 04 Nov 2024 02:01
URI: https://ir.lib.ugm.ac.id/id/eprint/10613

Actions (login required)

View Item
View Item