Abstract

The bursting increase in requesting wireless data has caused several issues in network peak-traffic duration. This negatively results in significant data delivery delay imposed on users that can eventually impact the network's quality of service and users' quality of experience. In this research, regarding mobile edge caching as a potential solution to decrease such delay, we propose a new framework in which we introduce the concept of the flexible user where he requests for a set of multiple files from the library with a unique feature, e.g., 5 movies within comedy genre from the library in the peak-traffic duration. The satisfactory criterion for the flexible user is to receive any of the files within the requested set. This definition of the flexible user indicates a new concept which captures interesting scenarios. In order to model this concept, we generalize the conventional Zipf distribution to a multivariate one as the modeling method for popular data. We formulate the problem of finding the optimal cache data placement, which minimizes the average total delivery delay in the network while satisfying the helpers' cache size constraints. To this end, we derive the average delivery delay per user as well as the average total delivery delay in the network, according to the new generalized Zipf distribution. Finding the optimal solution is proved to be NP-Hard. We leverage on the problem property to propose an efficient approximation method, called greedy algorithm, which performs within a constant factor as good as the optimal solution. Afterwards, we propose an algorithm called speedy-greedy to significantly reduce the computational complexity of the greedy algorithm while achieving the same performance. Simulation results indicate that our proposed framework significantly decreases the average total delivery delay of the system model that can help the network maintain its quality of service in network peak-traffic duration.

Highlights

  • Advances in telecommunications engineering - from old generations, 2G and 3G, to current generations, 4G, 5G and beyond - allow wireless cellular networks to provide higher security, speed, reliability and capacity in accessing data pool [1]

  • In order for the network to be able to support such a high demand for wireless data, it is mandatory to merge some new technologies in communications such as internet of things (IoT), massive MIMO, mobile edge caching (MEC), mobile cloud computing (MCC), etc. [4]–[6]

  • Other locations where popular data can be cached in networks elements are in the user equipment (UE) mostly in device-to-device (D2D) and internet of thing (IoT) applications [22]–[24], macro base stations (MBSs), small-cells and pico-cells, relays and CRANs [25]

Read more

Summary

INTRODUCTION

Advances in telecommunications engineering - from old generations, 2G and 3G, to current generations, 4G, 5G and beyond - allow wireless cellular networks to provide higher security, speed, reliability and capacity in accessing data pool [1]. The main idea behind proposing femto cells was to bring users and terminal devices in the network closer to one another, which makes femto cells be generally beneficial with compensating poor cellular coverage, creating network capacity wherever needed, and improving network QoS by offloading traffic and overhead from the macro base station [17], [18]. Other locations where popular data can be cached in networks elements are in the user equipment (UE) mostly in device-to-device (D2D) and internet of thing (IoT) applications [22]–[24], macro base stations (MBSs), small-cells and pico-cells, relays and CRANs (a novel proposed architecture for 5G cellular networks) [25]. We formulate the problem of optimal cache data placement with helpers’ cache size constraints In this regard, we derive the average delivery delay per user as well as the average total delivery delay in the network, according to the new generalized Zipf distribution.

RELATED WORKS
FLEXIBLE USER
PROBLEM SETUP
PROBLEM FORMULATION
APPROXIMATION SOLUTIONS
1: Initialize
SPEEDY-GREEDY ALGORITHM
PIPAGE ROUNDING ALGORITHM
NUMERICAL RESULTS
SPEEDY-GREEDY ANALYSIS
CONCLUSION

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.