Concerned with the surge of contentcentric applications,it is challenging to balance network traffic and cater to low-delay requirements.Hierarchical caching architecture of both edge network(EN)and core network(CN)em...Concerned with the surge of contentcentric applications,it is challenging to balance network traffic and cater to low-delay requirements.Hierarchical caching architecture of both edge network(EN)and core network(CN)emerges and leverages caching resources to reduce the delivery delay of contents.Most previous work takes an impractical assumption to treat the CN as a content provider,which neglects the collaboration by intermediate CN caches.Most importantly,it is still necessary to thoroughly study the tradeoff between CN delay and edge delay for files delivery so as to minimize the overall delivery delay across the network.In this paper,we consider a hierarchical caching network with distributed CN nodes and edge nodes,where cooperative transmission is enabled for edge nodes to transmit multi-files simultaneously.This poses a joint optimization problem of hierarchical file caching and fetching to minimize the overall delivery delay of requests.Since the problem is NP-hard,we decompose the original problem and design an iterative algorithm to address it.Numerical results validate that the proposed scheme can find a balanced solution between lowering edge delay by utilizing coordinated CN caching and lowering CN delay by solely relying on edge caching.展开更多
Reasonable allocation of storage and computing resources is the basis of building big data system.With the development of IoT(Internet of Things),more data will be brought.A three-layer architecture includes smart dev...Reasonable allocation of storage and computing resources is the basis of building big data system.With the development of IoT(Internet of Things),more data will be brought.A three-layer architecture includes smart devices layer,edge cloud layer and blockchain-based distributed cloud layer.Blockchain is used in IoT for building a distributed decentralize P2P architecture to deal with the secure issue while edge computing deals with increasing volume of data.Edge caching is one of the important application scenarios.In order to allocate edge cache resources reasonably,to improve the quality of service and to reduce the waste of bandwidth resources,this paper proposes a content selection algorithm of edge cache nodes.The algorithm adopts markov chain model,improves the utilization of cache space and reduces the content transmission delay.The hierarchical caching strategy is adopted and the secondary cache stores slides of contents to expand the coverage of cached content and to reduce user waiting time.Regional node cooperation is adopted to expand the cache space and to support the regional preference of cache content.Compared with the classical substitution algorithm,simulation results show that the algorithm in this paper has higher cache hit ratio and higher space utilization.展开更多
In order to alleviate capacity constraints on the fronthaul and decrease the transmit latency, a hierarchical content caching paradigm is applied in the fog radio access networks(F-RANs). In particular, a specific clu...In order to alleviate capacity constraints on the fronthaul and decrease the transmit latency, a hierarchical content caching paradigm is applied in the fog radio access networks(F-RANs). In particular, a specific cluster of remote radio heads is formed through a common centralized cloud at the baseband unit pool, while the local content is directly delivered at fog access points with edge cache and distributed radio signal processing capability. Focusing on a downlink F-RAN, the explicit expressions of ergodic rate for the hierarchical paradigm is derived. Meanwhile, both the waiting delay and latency ratio for users requiring a single content are exploited. According to the evaluation results of ergodic rate on waiting delay, the transmit latency can be effectively reduced through improving the capacity of both fronthaul and radio access links. Moreover, to fully explore the potential of hierarchical content caching, the transmit latency for users requiring multiple content objects is optimized as well in three content transmission cases with different radio access links. The simulation results verify the accuracy of the analysis, further show the latency decreases significantly due to the hierarchical paradigm.展开更多
基金supported by National Key R&D Program of China under grant No.2021YFB2900200China Postdoctoral Science Foundation under grant No.2022M713475。
文摘Concerned with the surge of contentcentric applications,it is challenging to balance network traffic and cater to low-delay requirements.Hierarchical caching architecture of both edge network(EN)and core network(CN)emerges and leverages caching resources to reduce the delivery delay of contents.Most previous work takes an impractical assumption to treat the CN as a content provider,which neglects the collaboration by intermediate CN caches.Most importantly,it is still necessary to thoroughly study the tradeoff between CN delay and edge delay for files delivery so as to minimize the overall delivery delay across the network.In this paper,we consider a hierarchical caching network with distributed CN nodes and edge nodes,where cooperative transmission is enabled for edge nodes to transmit multi-files simultaneously.This poses a joint optimization problem of hierarchical file caching and fetching to minimize the overall delivery delay of requests.Since the problem is NP-hard,we decompose the original problem and design an iterative algorithm to address it.Numerical results validate that the proposed scheme can find a balanced solution between lowering edge delay by utilizing coordinated CN caching and lowering CN delay by solely relying on edge caching.
文摘Reasonable allocation of storage and computing resources is the basis of building big data system.With the development of IoT(Internet of Things),more data will be brought.A three-layer architecture includes smart devices layer,edge cloud layer and blockchain-based distributed cloud layer.Blockchain is used in IoT for building a distributed decentralize P2P architecture to deal with the secure issue while edge computing deals with increasing volume of data.Edge caching is one of the important application scenarios.In order to allocate edge cache resources reasonably,to improve the quality of service and to reduce the waste of bandwidth resources,this paper proposes a content selection algorithm of edge cache nodes.The algorithm adopts markov chain model,improves the utilization of cache space and reduces the content transmission delay.The hierarchical caching strategy is adopted and the secondary cache stores slides of contents to expand the coverage of cached content and to reduce user waiting time.Regional node cooperation is adopted to expand the cache space and to support the regional preference of cache content.Compared with the classical substitution algorithm,simulation results show that the algorithm in this paper has higher cache hit ratio and higher space utilization.
基金supported in part by the National Natural Science Foundation of China (Grant No.61361166005)the State Major Science and Technology Special Projects (Grant No.2016ZX03001020006)the National Program for Support of Top-notch Young Professionals
文摘In order to alleviate capacity constraints on the fronthaul and decrease the transmit latency, a hierarchical content caching paradigm is applied in the fog radio access networks(F-RANs). In particular, a specific cluster of remote radio heads is formed through a common centralized cloud at the baseband unit pool, while the local content is directly delivered at fog access points with edge cache and distributed radio signal processing capability. Focusing on a downlink F-RAN, the explicit expressions of ergodic rate for the hierarchical paradigm is derived. Meanwhile, both the waiting delay and latency ratio for users requiring a single content are exploited. According to the evaluation results of ergodic rate on waiting delay, the transmit latency can be effectively reduced through improving the capacity of both fronthaul and radio access links. Moreover, to fully explore the potential of hierarchical content caching, the transmit latency for users requiring multiple content objects is optimized as well in three content transmission cases with different radio access links. The simulation results verify the accuracy of the analysis, further show the latency decreases significantly due to the hierarchical paradigm.