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.

Hui-Hsiang Kao

dblp:92/8798 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 · 50% Internet architecture and protocols · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
network coding
0.112012
A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming · IEEE Trans. Parallel Distributed Syst. 2012
Content delivery and video streaming › video-on-demand
peer-to-peer video-on-demand
0.112012
A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming · IEEE Trans. Parallel Distributed Syst. 2012
Distributed systems
peer-to-peer systems
0.012012
A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming · IEEE Trans. Parallel Distributed Syst. 2012

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

performance analysis · 0.3network coding · 0.3
YearPublicationVenuePosition
2016 I2CC: Interleaving two-level cache with network coding in peer-to-peer VoD system
Hui-Hsiang Kao, Chung-Nan Lee, Yung-Cheng Kao, Peng-Jung Wu
J. Netw. Comput. Appl.1
2012 A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming
abstract
Although random access operations are desirable for on-demand video streaming in peer-to-peer systems, they are difficult to efficiently achieve due to the asynchronous interactive behaviors of users and the dynamic nature of peers. In this paper, we propose a network coding equivalent content distribution (NCECD) scheme to efficiently handle interactive video-on-demand (VoD) operations in peer-to-peer systems. In NCECD, videos are divided into segments that are then further divided into blocks. These blocks are encoded into independent blocks that are distributed to different peers for local storage. With NCECD, a new client only needs to connect to a sufficient number of parent peers to be able to view the whole video and rarely needs to find new parents when performing random access operations. In most existing methods, a new client must search for parent peers containing specific segments; however, NCECD uses the properties of network coding to cache equivalent content in peers, so that one can pick any parent without additional searches. Experimental results show that the proposed scheme achieves low startup and jump searching delays and requires fewer server resources. In addition, we present the analysis of system parameters to achieve reasonable block loss rates for the proposed scheme.
Yung-Cheng Kao, Chung-Nan Lee, Peng-Jung Wu, Hui-Hsiang Kao
IEEE Trans. Parallel Distributed Syst.4
2009 Eliminating Packet Loss Accumulation in Peer-to-Peer Streaming Systems
abstract
To eliminate packet loss accumulation and overcome bursty packet loss problems caused by peer departures in peer-to-peer (P2P) streaming systems, a multisource structure combining with a distributed forward error correction (FEC) scheme is proposed. In the proposed structure, each peer connects to multiple parents according to the prespecified FEC packets ensemble and each parent forwards partial streaming packets to the peer. If one or few parents fail, other parents can still provide remaining part of streaming packets that can be used to recover the missing packets by using packet level FEC scheme. Packet loss probability and packet loss accumulation from parent peers to child peers in tree-based P2P streaming systems are investigated. The analysis and NS2 simulation results show that packet loss probability is reduced and furthermore the packet loss accumulation can be eliminated when an appropriate FEC protection is used.
Peng-Jung Wu, Jenq-Neng Hwang, Chung-Nan Lee, Chii-Chang Gau, Hui-Hsiang Kao
IEEE Trans. Circuits Syst. Video Technol.5