Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuanlong Wan

dblp:368/7413 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0001-5160-7505ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Content delivery and video streaming · 61% Vehicular, aerial and satellite networks · 30% Edge and fog computing · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
caching
0.912025
Cooperative Caching Based on Popularity-Aware Block Partitioning in Space-Ground Integrated Networks · IEEE Trans. Commun. 2025
Content delivery and video streaming › caching › distributed caching
cooperative caching
0.912025
Cooperative Caching Based on Popularity-Aware Block Partitioning in Space-Ground Integrated Networks · IEEE Trans. Commun. 2025
Vehicular, aerial and satellite networks
satellite-terrestrial network
0.912025
Cooperative Caching Based on Popularity-Aware Block Partitioning in Space-Ground Integrated Networks · IEEE Trans. Commun. 2025
Edge and fog computing
edge caching
0.312025
Cooperative Caching Based on Popularity-Aware Block Partitioning in Space-Ground Integrated Networks · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

semidefinite relaxation · 0.9block partitioning · 0.9
YearPublicationVenuePosition
2025 Cooperative Caching Based on Popularity-Aware Block Partitioning in Space-Ground Integrated Networks
abstract
Space-Ground Integrated Networks (SGINs) hold the potential to enable seamless and high-quality global coverage in an economically viable manner. However, the limited bandwidth and relatively long delay of satellite-ground links pose significant challenges in meeting the increasing demands driven by surging traffic. To address this issue, we propose a three-tier cooperative caching architecture incorporating base stations (BSs), satellites, and a content server, which aims to reduce the average content retrieval delay through cooperative caching between BSs and satellites. The joint optimization problem among them is both challenging to solve and non-scalable due to its exponentially increasing computational complexity. Meanwhile, the geographic characteristics of requests are overlooked in existing work. As a consequence, we propose a novel block partitioning algorithm based on the popularity similarity across areas to facilitate cooperative caching, which reduces the computational complexity, and ensures the scalability and the effectiveness of cooperative caching. Based on the partitioned blocks, the optimization problem is decomposed into two subproblems: intra-block cooperative optimization among BSs and inter-block cooperative optimization among satellites, effectively catering to the characteristics of wide-area coverage in SGINs. For the subproblems with finite dimensions, Semidefinite Relaxation (SDR) based intra-block and inter-block cooperative caching approaches are proposed to obtain the optimal cooperative caching strategies. Extensive simulations demonstrate that, compared to directly solving the original problem, the proposed algorithm reduces the solving time from exponential to linear growth. Moreover, our algorithm outperforms existing schemes by reducing 13% average retrieval delay and improving 12% overall cache hit rate.
Yuanlong Wan, Yunpeng Hou, Huasen He, Shuangwu Chen, Xiaofeng Jiang, Jian Yang 0014
IEEE Trans. Commun.1