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-Ming Hsieh

dblp:93/4469 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 2

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
2 papers
Content delivery and video streaming · 73% Wireless networking · 27%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
video broadcasting
0.122001
Data broadcasting and seamless channel transition for highly demanded videos · IEEE Trans. Commun. 2001
Data Broadcasting and Seamless Channel Transition for Highly-Demanded Videos · INFOCOM 2000
Content delivery and video streaming
video-on-demand
0.022001
Data broadcasting and seamless channel transition for highly demanded videos · IEEE Trans. Commun. 2001
Data Broadcasting and Seamless Channel Transition for Highly-Demanded Videos · INFOCOM 2000
Wireless networking
channel assignment
0.022001
Data Broadcasting and Seamless Channel Transition for Highly-Demanded Videos · INFOCOM 2000
Data broadcasting and seamless channel transition for highly demanded videos · IEEE Trans. Commun. 2001

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

fast broadcasting scheme · 0.0simulation · 0.0broadcasting scheme design · 0.0
YearPublicationVenuePosition
2001 Data broadcasting and seamless channel transition for highly demanded videos
abstract
One way to broadcast a popular video is to use a number of dedicated channels, each responsible for broadcasting some portion of the video periodically in a predefined way. The stress on the channels can be alleviated, and new viewers do not have to wait long to start their playback. Many approaches falling in this category have been proposed. One such scheme that interests us is the fast broadcasting (FB) scheme, which can broadcast a video using k channels by incurring at most O(D/2/sup k/) waiting time on new-coming viewers, where D is the length of the video. We consider a set of videos, each being broadcast by the FB scheme. Since the demand levels on these videos may change with time, it is sometimes inevitable to change the numbers of channels assigned to some videos. We propose a novel seamless channel transition enhancement on top of the FB scheme to dynamically change the number of channels assigned to a video on-the-fly. Clients currently viewing this video will not experience any disruption because of the transition. A channel allocation scheme is also proposed based on the arrival rates of videos to minimize the average waiting experienced by all viewers. From the system manager's point of view, the enhancement will make the FB scheme more attractive.
Yu-Chee Tseng, Ming-Hour Yang, Chi-Ming Hsieh, Wen-Hwa Liao, Jang-Ping Sheu
IEEE Trans. Commun.3
2000 Data Broadcasting and Seamless Channel Transition for Highly-Demanded Videos
abstract
One way to broadcast a popular video is to let multiple users share fewer channels. The stress on channel demand can be alleviated without sacrificing viewers' waiting time. One such scheme that interests us is the fast broadcasting (FB) scheme (Juhn et al., 1997, 1998), which can broadcast a popular video using k channels without keeping newcoming viewers waiting for more than O(D/2/sup k/) time, where D is the length of the video. In this paper, we propose two enhancements to the FB scheme. First, since the level of demand on a video may change by time, we show how to dynamically change the number of channels assigned to the video and seamlessly perform this transition. Clients currently viewing this video will not experience any disruption during the transition. Second, given a set of channels and a set of popular videos, we propose a scheme to assign these channels to the videos such that the average viewers' waiting time is minimal. From the system manager's point of view, these enhancements will make the FB scheme more attractive.
Yu-Chee Tseng, Chi-Ming Hsieh, Ming-Hour Yang, Wen-Hwa Liao, Jang-Ping Sheu
INFOCOM2