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.

Shunfeng Chu

dblp:191/6568 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0001-8888-3255ORCID · corroborated

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

Computer networks · 3 · 1 first-author

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
Network optimization and economics · 61% Edge and fog computing · 30% Network performance modeling · 9%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › mechanism design
contract theory
0.412019
Contract-Based Small-Cell Caching for Data Disseminations in Ultra-Dense Cellular Networks · IEEE Trans. Mob. Comput. 2019
Network optimization and economics › mechanism design
incentive mechanism
0.412019
Contract-Based Small-Cell Caching for Data Disseminations in Ultra-Dense Cellular Networks · IEEE Trans. Mob. Comput. 2019
Edge and fog computing › edge caching
small-cell caching
0.412019
Contract-Based Small-Cell Caching for Data Disseminations in Ultra-Dense Cellular Networks · IEEE Trans. Mob. Comput. 2019
Network performance modeling
stochastic geometry modeling
0.112019
Contract-Based Small-Cell Caching for Data Disseminations in Ultra-Dense Cellular Networks · IEEE Trans. Mob. Comput. 2019

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

stochastic geometry · 0.4poisson point process · 0.4contract theory · 0.4
YearPublicationVenuePosition
2019 Contract-Based Small-Cell Caching for Data Disseminations in Ultra-Dense Cellular Networks
abstract
Evidence indicates that demands from mobile users (MU) on popular cloud content, e.g., video clips, account for a dramatic increase in data traffic over cellular networks. The repetitive downloading of hot content from cloud servers will inevitably bring a vast quantity of redundant data transmissions to networks. A strategy of distributively pre-storing popular cloud content in the memories of small-cell base stations (SBS), namely, small-cell caching, is an efficient technology for reducing the communication latency whilst mitigating the redundant data streaming substantially. In this paper, we establish a commercialized small-cell caching system consisting of a network service provider (NSP), several video providers (VP), and randomly distributed MUs. We conceive this system in the context of 5G cellular networks, where the SBSs are ultra-densely deployed with the intensity much higher than that of the MUs. In such a system, the NSP, in charge of the SBSs, wishes to lease these SBSs to the VPs for the purpose of making profits, whilst the VPs, after pushing popular videos into the rented SBSs, can provide faster local video transmissions to the MUs, thereby gaining more profits. Specifically, we first model the MUs and SBSs as two independent Poisson point processes, and develop, via stochastic geometry theory, the probability of the specific event that an MU obtains the video of its choice directly from the memory of an SBS. Then, with the help of the probability derived, we formulate the profits of both the NSP and the VPs. Next, we solve the profit maximization problem based on the framework of contract theory, where the NSP acts as a monopolist setting up the optimal contract according to the statistical information of the VPs. Incentive mechanisms are also designed to motivate each VP to choose a proper resource-price item offered by the NSP. Numerical results validate the effectiveness of our proposed contract framework for the commercial caching system.
Jun Li 0004, Shunfeng Chu, Feng Shu 0002, Jun Wu 0006, Dushantha N. K. Jayakody
IEEE Trans. Mob. Comput.2
2018 Mobile Edge Computing for Task Offloading in Small-Cell Networks via Belief Propagation
abstract
A large number of computation-hungry mobile applications have led to an ever-increasing computation demands. Mobile edge computing (MEC) has been considered as an emerging paradigm to alleviate the demand effectively by offloading the computationally intensive tasks from mobile devices (MD) to the adjacent MEC servers. It is expected that the quality of computation experience, e.g., the computing energy and the execution latency, can be greatly improved by the MEC. In this paper, we will investigate the computing task offloading problem via the MEC in the context of small-cell base-station (SBS) networks, where each SBS is equipped with an MEC server. Specifically, we first formulate the optimization problem to minimize the objective, i.e., the weighted sum of energy consumption and execution duration. The parameters to be optimized are the allocations of the MD's tasks to be offloaded to the MEC servers. Then we propose a novel belief propagation (BP) algorithm to optimize the task allocation in a distributed manner. Next, we develop the factor graph according to the network topology and decompose the object function into multiple local utilities to fit the factor graph. Finally, we transform local utilities into the estimations of marginal distributions and propose a distributed BP algorithm to solve the estimations. Simulations demonstrate that our BP algorithm can effectively approach the optimal solutions via exhaustive search.
Jun Li 0004, Anping Wu, Shunfeng Chu, Tingting Liu 0005, Feng Shu 0002
ICC3
2017 A Contract-Based Incentive Mechanism for Data Caching in Ultra-Dense Small-Cells Networks
abstract
Wireless caching is an efficient mechanism for reducing downloading delay and reducing the traffic pressure over backhual channels by caching some popular content, e.g., video clips, in small base stations (SBSs). In this paper, we consider a commercialized small-cell caching system consisting of a network service provider (NSP), several video retailers (VRs) and mobile users (MUs). The NSP leases its SBSs to VRs in order to earn profits, while the VRs store popular videos into the lent SBSs, thereby gaining profits from providing better services to the MUs. We conceive the system within the framework of contract theory by designing the optimal quality-price contract. We establish the profit function of NSP and VRs and solve the profit maximization problem through contract theory. Numerical results validate the effectiveness of our incentive mechanism for the system.
Shunfeng Chu, Jun Li 0004, Tingting Liu 0005, Feng Shu 0002
WCNC1