by Siu Wah Lau. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (p. 146-153). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web.

Liu Wing Chun. / Thesis submitted in: July 2003. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 55-57). / Abstracts in English and Chinese. / Acknowledgement --- p.I / Abstract --- p.II / 摘要 --- p.III / Chapter Chapter 1 --- Introduction --- p.1 / Chapter Chapter 2 --- Related Works --- p.5 / Chapter 2.1 --- Fixed-Segment Fixed-Bandwidth Schemes --- p.6 / Chapter 2.2 --- Variable-Segment Fixed-Bandwidth Schemes --- p.7 / Chapter 2.3 --- Fixed-Segment Variable-Bandwidth Schemes --- p.8 / Chapter 2.4 --- Variable-Segment Variable-Bandwidth Schemes --- p.9 / Chapter 2.5 --- Performance Bounds of Periodic Broadcastings --- p.10 / Chapter Chapter 3 --- Consonant Broadcasting --- p.12 / Chapter 3.1 --- Type-I Channels --- p.14 / Chapter 3.2 --- Type-II Channels --- p.15 / Chapter 3.3 --- Client Buffer --- p.17 / Chapter Chapter 4 --- Performance Evaluation --- p.19 / Chapter 4.1 --- Startup Latency versus Network Bandwidth --- p.20 / Chapter 4.2 --- Startup Latency versus Client Access Bandwidth --- p.22 / Chapter 4.3 --- Client Buffer Requirement --- p.24 / Chapter Chapter 5 --- Grouped Consonant Broadcasting --- p.25 / Chapter 5.1 --- Bandwidth Partitioning and Reception Schedule --- p.26 / Chapter 5.2 --- Client Buffer Requirement --- p.28 / Chapter 5.3 --- Performance Tradeoffs --- p.30 / Chapter Chapter 6 --- Implementation and Benchmarking --- p.34 / Chapter 6.1 --- Practical Issues --- p.35 / Chapter 6.2 --- Experimental Results --- p.36 / Chapter Chapter 7 --- Dynamic Consonant Broadcasting --- p.39 / Chapter 7.1 --- Virtual Transmission Schedules --- p.40 / Chapter 7.2 --- Dynamic Broadcasting Schedules --- p.42 / Chapter 7.3 --- Performance Evaluation --- p.44 / Chapter Chapter 8 --- Variable-bit-rate Video Streaming --- p.46 / Chapter 8.1 --- Transmission Schedules --- p.46 / Chapter 8.2 --- Playback Continuity --- p.48 / Chapter 8.3 --- Performance Evaluation --- p.50 / Chapter Chapter 9 --- Conclusions --- p.53 / Bibliography --- p.55

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 59-64). Also available in electronic version. Access restricted to campus users.

by Xiaoqing Wang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 43-45). / Abstracts in English and Chinese. / Acknowledgments --- p.ii / Abstract --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- The General Architecture of the VoD System and the Related Issues --- p.4 / Chapter 2.1 --- A Brief Description of VoD System --- p.4 / Chapter 2.2 --- Why Video Streams in VoD Service are VBR in Nature? --- p.6 / Chapter 2.3 --- The Video Storage Media in the VoD Systems --- p.8 / Chapter 2.4 --- The Data Placement Scheme in the VoD System --- p.9 / Chapter 2.5 --- An Overview of Disk Scheduling in VoD System --- p.10 / Chapter 2.6 --- The Admission Control in VoD System --- p.12 / Chapter 3 --- Our Admission Control Algorithm for VoD System --- p.14 / Chapter 3.1 --- QoS Requirements We Choose --- p.14 / Chapter 3.2 --- System Model --- p.15 / Chapter 3.3 --- The Admission Control for the Storage Sub-system --- p.19 / Chapter 3.4 --- The Admission Control for Network Sub-system --- p.21 / Chapter 3.4.1 --- Preliminaries --- p.22 / Chapter 3.4.2 --- The Admission Control Algorithm for Network Sub-system --- p.27 / Chapter 4 --- Experiment --- p.33 / Chapter 5 --- Conclusion and Future Work --- p.41 / Chapter 5.1 --- Conclusion --- p.41 / Chapter 5.2 --- Future Work --- p.42

Lee Chung Hing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 61-63). / Abstracts in English and Chinese. / Acknowledgements --- p.ii / Abstract --- p.iii / List of Figures --- p.vii / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Contributions of This Thesis --- p.3 / Chapter 1.2 --- Organizations of This Thesis --- p.3 / Chapter 1.3 --- Publication --- p.4 / Chapter 2. --- Overview of VoD Systems --- p.5 / Chapter 2.1 --- True VoD --- p.6 / Chapter 2.2 --- Near VoD --- p.7 / Chapter 2.3 --- Related Works --- p.9 / Chapter 2.3.1 --- Batching --- p.9 / Chapter 2.3.2 --- Patching --- p.11 / Chapter 2.3.3 --- Mcache --- p.11 / Chapter 2.3.4 --- Unified VoD --- p.12 / Chapter 2.4 --- Discussions --- p.15 / Chapter 3. --- Super-Scalar Architecture --- p.17 / Chapter 3.1 --- Transmission Scheduling --- p.20 / Chapter 3.2 --- Admission Control --- p.21 / Chapter 3.3 --- Channel Merging --- p.26 / Chapter 3.4 --- Interactive Control --- p.29 / Chapter 4. --- Performance Modeling --- p.31 / Chapter 4.1 --- Waiting Time for Statically-Admitted Clients --- p.32 / Chapter 4.2 --- Waiting Time for Dynamically-Admitted Clients --- p.33 / Chapter 4.3 --- Admission Threshold --- p.38 / Chapter 4.4 --- Channel Partitioning --- p.39 / Chapter 5. --- Performance Evaluation --- p.40 / Chapter 5.1 --- Model Validation --- p.40 / Chapter 5.2 --- Channel Partitioning --- p.42 / Chapter 5.3 --- Latency Comparisons --- p.44 / Chapter 5.4 --- Channel Requirement --- p.46 / Chapter 5.5 --- Performance at Light Loads --- p.47 / Chapter 5.6 --- Multiplexing Gain --- p.49 / Chapter 6. --- Implementation and Benchmarking --- p.51 / Chapter 6.1 --- Implementation Description --- p.51 / Chapter 6.2 --- Benchmarking --- p.53 / Chapter 6.2.1 --- Benchmarking Setup --- p.53 / Chapter 6.2.2 --- Benchmarking Result --- p.55 / Chapter 7. --- Conclusion --- p.56 / Appendix --- p.57 / Bibliography --- p.61

by Lee Yiu Bun. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (p. [185]-205). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web.

by Kelvin Kwok-wai Law. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 66-68). / Abstract --- p.i / Acknowledgments --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Motivation --- p.2 / Chapter 1.3 --- Scope --- p.3 / Chapter 1.4 --- Dissertation Outline --- p.4 / Chapter 2 --- Background and Related Researches --- p.6 / Chapter 2.1 --- Interactive Services --- p.6 / Chapter 2.2 --- VOD Architecture --- p.7 / Chapter 2.3 --- Video Compression --- p.10 / Chapter 2.3.1 --- DCT Based Compression --- p.11 / Chapter 2.3.2 --- Subband Video Compression --- p.12 / Chapter 2.4 --- Related Research --- p.14 / Chapter 3 --- Multiple Resolutions Video File System --- p.16 / Chapter 3.1 --- Physical Disk Storage System --- p.16 / Chapter 3.2 --- Multi-resolution Video Data Placement Scheme --- p.17 / Chapter 3.3 --- Example of our Video Block Assignment Algorithm --- p.23 / Chapter 3.4 --- An Assignment Algorithm for Homogeneous Video Files --- p.26 / Chapter 4 --- Disk Scheduling and Admission Control --- p.33 / Chapter 4.1 --- Disk Scheduling Algorithm --- p.33 / Chapter 4.2 --- Admission Control --- p.40 / Chapter 5 --- Load Balancing of the Disk System --- p.43 / Chapter 6 --- Buffer Management --- p.49 / Chapter 6.1 --- Buffer Organization --- p.49 / Chapter 6.2 --- Buffer Requirement For Different Video Playback Mode --- p.51 / Chapter 7 --- Conclusions --- p.63 / Bibliography --- p.66

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 132-137). Also available in electronic version. Access restricted to campus users.

Peer-to-peer (P2P) video streaming has become a very popular and cost-effective solution to provide video-on-demand (VoD) streaming service to a large group of Internet users. Recent advances of layered video coding are shown to be promising in addressing the problem of receiver heterogeneity in P2P streaming networks. The key idea is to encode a raw video into multiple non-overlapped layers. Peers in the network can enjoy different streaming qualities by subscribing to different number of layers according to their specific network bandwidth. In this thesis, a systematic and comprehensive study of layered P2P VoD streaming networks is conducted. We first investigate the overlay construction problem that concerns the strategy of forming a logical overlay network for peers to exchange data pieces. We propose a neighbor relationship management algorithm to maintain a stable yet diversified neighbor set to facilitate adding or dropping a video layer, i.e. layer adaptation. Subsequently, an incentive scheme is designed to differentiate neighbors’ contributions at different layers, and a peer is allowed to adjust its number of neighbors according to its average service response time. We then develop an efficient layer adaptation algorithm for adjusting the number of video layers a peer subscribes to. We use a sliding buffer window for video piece scheduling, and make use of the time difference between the playback point and the starting point of the sliding window to initiate the process of adding or dropping a layer. A probing period is also introduced to ensure the adding decision is indeed correct. We next focus on designing piece scheduling algorithm for video data exchange among peers. At each peer, a utility function for calculating the relative importance of each missing video data piece is designed. In piece scheduling, a peer prefers a piece with higher utility value. We show that our utility based piece scheduling algorithm yields better video quality than conventional approaches. Last but not least, we study the request peer selection problem for identifying the most suitable neighbor for a peer to make a piece request. Two algorithms are designed, smallest service response time first (SSF) and closest playback point first (CPF). SSF ensures peers with larger uplink bandwidths to serve more requests, and CPF encourages a newly joined peer to contribute its uplink bandwidth as quickly as possible. We show that there exists a sweet spot by properly combining the two together. Although our algorithms are presented sequentially in addressing each of the problems above, they do interact with each other. Throughout our study, a comprehensive packet-level simulator is used to closely examine and analyze such interactions. With that, our algorithms are judicially designed and fine-tuned for best performance. To the best of our knowledge, our in-house developed simulator is the most comprehensive packet-level simulator for layered P2P VoD streaming. / published_or_final_version / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

by Mary Y.Y. Leung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 64-66). / Abstract --- p.i / Acknowledgments --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Video-On-Demand Environment --- p.1 / Chapter 1.2 --- Problem Definition --- p.3 / Chapter 2 --- Related Work --- p.7 / Chapter 2.1 --- Data Sharing Techniques --- p.7 / Chapter 2.1.1 --- Batching --- p.7 / Chapter 2.1.2 --- Buffering --- p.9 / Chapter 2.1.3 --- Static Partitioning --- p.10 / Chapter 2.1.4 --- Adaptive Piggybacking --- p.10 / Chapter 2.2 --- Providing VCR Functionalities --- p.12 / Chapter 3 --- System Model --- p.15 / Chapter 3.1 --- Operations involved in VCR Control --- p.15 / Chapter 3.2 --- Normal Playback Model --- p.17 / Chapter 3.3 --- VCR Model --- p.18 / Chapter 4 --- Resource Allocation for Normal Playback --- p.21 / Chapter 4.1 --- Mathematical Model --- p.22 / Chapter 4.1.1 --- Hits occurring within the same partition (hit w) --- p.24 / Chapter 4.1.2 --- Jump to other partitions (hito) --- p.27 / Chapter 4.1.3 --- Fast-forwarding to the end of a movie --- p.30 / Chapter 4.1.4 --- The expected hit probability P(hit) --- p.31 / Chapter 4.2 --- Model Verification --- p.32 / Chapter 5 --- Resource Allocation for VCR mode --- p.35 / Chapter 5.1 --- Scheme 1: No merging --- p.36 / Chapter 5.2 --- Scheme 2: Merging by adaptive piggybacking and buffering --- p.36 / Chapter 5.2.1 --- Resuming within the threshold (Δ ≤ k) --- p.38 / Chapter 5.2.2 --- Resuming beyond the threshold (Δ > k) --- p.39 / Chapter 5.3 --- Verification --- p.42 / Chapter 6 --- Applications to System sizing --- p.45 / Chapter 6.1 --- Cost of Resources for Normal Playback --- p.46 / Chapter 6.2 --- Cost of Resources for VCR functions --- p.48 / Chapter 6.3 --- Overall system cost --- p.49 / Chapter 6.4 --- Comparison --- p.50 / Chapter 6.4.1 --- Scheme 1 vs. Scheme 2 --- p.51 / Chapter 6.4.2 --- Scheme 2 vs. pure I/O & pure buffer --- p.54 / Chapter 6.4.3 --- Different values of k --- p.58 / Chapter 6.4.4 --- Different values of ψ --- p.60 / Chapter 7 --- Conclusions --- p.62 / Bibliography --- p.64 / Chapter A --- Appendix --- p.67 / Chapter A.l --- Rewind --- p.67 / Chapter A.1.1 --- Hits occurring within the same partition (hit w) --- p.67 / Chapter A.1.2 --- Jump to other partitions (hit0) --- p.68 / Chapter A.2 --- Pause --- p.70