W.-P. Ken Yiu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
W.-P. Ken Yiu has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Shueng-Han Gary Chan
The Hong Kong University of Science and Technology, Hong Kong, Hong Kong
2 shared publications - Xing Jin
Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
2 shared publications
Latest Publications
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15503607) , 55-60
Distributed Storage to Support User Interactivity in Peer-to-Peer Video Streaming
Providing random access function in peer-to-peer on-demand video streaming is a challenging task, due to not only the asynchronous user interactivity but also the unpredictability of group dynamics. In this paper, we propose VMesh, a distributed peer-to-peer video-on-demand (VoD) streaming scheme which efficiently supports random seeking functionality. In VMesh, videos are divided into segments and stored in peers in a distributed manner. An overlay mesh is built upon peers to support jumping forward/backward, pause and restart during playback. Our scheme utilizes the large total storage capacity of peers to improve the segment supply so as to support interactive commands in a scalable manner. Through simulation, we show that our system outperforms a recent work, P2VoD. VMesh also has low segment missing rate under random member join/leave. In addition, the system achieves low joining and seeking latencies which are crucial requirements in an interactive VoD system.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15503607) , 55-60
Distributed Storage to Support User Interactivity in Peer-to-Peer Video Streaming
Providing random access function in peer-to-peer on-demand video streaming is a challenging task, due to not only the asynchronous user interactivity but also the unpredictability of group dynamics. In this paper, we propose VMesh, a distributed peer-to-peer video-on-demand (VoD) streaming scheme which efficiently supports random seeking functionality. In VMesh, videos are divided into segments and stored in peers in a distributed manner. An overlay mesh is built upon peers to support jumping forward/backward, pause and restart during playback. Our scheme utilizes the large total storage capacity of peers to improve the segment supply so as to support interactive commands in a scalable manner. Through simulation, we show that our system outperforms a recent work, P2VoD. VMesh also has low segment missing rate under random member join/leave. In addition, the system achieves low joining and seeking latencies which are crucial requirements in an interactive VoD system.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15503607) , 42-47
Supporting Multiple-Keyword Search in A Hybrid Structured Peer-to-Peer Network
Most existing techniques for keyword search in structured peer-to-peer (P2P) networks only support single-keyword exact-match lookups. In practice, however, users often have fuzzy information for identifying these items and tend to submit broad queries. The support of searching based on multiple keywords is hence desirable. In multiple-keyword search, a data item is associated with multiple keywords for storage. A query may also contain multiple keywords. The search result for a query should include all the data items whose storage keywords contain all the query keywords. Traditional DHT-based approaches achieve this by storing a data item (or its index) multiple times, each time with one of its keywords. A query is processed by searching each of the query keywords once. Therefore, the storage cost and search cost are both linear wit the number of keywords. Clearly, it is not efficient in case of a large number of keywords. In this paper, we propose a hybrid structured network called MKey to address this problem. Its backbone is a structured network. Each node in the backbone is also the leader of a cluster formed by non-backbone nodes. Within a cluster, nodes form an unstructured network and cooperate to store data and answer queries. When inserting a data item, multiple copies of its index are stored in a few different clusters. A query is also mapped to multiple clusters, and a flooding search within these clusters is performed. The union of all the search results are returned to users as the final result.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15503607) , 42-47
Supporting Multiple-Keyword Search in A Hybrid Structured Peer-to-Peer Network
Most existing techniques for keyword search in structured peer-to-peer (P2P) networks only support single-keyword exact-match lookups. In practice, however, users often have fuzzy information for identifying these items and tend to submit broad queries. The support of searching based on multiple keywords is hence desirable. In multiple-keyword search, a data item is associated with multiple keywords for storage. A query may also contain multiple keywords. The search result for a query should include all the data items whose storage keywords contain all the query keywords. Traditional DHT-based approaches achieve this by storing a data item (or its index) multiple times, each time with one of its keywords. A query is processed by searching each of the query keywords once. Therefore, the storage cost and search cost are both linear wit the number of keywords. Clearly, it is not efficient in case of a large number of keywords. In this paper, we propose a hybrid structured network called MKey to address this problem. Its backbone is a structured network. Each node in the backbone is also the leader of a cluster formed by non-backbone nodes. Within a cluster, nodes form an unstructured network and cooperate to store data and answer queries. When inserting a data item, multiple copies of its index are stored in a few different clusters. A query is also mapped to multiple clusters, and a flooding search within these clusters is performed. The union of all the search results are returned to users as the final result.