No description available.

Hui Ying Kin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 62-64). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.10 / Chapter 1.1 --- Motivation --- p.10 / Chapter 1.2 --- P2P small-world solution --- p.11 / Chapter 1.3 --- Balance of this thesis --- p.12 / Chapter 2 --- Background --- p.13 / Chapter 2.1 --- Small World phenomenon --- p.13 / Chapter 2.2 --- Internet Flash Crowds --- p.16 / Chapter 2.3 --- Dynamics in the small world network --- p.17 / Chapter 3 --- Small-world Overlay Protocol --- p.19 / Chapter 3.1 --- Overview --- p.23 / Chapter 3.2 --- Join Cluster Protocol (JCP): --- p.25 / Chapter 3.3 --- Leave Cluster Protocol (LCP): --- p.29 / Chapter 3.4 --- Object Lookup Protocol (OLP): --- p.31 / Chapter 3.5 --- Experimental Results Of Comparing with Other Structured P2P Networks --- p.33 / Chapter 3.5.1 --- Performance of object lookup: --- p.33 / Chapter 3.5.2 --- Effect of object lookup performance under different net- work sizes and number of long links: --- p.34 / Chapter 3.5.3 --- Comparison of Clustering Coefficient: --- p.35 / Chapter 4 --- Protocols for Handling Flash Crowd --- p.39 / Chapter 4.1 --- Static Flash Crowd --- p.40 / Chapter 4.2 --- Dynamic Flash Crowd --- p.44 / Chapter 4.3 --- Experimental Results for Replicating Popular Object --- p.45 / Chapter 4.3.1 --- Comparison between Chord and SWOP --- p.46 / Chapter 4.3.2 --- Comparison on Queue Size --- p.48 / Chapter 4.3.3 --- Variation on object request rate --- p.49 / Chapter 4.3.4 --- Variation on Number of Long Link Neighbors (k) --- p.50 / Chapter 4.4 --- Experiment Results for Examining the Effects on Traffic Loadings --- p.51 / Chapter 5 --- Performance Analysis --- p.53 / Chapter 5.1 --- Lookup complexity of SWOP --- p.53 / Chapter 5.2 --- Average time used for replicating item to all clusters in SWOP --- p.56 / Chapter 6 --- Related Work --- p.59 / Chapter 7 --- Conclusion --- p.61

Wong Kar Yiu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 109-111). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgement --- p.iv / Table of Contents --- p.v / List of Figure --- p.vii / Chapter Chapter 1. --- Introduction --- p.9 / Chapter 1.1 --- Introduction --- p.9 / Chapter 1.2 --- Background --- p.11 / Chapter 1.3 --- Ant Colony Optimization (ACO) --- p.15 / Chapter 1.4 --- Main contribution --- p.16 / Chapter 1.5 --- Thesis organization --- p.18 / Chapter Chapter 2. --- Related Work --- p.19 / Chapter 2.1 --- Multicast routing in general --- p.19 / Chapter 2.2 --- Multicast routing techniques --- p.22 / Chapter 2.3 --- Best-effort multicast routing --- p.25 / Chapter 2.4 --- Quality-of-Service (QoS) multicast routing --- p.30 / Chapter 2.5 --- Adaptive multicast routing --- p.34 / Chapter Chapter 3. --- Load-Sensitive Multicast Routing Protocol (LSMRP) --- p.37 / Chapter 3.1 --- Overview --- p.37 / Chapter 3.2 --- Problem Formulation --- p.37 / Chapter 3.3 --- Types of ant in LSMRP --- p.39 / Chapter 3.3.1 --- Forward Ants --- p.39 / Chapter 3.3.2 --- Random Ants --- p.41 / Chapter 3.3.3 --- Backward Ants --- p.42 / Chapter 3.3.4 --- Multicast Ants --- p.44 / Chapter 3.3.5 --- Multicast Backward Ants --- p.44 / Chapter 3.4 --- Global Algorithm --- p.47 / Chapter 3.4.1 --- Pheromone trails stage --- p.50 / Chapter 3.4.2 --- Multicast tree stage --- p.53 / Chapter 3.4.3 --- Routing table --- p.56 / Chapter 3.4.4 --- Messages Exchange and Mechanisms --- p.57 / Chapter 3.4.5 --- mapping --- p.58 / Chapter 3.4.6 --- Members join --- p.59 / Chapter 3.4.7 --- Members update --- p.59 / Chapter 3.4.8 --- Members leave --- p.61 / Chapter Chapter 4. --- Analysis of LSMRP --- p.63 / Chapter 4.1 --- Analysis of pheromone trail values --- p.63 / Chapter Chapter 5. --- Evaluation and Experimental Results --- p.80 / Chapter 5.1 --- System model --- p.80 / Chapter 5.2 --- Result --- p.84 / Chapter 5.2.1 --- Packets received --- p.84 / Chapter 5.2.2 --- Throughput --- p.86 / Chapter 5.2.3 --- Packet Loss --- p.98 / Chapter Chapter 6. --- Conclusion --- p.107 / Chapter 6.1 --- Future work/ open question --- p.107 / References --- p.109

Kong Chun Wai. / Thesis submitted in: July 2003. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 53-54). / Abstracts in English and Chinese. / Contents / acknowledgement --- p.I / Abstract --- p.II / 摘要 --- p.III / Chapter Chapter 1 --- Introduction --- p.1 / Chapter Chapter 2 --- Related Works --- p.4 / Chapter 2.1 --- Previous Work --- p.4 / Chapter 2.2 --- Comparison --- p.5 / Chapter Chapter 3 --- System Architecture --- p.7 / Chapter 3.1 --- Transmission Scheduling --- p.7 / Chapter 3.2 --- Admission Control --- p.9 / Chapter 3.3 --- Challenges in Supporting VBR-encoded Video --- p.10 / Chapter Chapter 4 --- Priority Scheduling --- p.12 / Chapter 4.1 --- Static Channel Priority (SCP) --- p.13 / Chapter 4.2 --- Dynamic Channel Priority (DCP) --- p.16 / Chapter Chapter 5 --- Turbo-Slice-and-Patch --- p.19 / Chapter 5.1 --- Video Pre-processing --- p.19 / Chapter 5.2 --- Bandwidth Allocation --- p.22 / Chapter 5.3 --- Three-Phase Patching --- p.23 / Chapter 5.4 --- Client Buffer Requirement --- p.27 / Chapter Chapter 6 --- Playback Continuity --- p.30 / Chapter Chapter 7 --- Performance Evaluation --- p.39 / Chapter 7.1 --- Average Latency --- p.40 / Chapter 7.2 --- Client Buffer Requirement --- p.43 / Chapter 7.3 --- Choice of Parameter Rcut --- p.44 / Chapter 7.4 --- Latency versus Arrival Rate --- p.46 / Chapter 7.5 --- Server Bandwidth Comparison --- p.48 / Chapter 7.6 --- Bandwidth Partitioning --- p.50 / Chapter Chapter 8 --- Conclusions --- p.52 / Bibliography --- p.53

Ngai Chi Kin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 57-59). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Linear Network Coding --- p.12 / Chapter 3 --- Combination Networks --- p.16 / Chapter 4 --- Multi-Source Multicast Networks --- p.31 / Chapter 5 --- Multi-source Network Coding with two sinks --- p.42 / Chapter 6 --- Conclusion --- p.55 / Bibliography --- p.59

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

Wong Ying Wai. / Thesis submitted in: December 2003. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 64-66). / Abstracts in English and Chinese. / Acknowledgement --- p.I / Abstract --- p.II / 摘要 --- p.III / Chapter Part I - --- Recursive Patching --- p.1 / Chapter Chapter 1 --- Introduction --- p.2 / Chapter Chapter 2 --- Transition Patching --- p.5 / Chapter Chapter 3 --- Recursive Patching --- p.9 / Chapter Chapter 4 --- Stream Assignment --- p.12 / Chapter 4.1 --- The Equal-Split Stream Assignment Scheme --- p.12 / Chapter 4.2 --- A Hierarchical Equal-Split Stream Assignment Scheme --- p.14 / Chapter Chapter 5 --- Performance Evaluation --- p.16 / Chapter Chapter 6 --- Conclusion --- p.18 / Bibliography --- p.19 / Chapter Part II - --- Interactive Multicast Video Streaming --- p.21 / Chapter Chapter 1 --- Introduction --- p.22 / Chapter Chapter 2 --- Background --- p.25 / Chapter 2.1 --- Multicast Streaming Algorithms --- p.25 / Chapter 2.2 --- Interactive Playback Support --- p.30 / Chapter Chapter 3 --- Interactive Multicast Streaming --- p.34 / Chapter 3.1 --- Interactivity Model --- p.34 / Chapter 3.2 --- Request Scheduling --- p.36 / Chapter 3.3 --- Client Buffer Management --- p.37 / Chapter 3.4 --- Performance Impact --- p.39 / Chapter Chapter 4 --- Static Full Stream Scheduling --- p.45 / Chapter Chapter 5 --- Adaptive Full Stream Scheduling --- p.48 / Chapter Chapter 6 --- Performance Evaluation --- p.52 / Chapter 6.1 --- Optimization of the Full Stream Threshold --- p.52 / Chapter 6.2 --- Latencies Comparisons --- p.57 / Chapter 6.3 --- Effect of Client Buffer Constraint --- p.58 / Chapter 6.4 --- Just-in-Time Simulation --- p.60 / Chapter Chapter 7 --- Conclusion --- p.63 / Bibliography --- p.64

Ma Tianbai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 49-51). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Incentive P2P System Overview --- p.6 / Chapter 3 --- Resource Distribution Mechanism --- p.11 / Chapter 4 --- Resource Competition Game --- p.22 / Chapter 4.1 --- Theoretical Competition Game --- p.22 / Chapter 4.2 --- Practical Competition Game Protocol --- p.26 / Chapter 5 --- Generalized Mechanism and Game --- p.33 / Chapter 5.1 --- Generalized Mechanism with Incentive --- p.33 / Chapter 5.2 --- Generalized Mechanism with Utility --- p.35 / Chapter 6 --- Experiments --- p.38 / Chapter 7 --- Conclusion --- p.48

Lin Wing Kai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 90-96). / Abstracts in English and Chinese. / Abstract/ 摘要 --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- """We are not alone""" --- p.1 / Chapter 1.2 --- Definition of P2P systems --- p.3 / Chapter 1.2.1 --- Terminologies --- p.4 / Chapter 1.2.2 --- Principles --- p.5 / Chapter 1.3 --- From sharing to replication --- p.7 / Chapter 1.3.1 --- Replication: why and how --- p.7 / Chapter 1.3.2 --- Advantages of P2P replication systems --- p.8 / Chapter 1.3.3 --- Typical replication approaches --- p.10 / Chapter 1.3.4 --- Difficulties in replication: resource allocation and replication strategy --- p.10 / Chapter 1.3.5 --- Why do peers cooperate? --- p.12 / Chapter 1.4 --- Contribution of this thesis --- p.13 / Chapter 1.4.1 --- Thesis organization --- p.13 / Chapter 2 --- Background Study --- p.15 / Chapter 2.1 --- Introduction --- p.15 / Chapter 2.2 --- Overview of P2P systems --- p.16 / Chapter 2.2.1 --- The original story --- p.16 / Chapter 2.2.2 --- Switching to decentralization --- p.16 / Chapter 2.2.3 --- Peer availability --- p.17 / Chapter 2.2.4 --- Other than file sharing --- p.18 / Chapter 2.3 --- Understanding replication --- p.20 / Chapter 2.3.1 --- File availability redefined --- p.20 / Chapter 2.3.2 --- Storage requirement analysis --- p.21 / Chapter 2.3.3 --- MTTF analysis --- p.22 / Chapter 2.3.4 --- Replica placement --- p.24 / Chapter 2.3.5 --- Other performance enhancement schemes --- p.27 / Chapter 2.4 --- Understanding cooperation --- p.28 / Chapter 2.5 --- Discussions --- p.30 / Chapter 3 --- Performance of erasure code replication --- p.32 / Chapter 3.1 --- Introduction --- p.32 / Chapter 3.2 --- Parameters definition --- p.33 / Chapter 3.2.1 --- File availability: whole file replication --- p.33 / Chapter 3.2.2 --- File availability: erasure code replication --- p.34 / Chapter 3.2.3 --- Properties of erasure code replication --- p.35 / Chapter 3.2.4 --- Effects of replication parameters --- p.36 / Chapter 3.2.5 --- Optimal value of b --- p.39 / Chapter 3.2.6 --- Analytical derivation --- p.40 / Chapter 3.3 --- Some practical considerations --- p.42 / Chapter 3.3.1 --- Cost of erasure code replication --- p.42 / Chapter 3.3.2 --- Sensitivity analysis --- p.44 / Chapter 3.4 --- Concluding remarks --- p.45 / Chapter 4 --- Distributed replication strategies --- p.48 / Chapter 4.1 --- Introduction --- p.48 / Chapter 4.2 --- The P2P replication system --- p.50 / Chapter 4.2.1 --- Erasure code replication --- p.50 / Chapter 4.2.2 --- Peers modelling --- p.51 / Chapter 4.2.3 --- Resource allocation problem --- p.52 / Chapter 4.2.4 --- Replication goal --- p.54 / Chapter 4.3 --- Decentralized adaptation --- p.56 / Chapter 4.3.1 --- Neighbour discovery and parameters exchange --- p.56 / Chapter 4.3.2 --- Storage resource estimation --- p.57 / Chapter 4.4 --- Heuristic strategies --- p.58 / Chapter 4.4.1 --- Random strategy --- p.58 / Chapter 4.4.2 --- Group partition strategy --- p.59 / Chapter 4.4.3 --- Highest available first (HAF) strategy --- p.61 / Chapter 4.5 --- Case studies --- p.65 / Chapter 4.5.1 --- Simulation results --- p.66 / Chapter 4.6 --- Concluding remarks --- p.69 / Chapter 5 --- Before cooperation: why do peers join? --- p.72 / Chapter 5.1 --- Introduction --- p.72 / Chapter 5.2 --- Information sharing club (ISC) model --- p.73 / Chapter 5.3 --- An example: music information sharing club --- p.75 / Chapter 5.4 --- Necessary condition for ISC to grow --- p.76 / Chapter 5.4.1 --- Music information sharing club example with simple requests --- p.78 / Chapter 5.5 --- Concluding remarks --- p.81 / Chapter 6 --- Conclusion --- p.83 / Chapter A --- Proof in this thesis --- p.86 / Bibliography --- p.90

Clock skew caused by variation is one of the most important problems in clock network synthesis today. Even if a clock network is designed to have zero skew, variation such as capacitive load and power supply will cause differences in arrival time of a clock signal. Non-tree clock network is considered to be an effective way to address the skew variation problem. Due to its inherent redundancy, clock mesh is very tolerant to variation. However, it costs much excessive amount of power compared to a clock tree. Link based non-tree clock network is an economic way to reduce clock skew caused by variation. Instead of using a dense mesh, only a number of links are inserted into a tree, so the power increase is small. Several existing works focus on the effect of cross link as well as the construction of such cross link structure. However, it is still not very clear where cross links should be inserted to achieve the most clock skew reduction with small wire resources. In this thesis, we propose a new method using linear program to solve this problem. In our approach, clock skew in a non-tree clock network is computed using an idea of load redistribution and non-tree decomposition. The delay information obtained is then used to select the node pairs for cross link insertion. Our methodology tries to insert cross links where skew can be reduced most effectively. Our method also considers tradeoff between cross link length and skew reduction effect. We compare our result with the most similar work on this problem [1] and a recent work [4] which inserts links between internal nodes of a tree. Experiments show that our method can reduce skew under variation effectively. We achieve 28% clock skew reduction with only 40% link resources. / Qian, Fuqiang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 51-55). / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Clock Distribution Network --- p.1 / Chapter 1.2 --- Our Contributions --- p.6 / Chapter 1.3 --- Organization of the Thesis --- p.8 / Chapter 2 --- Literature Review --- p.9 / Chapter 2.1 --- Exact Zero Skew --- p.9 / Chapter 2.2 --- DME Algorithm --- p.11 / Chapter 2.3 --- Combinatorial Algorithms for Fast Clock Mesh Optimization --- p.12 / Chapter 2.4 --- MeshWorks: An Efficient Framework for Planning, Synthesis and Optimization of Clock Mesh Networks --- p.14 / Chapter 2.5 --- Reducing Clock Skew variability via Cross Links --- p.16 / Chapter 2.6 --- Statistical Based Link Insertion for Robust Clock Network Design --- p.18 / Chapter 2.7 --- Variation Tolerant Buffered Clock Network Synthesis with Cross Links --- p.20 / Chapter 2.8 --- Cross Link Insertion for Improving Tolerance to Variations in Clock Network Synthesis --- p.22 / Chapter 3 --- Clock Network Construction with Cross Links --- p.24 / Chapter 3.1 --- Signal Delay and Clock Skew in Non-tree Clock Network --- p.24 / Chapter 3.1.1 --- Computing Delay in Non-tree Network --- p.25 / Chapter 3.1.2 --- Effect of a Cross Link on Clock Skew --- p.27 / Chapter 3.2 --- Link Insertion for Non-tree Clock Network --- p.28 / Chapter 3.2.1 --- Motivation of Computing Delay for Link Insertion --- p.29 / Chapter 3.2.2 --- Overall Flow for Cross Link Insertion --- p.30 / Chapter 3.2.3 --- Linear Program for Selecting Node Pairs --- p.31 / Chapter 3.2.4 --- Reducing the Number of Optimizations --- p.35 / Chapter 3.2.5 --- Experimental Results --- p.37 / Chapter 4 --- Buffered Clock Network with Cross Links --- p.41 / Chapter 4.1 --- Link Insertion in Buffered Clock Network --- p.41 / Chapter 4.1.1 --- Delay Calculation in Buffered Clock Network --- p.42 / Chapter 4.1.2 --- Linear Program Formulation for Buffered Clock Network --- p.43 / Chapter 4.2 --- Experimental Results and Comparison --- p.44 / Chapter 4.3 --- Possible Extensions --- p.46 / Chapter 4.3.1 --- Link Insertion at Internal Nodes --- p.46 / Chapter 4.3.2 --- Modeling Clock Buffer Delay Variation --- p.47 / Chapter 5 --- Conclusion --- p.49 / Bibliography --- p.51