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

Chi-He Chang

dblp:69/10710 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
—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
Content delivery and video streaming · 70% Wireless networking · 30%

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

TopicWeightPapersLastEvidence papers
Wireless networking › scheduling
channel scheduling
0.012002
A recursive frequency-splitting scheme for broadcasting hot videos in VOD service · IEEE Trans. Commun. 2002
Content delivery and video streaming
video broadcasting
0.012002
A recursive frequency-splitting scheme for broadcasting hot videos in VOD service · IEEE Trans. Commun. 2002
Content delivery and video streaming
video-on-demand
0.012002
A recursive frequency-splitting scheme for broadcasting hot videos in VOD service · IEEE Trans. Commun. 2002

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

recursive frequency splitting · 0.0
YearPublicationVenuePosition
2017 Content Delivery Based on Popularity and Time Slot
abstract
Video-on-demand (VoD) service has become the important service in Internet Protocol Television (IPTV) based on Content-delivery-network (CDN). There has been a large amount of media in recently years. Combined with growing users, how to quickly address the video requests from users with low delay is important for industry. In other words, to allocate resource (i.e. media) appropriately according to different situations is critical. This paper proposes strategies which make video replica and put it nearby users (set-up boxes) previously. The proposed strategies not only consider the popularity of the media but also consider its hot time, i.e. the time slots which most of the users access it. The experiment result shows that with the proposed strategies, user requests can be quickly addressed and the overall network traffic load can be reduced.
Min-Chun Huang, Chi-He Chang, Chao-Wei Tseng, Ru-Jen Lee
PDCAT2
2002 A recursive frequency-splitting scheme for broadcasting hot videos in VOD service
abstract
One way to broadcast a popular/hot video is to let multiple users share a few channels. The stress on the scarce channels can be alleviated without sacrificing viewer waiting time. One common approach is to partition the video into fixed-length segments, which are broadcast on several channels periodically. Two representative approaches are the fast broadcasting scheme and the PAGODA scheme, which can broadcast a video using k channels by having new viewers wait no longer than /spl Theta/(D/2/sup k/) and /spl Theta/(D/5/sup k/2/) time, respectively, where D is the length of the video. In this paper, we propose a new scheme, called recursive frequency splitting (RFS), that significantly improves on existing schemes in terms of viewer waiting time. Some lower bounds on the viewers' waiting time are also developed.
Yu-Chee Tseng, Ming-Hour Yang, Chi-He Chang
IEEE Trans. Commun.3