Yuan Xing

Dr. Yuan Xing

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2018 in IEEE Access
Verified
Journal Article
Open access
JDJie Duan
Jie Duan
RTRuilin Tian
Ruilin Tian
YXYuan Xing
Yuan Xing
YHYi Huang
Yi Huang
XCXiaojun Cao
Xiaojun Cao
GZGuofeng Zhao
Guofeng Zhao
As one of the most promising future networking architectures, Information-Centric Networking (ICN) takes the content as the first-class citizen. The content-oriented feature and in-network caching for ICN enable a novel economic model among Internet Service Provider (ISP), content provider (CP) and users. Current pricing researches in ICN usually focus on that users directly pay content price to CP, which will not increase the payoff of ISP, resulting in ISP’s reluctance to deploy ICN. Furthermore, existing works fail to consider the interaction between pricing strategy and user consumption behavior, which refers to that users will choose cheaper ISPs or give up requesting the content with high pricing. In order to design a flexible economic model to prompt the deployment of ICN, we first develop a content acquisition scheme combined with lump-sum and retail ways in ICN. Thereafter, given the price of access ICN, we propose a user consumption model to characterize user’s behavior for using the internet. Further, through formulating utility model for all ICN entities which include CP, access ICN and transit ICN, win-win pricing strategies for maximizing revenues of all entities are derived.We finally analyze and prove the utility of each entity in the proposed model. Numerical results show that utilities of ICNs in our model outperform corresponding utilities in Joint Caching and Pricing Strategies (JCPS) scheme.

8 February 2018 in IEEE Communications Letters
Verified
Journal Article
Closed access
JDJie Duan
Jie Duan
YXYuan Xing
Yuan Xing
RTRuilin Tian
Ruilin Tian
GZGuofeng Zhao
Guofeng Zhao
SZShuai Zeng
Shuai Zeng
CXChuan Xu
Chuan Xu
In conventional Content Delivery Networks (CDNs), where the Content Providers (CPs) are lack of the topology information, it is difficult for them to determine the content caching and pricing scheme. Furthermore, the small CPs cannot maintain their own cache servers as it is costly. To solve these problems, we propose a novel CDN architecture named Softwaredriven CDN (SCDN) by leveraging the benefit provided by the Software Defined Networks. In SCDN, the Infrastructure Provider (IP) hosts the cache servers at the back of the DSLAM, and it takes over the tasks to determine the content pricing and caching. By adopting a suitable revenue sharing scheme, SCDN achieves a win-win situation between IP and CPs. Simulation results show that with SCDN, the CPs can get about 25% more revenue than they can get in conventional CDNs.

20 February 2026 in Sensors
Verified
Journal Article
Open access
PDF file
YXYuan Xing
Yuan Xing
GZGuofeng Zhao
Guofeng Zhao
ZHZhenzhen Han
Zhenzhen Han
As an indispensable component of space–terrestrial integrated networks, low-Earth orbit (LEO) satellite networks are capable of providing flexible access and low delay communication services for emerging time-sensitive traffic. However, the inconsistent transmission rates between intra-satellite wired links and inter-satellite wireless links will undoubtedly result in unstable delay at the satellites. This disparity poses a challenge to ensuring deterministic communication for time-sensitive traffic. Aiming at this problem, we put forward an integrated scheduling algorithm based on matching game theory to concurrently determine the positions of wired and wireless time slots. First, we establish a theoretical model to quantify the influence of integrated scheduling on deterministic communication by elucidating the interrelationships among time-sensitive traffic, wired time slots, and wireless time slots. Second, drawing inspiration from scheduling sequences and matching game theory, the established integrated scheduling model is reformulated into a cyclic three-sided matching game model. Third, we design an integrated scheduling algorithm (ISA) to derive scheduling optimization solutions. Experimental results demonstrate that the proposed algorithm ISA outperforms existing scheduling algorithms, achieving an average delay reduction of 16.6% over all comparison algorithms.