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

Huayong Fu

dblp:201/3716 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Computer networks · 1

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 · 50% Content delivery and video streaming · 25% Wireless networking · 25%
Computer graphics and multimedia
1 paper

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › game theory
game-theoretic networking
0.312018
Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP · IEEE Trans. Mob. Comput. 2018
Content delivery and video streaming › adaptive video streaming
HTTP adaptive streaming
0.312018
Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP · IEEE Trans. Mob. Comput. 2018
Network optimization and economics › game theory
non-cooperative game
0.312018
Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP · IEEE Trans. Mob. Comput. 2018
Wireless networking › link adaptation
rate adaptation
0.312018
Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP · IEEE Trans. Mob. Comput. 2018

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

nash equilibrium · 0.7distributed iterative algorithm · 0.7
YearPublicationVenuePosition
2018 Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP
abstract
Dynamic Adaptive Streaming over HTTP (DASH) has demonstrated to be an emerging and promising multimedia streaming technique, owing to its capability of dealing with the variability of networks. Rate adaptation mechanism, a challenging and open issue, plays an important role in DASH based systems since it affects Quality of Experience (QoE) of users, network utilization, etc. In this paper, based on non-cooperative game theory, we propose a novel algorithm to optimally allocate the limited export bandwidth of the server to multi-users to maximize their QoE with fairness guaranteed. The proposed algorithm is proxy-free. Specifically, a novel user QoE model is derived by taking a variety of factors into account, like the received video quality, the reference buffer length, and user accumulated buffer lengths, etc. Then, the bandwidth competing problem is formulated as a non-cooperation game with the existence of Nash Equilibrium that is theoretically proven. Finally, a distributed iterative algorithm with stability analysis is proposed to find the Nash Equilibrium. Compared with state-of-the-art methods, extensive experimental results in terms of both simulated and realistic networking scenarios demonstrate that the proposed algorithm can produce higher QoE, and the actual buffer lengths of all users keep nearly optimal states, i.e., moving around the reference buffer all the time. Besides, the proposed algorithm produces no playback interruption.
Hui Yuan 0001, Huayong Fu, Junhui Hou, Sam Kwong
IEEE Trans. Mob. Comput.2