A GRASP-based Approach for Dynamic Cache Resources Placement in Future Networks - Archive ouverte HAL Access content directly
Journal Articles Journal of Network and Systems Management Year : 2020

A GRASP-based Approach for Dynamic Cache Resources Placement in Future Networks

(1) , (1)
1

Abstract

Dealing with the ever-increasing video traffic is certainly one of the major challenges facing Internet Service Providers (ISPs). In this context, the strategic placement of caches is seen as one of the most important remedies, especially with recent advances in the field of virtualization. Unlike the existing works, which only focus on the placement issue, we also consider the problem of determining the optimal amount of cache to place at each possible location. We formalize, in this paper, the problem of caches placement as a multi-objective optimization problem, in which we minimize both the average distance from which contents are retrieved and the peering links utilization. As the proposed problem is NP-hard, we propose to solve it using the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic. Simulations results reveal the quality of the obtained solutions compared to an exhaustive search method. At the same time, they reveal that the solution is not to put all resources at the edge or at the core, as some studies claim, but to partition them judiciously, which mainly depends on the objectives of the ISPs.
Fichier principal
Vignette du fichier
A_GRASP_based_Approach_for_Dynamic_Cache_Resources_Placement_in_Future_Networks.pdf (1.3 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03122222 , version 1 (26-01-2021)

Identifiers

Cite

Hamza Ben-Ammar, Yassine Hadjadj-Aoul. A GRASP-based Approach for Dynamic Cache Resources Placement in Future Networks. Journal of Network and Systems Management, 2020, 28 (3), pp.457-477. ⟨10.1007/s10922-020-09521-4⟩. ⟨hal-03122222⟩
34 View
68 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More