Abstract

Notwithstanding the significant attention that network function virtualization architectures received over the last few years, little attention has been placed on cases where proactive caching is considered within a service chain. Caching algorithms have been developed independently from virtual network function (VNF) chaining schemes, and as we explain in detail in this paper such operation might lead to sub-optimal overall network and service performance. Since caching of popular content is envisioned to be one of the key adopted technologies in emerging 5G networks to increase network efficiency and overall end user perceived quality of service, we explicitly consider the interplay and subsequent optimization of caching-based VNF service chains. To this end, a mathematical programming framework is proposed tailored to VNF caching chains and, in addition, we detail a scale-free heuristic algorithm to provide competitive solutions for large network instances since the problem itself can be seen as a variant of the classical NP-hard uncapacitated facility location problem. A wide set of numerical investigations is presented for characterizing the attainable system performance of the proposed schemes.

Highlights

  • I T is well accepted that current mobile network architectures suffer from insufficient scalability and flexibility to speedily accommodate new services and ability to embrace vertical industries [1]

  • Notwithstanding the significant attention that Network Function Virtualization (NFV) architectures received over the last few years little attention has been placed in cases where proactive caching is considered within a service chain

  • A mathematical programming framework is proposed tailored to virtual network function (VNF) caching chains and in addition detail a scale-free heuristic algorithm to provide competitive solutions for large network instances since the problem itself can be seen as a variant of the classical NPhard Uncapacitated Facility Location (UFL) problem

Read more

Summary

INTRODUCTION

I T is well accepted that current mobile network architectures suffer from insufficient scalability and flexibility to speedily accommodate new services and ability to embrace vertical industries [1]. In that respect, caching of popular content deserves paying a special attention in terms of VNF hosting location and chaining This is because in the most general case, a cached content must be visited before other VNFs can be applied and this service flow might originate from different possible network locations depending on the caching strategy. In other words, this type of service does not need to reach a gateway node or a specific cloud but can originate at any node that host the required cached content (which, most probably, be topologically closer to the end user).

MOTIVATION AND ILLUSTRATIVE EXAMPLES
PREVIOUS CLOSELY RELATED RESEARCH WORK
Proactive chaining-caching problem
SCALE FREE HEURISTIC APPROACHES
SPBA algorithm
AGW management scheme
CALCULATION COMPLEXITY ANALYSIS
OPTIMAL SOLUTION SCALABILITY ANALYSIS
Calculation Scalability
Memory Space Scalability
VIII. NUMERICAL INVESTIGATIONS
Performance evaluation for practical networks
Performance evaluation for scenarios of random generated topologies
Findings
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.