Journal
IET COMMUNICATIONS
Volume 13, Issue 17, Pages 2786-2796Publisher
INST ENGINEERING TECHNOLOGY-IET
DOI: 10.1049/iet-com.2018.6077
Keywords
trees (mathematics); cache storage; satellite communication; cooperative communication; telecommunication network topology; low deployment cost; distribution strategy; prolonged content access; on-board storage space; on-path caching distribution mechanism; file distribution; hybrid LEO constellation; on-path cache nodes; collaborative cached content placement strategy; intermediate caching nodes; cache distribution; space-terrestrial integrated networks; low earth orbit satellites; content distribution; time-varying topology; transmission overheads; popularity-aware back-tracing partition cooperative cache distribution; multiple region cooperative cache algorithm; LEO satellites; prolonged content access latency; back-tracing partition directed on-path caching distribution mechanism; BPDM; cross-timeslot graph; objective file fetching; minimum spanning tree algorithm; NCL node selection metric
Categories
Funding
- National Natural Science Foundation of China [61571156]
- National Science and Technology Major Project [91538110]
- Natural Science Foundation of Guangdong Province [2016A030313661]
Ask authors/readers for more resources
Space-terrestrial integrated networks consisting of low earth orbit (LEO) satellites and terrestrial users are widely developed for potentially diversified requirements of content distribution. With an obviously time-varying topology, however, designing a distribution strategy faces several explicit challenges, such as prolonged content access latency and significant transmission overheads, due to lack of contact opportunities and limited on-board storage space. In this study, therefore, a novel back-tracing partition directed on-path caching distribution mechanism (BPDM) is proposed for the file distribution in the hybrid LEO constellation and terrestrial network. In the proposed strategy, a group of feasible on-path cache nodes is iteratively selected by utilising a well-designed cross-timeslot graph, as well as a collaborative cached content placement strategy, called as multiple regions cooperative cache algorithm, by carefully considering diversified popularity of target files. As a result, the proposed BPDM could efficiently reduce redundant transmissions of content access for different users by fetching objective file mainly from limited quantities of intermediate caching nodes. Through the simulation results, the proposed method can obviously decrease the holistic overheads and access delay compared with the minimum spanning tree algorithm and Network Central Location (NCL) node selection metric.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available