Paper Info
Title
Distributed Caching Mechanism for Popular Services Distribution in Converged Overlay Networks
Abstract
With the proliferation of portable devices, the exponential growth of the global mobile traffic brings great challenges to the traditional communication networks and the traditional wireless communication technologies. In this context, converged networks and cache-based data offloading have drawn more and more attention based on the strong correlation of services. This paper proposes a novel popular services pushing and caching scheme by using converged overlay networks. The most popular services are pushed by terrestrial broadcasting networks. And they are cached in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">${n}$ </tex-math></inline-formula> router-nodes with limited cache sizes. Each router-node only interconnects with its neighbor nodes. Users are served through the router’s WiFi link. If the services requested are cached in the routers, the user can be immediately responded; otherwise, the requests can be responded through the link from cellular stations to the router. In the proposed scheme, the cache size of the router, the maximum number of requests each router can serve, and the whole-time delay are limited. Three node-selecting and dynamic programming algorithms are adopted to maximize the equivalent throughput. Analytical and numerical results demonstrate that the proposed scheme is very effective.
Year
DOI
Venue
2020
10.1109/TBC.2019.2902818
IEEE Transactions on Broadcasting
Keywords
DocType
Volume
Wireless fidelity,Wireless communication,Overlay networks,Heuristic algorithms,Broadcasting,Cellular networks,Relays
Journal
66
Issue
ISSN
Citations 
1
0018-9316
2
PageRank 
References 
Authors
0.37
0
6
Name
Order
Citations
PageRank
Wei Zhang114312.84
Jian Xiong24512.96
Lin Gui316924.46
Bo Liu415322.86
Meikang Qiu53722246.98
Zhiping Shi616843.86