by Soung-Yue Liew. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 55-57). / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- The Basic Principles of Routing Algorithms --- p.10 / Chapter 2.1 --- The principles of sequential algorithms --- p.11 / Chapter 2.1.1 --- Edge-coloring of bipartite graph with maximum degree two --- p.11 / Chapter 2.1.2 --- Edge-coloring of bipartite graph with maximum degree M --- p.14 / Chapter 2.2 --- Looping algorithm --- p.17 / Chapter 2.2.1 --- Paull's Matrix --- p.17 / Chapter 2.2.2 --- Chain to be rearranged in Paull's Matrix --- p.18 / Chapter 2.3 --- The principles of parallel algorithms --- p.19 / Chapter 2.3.1 --- Edge-coloring of bipartite graph with maximum degree two --- p.20 / Chapter 2.3.2 --- Edge-coloring of bipartite graph with maximum degree 2m --- p.22 / Chapter 3 --- Parallel routing algorithm in Benes-Clos networks --- p.25 / Chapter 3.1 --- Routing properties of Benes networks --- p.25 / Chapter 3.1.1 --- Three-stage structure and routing constraints --- p.26 / Chapter 3.1.2 --- Algebraic interpretation of connection set up problem --- p.29 / Chapter 3.1.3 --- Equivalent classes --- p.31 / Chapter 3.2 --- Parallel routing algorithm --- p.32 / Chapter 3.2.1 --- Basic principles --- p.32 / Chapter 3.2.2 --- Initialization --- p.34 / Chapter 3.2.3 --- Algorithm --- p.36 / Chapter 3.2.4 --- Set up the states and determine π for next stage --- p.37 / Chapter 3.2.5 --- Simulation results --- p.40 / Chapter 3.2.6 --- Time complexity --- p.41 / Chapter 3.3 --- Contention resolution --- p.41 / Chapter 3.4 --- Algorithms applied to Clos network with 2m central switches --- p.43 / Chapter 3.5 --- Parallel algorithms in rearrangeability --- p.47 / Chapter 4 --- Conclusions --- p.52

by Yooh Ji Heng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 119-128). / Appendix in Chinese. / Chapter I --- Synchronization of Multi-carrier CDMA Signals --- p.1 / Chapter 1 --- Introduction --- p.2 / Chapter 1.1 --- Spread Spectrum CDMA --- p.4 / Chapter 1.1.1 --- Direct Sequence/SS-CDMA --- p.5 / Chapter 1.1.2 --- Frequency Hopping/SS-CDMA --- p.5 / Chapter 1.1.3 --- Pseudo-noise Sequence --- p.6 / Chapter 1.2 --- Synchronization for CDMA signal --- p.7 / Chapter 1.2.1 --- Acquisition of PN Sequence --- p.7 / Chapter 1.2.2 --- Phase Locked Loop --- p.8 / Chapter 2 --- Multi-carrier CDMA --- p.10 / Chapter 2.1 --- System Model --- p.11 / Chapter 2.2 --- Crest Factor --- p.12 / Chapter 2.3 --- Shapiro-Rudin Sequence --- p.14 / Chapter 3 --- Synchronization and Detection by Line-Fitting --- p.16 / Chapter 3.1 --- Unmodulated Signals --- p.16 / Chapter 3.2 --- Estimating the Time Shift by Line-Fitting --- p.19 / Chapter 3.3 --- Modulated Signals --- p.22 / Chapter 4 --- Matched Filter --- p.23 / Chapter 5 --- Performance and Conclusion --- p.27 / Chapter 5.1 --- Line Fitting Algorithm --- p.27 / Chapter 5.2 --- Matched Filter --- p.28 / Chapter 5.3 --- Conclusion --- p.30 / Chapter II --- Security on Internet --- p.31 / Chapter 6 --- Introduction --- p.32 / Chapter 6.1 --- Introduction to Cryptography --- p.32 / Chapter 6.1.1 --- Classical Cryptography --- p.33 / Chapter 6.1.2 --- Cryptanalysis --- p.35 / Chapter 6.2 --- Introduction to Internet Security --- p.35 / Chapter 6.2.1 --- The Origin of Internet --- p.35 / Chapter 6.2.2 --- Internet Security --- p.36 / Chapter 6.2.3 --- Internet Commerce --- p.37 / Chapter 7 --- Elementary Number Theory --- p.39 / Chapter 7.1 --- Finite Field Theory --- p.39 / Chapter 7.1.1 --- Euclidean Algorithm --- p.40 / Chapter 7.1.2 --- Chinese Remainder Theorem --- p.40 / Chapter 7.1.3 --- Modular Exponentiation --- p.41 / Chapter 7.2 --- One-way Hashing Function --- p.42 / Chapter 7.2.1 --- MD2 --- p.43 / Chapter 7.2.2 --- MD5 --- p.43 / Chapter 7.3 --- Prime Number --- p.44 / Chapter 7.3.1 --- Listing of Prime Number --- p.45 / Chapter 7.3.2 --- Primality Testing --- p.45 / Chapter 7.4 --- Random/Pseudo-Random Number --- p.47 / Chapter 7.4.1 --- Examples of Random Number Generator --- p.49 / Chapter 8 --- Private Key and Public Key Cryptography --- p.51 / Chapter 8.1 --- Block Ciphers --- p.51 / Chapter 8.1.1 --- Data Encryption Standard (DES) --- p.52 / Chapter 8.1.2 --- International Data Encryption Algorithm (IDEA) --- p.54 / Chapter 8.1.3 --- RC5 --- p.55 / Chapter 8.2 --- Stream Ciphers --- p.56 / Chapter 8.2.1 --- RC2 and RC4 --- p.57 / Chapter 8.3 --- Public Key Cryptosystem --- p.58 / Chapter 8.3.1 --- Diffie-Hellman --- p.60 / Chapter 8.3.2 --- Knapsack Algorithm --- p.60 / Chapter 8.3.3 --- RSA --- p.62 / Chapter 8.3.4 --- Elliptic Curve Cryptosystem --- p.63 / Chapter 8.3.5 --- Public Key vs. Private Key Cryptosystem --- p.64 / Chapter 8.4 --- Digital Signature --- p.65 / Chapter 8.4.1 --- ElGamal Signature Scheme --- p.66 / Chapter 8.4.2 --- Digital Signature Standard (DSS) --- p.67 / Chapter 8.5 --- Cryptanalysis to Current Cryptosystems --- p.68 / Chapter 8.5.1 --- Differential Cryptanalysis --- p.68 / Chapter 8.5.2 --- An Attack to RC4 in Netscapel.l --- p.69 / Chapter 8.5.3 --- "An Timing Attack to Diffie-Hellman, RSA" --- p.71 / Chapter 9 --- Network Security and Electronic Commerce --- p.73 / Chapter 9.1 --- Network Security --- p.73 / Chapter 9.1.1 --- Password --- p.73 / Chapter 9.1.2 --- Network Firewalls --- p.76 / Chapter 9.2 --- Implementation for Network Security --- p.79 / Chapter 9.2.1 --- Kerberos --- p.79 / Chapter 9.2.2 --- Privacy-Enhanced Mail (PEM) --- p.80 / Chapter 9.2.3 --- Pretty Good Privacy (PGP) --- p.82 / Chapter 9.3 --- Internet Commerce --- p.83 / Chapter 9.3.1 --- Electronic Cash --- p.85 / Chapter 9.4 --- Internet Browsers --- p.87 / Chapter 9.4.1 --- Secure NCSA Mosaic --- p.87 / Chapter 9.4.2 --- Netscape Navigator --- p.89 / Chapter 9.4.3 --- SunSoft HotJava --- p.91 / Chapter 10 --- Examples of Electronic Commerce System --- p.94 / Chapter 10.1 --- CyberCash --- p.95 / Chapter 10.2 --- DigiCash --- p.97 / Chapter 10.3 --- The Financial Services Technology Consortium --- p.98 / Chapter 10.3.1 --- Electronic Check Project --- p.99 / Chapter 10.3.2 --- Electronic Commerce Project --- p.101 / Chapter 10.4 --- FirstVirtual --- p.103 / Chapter 10.5 --- Mondex --- p.104 / Chapter 10.6 --- NetBill --- p.106 / Chapter 10.7 --- NetCash --- p.108 / Chapter 10.8 --- NetCheque --- p.111 / Chapter 11 --- Conclusion --- p.113 / Chapter A --- An Essay on Chinese Remainder Theorem and RSA --- p.115 / Bibliography --- p.119

Leung Ka Hing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 94-96). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Characterization and Performance Analysis --- p.8 / Chapter 2.1 --- Two-class Proportional Differentiated Service --- p.11 / Chapter 2.2 --- N-class Proportional DS --- p.13 / Chapter 3 --- Experiments of Proportional Delay Differentiation using the It- erative Algorithm --- p.20 / Chapter 3.1 --- Experiments using Poisson arrivals --- p.21 / Chapter 3.2 --- Experiments using other arrivals distributions --- p.33 / Chapter 4 --- Dynamic Adjustment --- p.37 / Chapter 4.1 --- Adjustment algorithms --- p.37 / Chapter 5 --- Experiments of Proportional Delay Differentiation using Dy- namic Adjustment --- p.41 / Chapter 5.1 --- Illustration of dynamic adjustment --- p.43 / Chapter 5.2 --- Poisson --- p.45 / Chapter 5.3 --- Pareto --- p.48 / Chapter 5.4 --- MMPP --- p.54 / Chapter 5.5 --- Heterogeneous traffic classes --- p.60 / Chapter 5.6 --- Experiments for short time-scale analysis --- p.62 / Chapter 6 --- Multiple nodes --- p.69 / Chapter 7 --- Summary of the Experiments Results --- p.75 / Chapter 8 --- Improvement of WTP --- p.78 / Chapter 8.1 --- Algorithm --- p.78 / Chapter 8.2 --- Experiments --- p.80 / Chapter 9 --- Possible Extensions --- p.85 / Chapter 9.1 --- Application Extension --- p.85 / Chapter 9.2 --- Performance Quantification --- p.87 / Chapter 10 --- Conclusion --- p.90

Jorden Yeong-Tswen, Tse. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 76-76). / Abstracts in English and Chinese. / ACKNOWLEDGEMENTS --- p.2 / ABSTRACT --- p.3 / 摘要 --- p.4 / CONTENTS --- p.5 / Chapter CHAPTER 1: --- INTRODUCTION --- p.8 / Chapter 1.1. --- First Mile Evolution --- p.8 / Chapter 1.2. --- Access： Passive Optical Network (PON) --- p.10 / Chapter 1.2.1. --- ATM-PON (APON) --- p.13 / Chapter 1.2.2. --- Ethernet PON (EPON) --- p.14 / Chapter 1.3. --- Problem Definition and Possible Solutions --- p.16 / Chapter 1.3.1. --- Wavelength Division Multiplexing (WDM) --- p.17 / Chapter 1.3.2. --- Time Division Multiplexing (TDM) --- p.18 / Chapter 1.3.3. --- Sub-carrier Multiplexing (SCM) & Frequency Division Multiplexing (FDM) --- p.20 / Chapter 1.3.4. --- Code Division Multi Access (CDMA) --- p.20 / Chapter 1.4. --- Thesis Organization --- p.20 / Chapter CHAPTER 2: --- BACKGROUND --- p.22 / Chapter 2.1. --- EPON Solution：- MPCP --- p.22 / Chapter 2.2. --- CSMA/CD on PON --- p.26 / Chapter 2.3. --- Motivation --- p.28 / Chapter CHAPTER 3: --- CSMA/CA PROTOCOL USING PILOT TONE ON PON --- p.29 / Chapter 3.1. --- Basic Protocol Description --- p.29 / Chapter 3.1.1. --- With No Contention --- p.31 / Chapter 3.1.2. --- With Contention --- p.32 / Chapter 3.1.3. --- With Contention and Winner --- p.33 / Chapter 3.2. --- Simulation --- p.35 / Chapter 3.2.1. --- Effect of Loading on Network Utilization --- p.37 / Chapter 3.2.2. --- Effect of Network Size on Utilization --- p.39 / Chapter 3.2.3. --- Delay Performance --- p.41 / Chapter 3.2.4. --- Effect of Distance from Remote Node --- p.44 / Chapter 3.2.5. --- Effect of Maximum Packet Duration on Utilization and Delay --- p.45 / Chapter 3.3. --- Conclusions --- p.47 / Chapter CHAPTER 4: --- PROTOCOL ENHANCEMENT ON VARIOUS ASPECTS --- p.48 / Chapter 4.1. --- Utilization Enhancement --- p.48 / Chapter 4.1.1. --- Improvement on Network Utilization --- p.50 / Chapter 4.1.2. --- Network Delay Performance --- p.52 / Chapter 4.1.3. --- Conclusions --- p.53 / Chapter 4.2. --- Capture Effect --- p.53 / Chapter 4.2.1. --- Solution by Varying Ts --- p.54 / Chapter 4.2.2. --- Simulations --- p.55 / Chapter 4.2.3. --- Conclusions --- p.58 / Chapter 4.3. --- Introducing Cos to existing network --- p.59 / Chapter 4.3.1. --- Principle --- p.59 / Chapter 4.3.2. --- Simulation Model --- p.60 / Chapter 4.3.3. --- Utilization Performance --- p.61 / Chapter 4.3.4. --- Delay Performance --- p.64 / Chapter 4.3.5. --- Conclusions --- p.68 / Chapter CHAPTER 5: --- CONCLUSIONS --- p.69 / Chapter 5.1. --- Thesis Summary --- p.69 / Chapter 5.2. --- Future Work --- p.71 / REFERENCES --- p.73

by Chan Tsan Jim. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 68-71). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Background --- p.2 / Chapter 1.2.1 --- Introduction --- p.2 / Chapter 1.2.2 --- Wavelength Division Multiplexing --- p.3 / Chapter 1.2.3 --- Arrayed Waveguide Grating --- p.5 / Chapter 1.2.4 --- Passive Optical Networks --- p.7 / Chapter 1.3 --- Outline of the thesis --- p.10 / Chapter Chapter 2 --- Review of Protection and Restoration Schemes --- p.12 / Chapter 2.1 --- Introduction --- p.12 / Chapter 2.2 --- Protection Schemes --- p.14 / Chapter 2.2.1 --- Path Protection --- p.14 / Chapter 2.2.2 --- Link Protection --- p.16 / Chapter 2.3 --- Restoration Schemes --- p.17 / Chapter 2.3.1 --- Path Restoration --- p.17 / Chapter 2.3.2 --- Link Restoration --- p.18 / Chapter 2.4 --- Protection and Restoration Schemes in PON --- p.18 / Chapter 2.4.1 --- Protection Schemes in G.983.1 --- p.18 / Chapter 2.4.2 --- Other Proposed Schemes --- p.21 / Chapter Chapter 3 --- Design of WDM PON Network Architecture --- p.26 / Chapter 3.1 --- Introduction --- p.26 / Chapter 3.2 --- The Group Protection Architecture (GPA) --- p.27 / Chapter 3.2.1 --- Network Design --- p.27 / Chapter 3.2.2 --- Protection Mechanism --- p.28 / Chapter 3.2.3 --- Wavelength Assignments --- p.30 / Chapter 3.2.4 --- Power Budget Calculation --- p.32 / Chapter 3.2.5 --- Crosstalk Analysis --- p.33 / Chapter 3.2.6 --- Discussion --- p.35 / Chapter 3.3 --- The Enhanced Group Protection Architecture (EGPA) --- p.36 / Chapter 3.3.1 --- Introduction --- p.36 / Chapter 3.3.2 --- Network Design --- p.37 / Chapter 3.3.3 --- Protection Mechanism --- p.38 / Chapter 3.3.4 --- Wavelength Assignments --- p.39 / Chapter 3.3.5 --- Power Budget Calculation --- p.40 / Chapter 3.3.6 --- Crosstalk Analysis --- p.41 / Chapter 3.3.7 --- Discussion --- p.42 / Chapter 3.4 --- The Hybrid Ring Architecture (HR) --- p.42 / Chapter 3.4.1 --- Introduction --- p.42 / Chapter 3.4.2 --- Network Design --- p.43 / Chapter 3.4.3 --- Protection Mechanism --- p.44 / Chapter 3.4.4 --- Wavelength Assignments --- p.45 / Chapter 3.4.5 --- Power Budget Calculation --- p.46 / Chapter 3.4.6 --- Crosstalk Analysis --- p.47 / Chapter 3.4.7 --- Discussion --- p.47 / Chapter 3.5 --- Comparison of the three schemes --- p.48 / Chapter 3.6 --- Summary of the three schemes --- p.50 / Chapter Chapter 4 --- Experimental Evaluation --- p.51 / Chapter 4.1 --- Introduction --- p.51 / Chapter 4.2 --- Experimental Setup --- p.51 / Chapter 4.2.1 --- The GPA Scheme --- p.51 / Chapter 4.2.2 --- The EGPA Scheme --- p.53 / Chapter 4.2.3 --- The HR Scheme --- p.54 / Chapter 4.3 --- Experimental Result --- p.55 / Chapter 4.3.1 --- Optical Spectrum --- p.55 / Chapter 4.3.2 --- Transmission Performance --- p.58 / Chapter 4.3.3 --- Switching/Restoration Time --- p.61 / Chapter 4.3.4 --- Crosstalk Penalty --- p.63 / Chapter 4.4 --- Conclusion --- p.64 / Chapter Chapter 5 --- Conclusion and Future Works --- p.65 / Chapter 5.1 --- Introduction --- p.65 / Chapter 5.2 --- Conclusion --- p.65 / Chapter 5.3 --- Future Works --- p.66 / References --- p.67

No description available.

Zhao, Qiao. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 35-36). / Abstracts also in Chinese. / Abstract --- p.i / Acknowledgement --- p.v / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Model Description --- p.3 / Chapter 2.1 --- An Incentive Model for P2P Networks --- p.3 / Chapter 2.2 --- Learning Models for P2P Networks --- p.5 / Chapter 2.2.1 --- Current-best Learning Model (CBLM) --- p.5 / Chapter 2.2.2 --- Opportunistic Learning Model (OLM) --- p.6 / Chapter 2.3 --- Incentive Policies for P2P Networks --- p.7 / Chapter 2.3.1 --- Mirror Incentive Policy Vmirror --- p.8 / Chapter 2.3.2 --- Proportional Incentive Policy Vprop --- p.9 / Chapter 2.3.3 --- Linear Incentive Policy Class CLIP --- p.9 / Chapter 2.4 --- Performance and Robustness of Incentive Policies --- p.10 / Chapter 2.4.1 --- Robustness Analysis of Mirror Incentive Policy using the current-best learning method --- p.10 / Chapter 2.4.2 --- Robustness Analysis of Mirror Incentive Policy using the opportunistic learning method --- p.12 / Chapter 2.4.3 --- Robustness Analysis of Proportional Incentive Policy Using the current-best learning method --- p.12 / Chapter 2.4.4 --- Robustness Analysis of Proportional Incentive Policy Using the opportunistic learning method --- p.13 / Chapter 2.4.5 --- Robustness Analysis for Incentive Protocol in the Linear Incentive Class --- p.14 / Chapter 2.5 --- Connection with Evolutionary Game Theory --- p.17 / Chapter 3 --- Performance Evaluation --- p.21 / Chapter 3.1 --- Performance and Robustness of the Mirror Incentive Policy (Pmirror): --- p.21 / Chapter 3.2 --- Performance and Robustness of the Proportional Incentive Policy {Pprop): --- p.23 / Chapter 3.3 --- Performance and Robustness of incentive policy in the Linear Incentive Class (CLIP)： --- p.24 / Chapter 3.4 --- The Effect of Non-adaptive Peers: --- p.25 / Chapter 4 --- Adversary Effect of Altruism --- p.29 / Chapter 4.1 --- The Effect of Protocol Cost --- p.29 / Chapter 4.2 --- The Tradeoff between Altruism and System Robustness --- p.30 / Chapter 5 --- Related Work --- p.33 / Chapter 6 --- Conclusion --- p.34 / Bibliography --- p.35

Lin, Yangyang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (p. 50-53). / Abstract also in Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter Chapter 2 --- Background and Related Work --- p.5 / Chapter 2.1 --- Latency-based Approaches --- p.5 / Chapter 2.2 --- Bandwidth-based Approaches --- p.6 / Chapter 2.3 --- Other Approaches --- p.8 / Chapter 2.4 --- Comparisons and Contributions --- p.9 / Chapter Chapter 3 --- RTT-based Path Selection Revisit --- p.11 / Chapter 3.1 --- Experimental Setting --- p.11 / Chapter 3.2 --- Relationship between RTT and Available Bandwidth --- p.12 / Chapter 3.3 --- Path Selection Accuracy and Efficiency of RTT --- p.13 / Chapter Chapter 4 --- Path Bandwidth measurement --- p.16 / Chapter 4.1 --- In-band Bandwidth Probing --- p.17 / Chapter 4.2 --- Scheduling Constraints --- p.19 / Chapter 4.3 --- Cascaded Bandwidth Probing --- p.20 / Chapter 4.4 --- Model Verification --- p.23 / Chapter Chapter 5 --- Adaptive Multi-overlay ALM --- p.26 / Chapter 5.1 --- Overlay Construction --- p.26 / Chapter 5.2 --- Overlay Adaptation --- p.28 / Chapter 5.3 --- RTT-based Path Selection --- p.30 / Chapter 5.4 --- Topology-Adaptation-Induced Data Loss --- p.31 / Chapter Chapter 6 --- Performance Evaluation --- p.33 / Chapter 6.1 --- Simulation Setting --- p.33 / Chapter 6.2 --- Topology-Adaptation-Induced Data Loss --- p.34 / Chapter 6.3 --- Data Delivery Performance --- p.36 / Chapter 6.4 --- Performance Variation across Peers --- p.38 / Chapter 6.5 --- Performance of Cross Traffic --- p.40 / Chapter 6.6 --- Overlay Topology Convergence --- p.42 / Chapter 6.7 --- Impact of Overlay Adaptation Triggering Threshold --- p.44 / Chapter 6.8 --- Impact of Peer Buffer Size --- p.46 / Chapter Chapter 7 --- Conclusion and future work --- p.48 / References --- p.50

Lam, Kim Yung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 87-92). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Rayleigh Fading Channels --- p.1 / Chapter 1.2 --- Wireless Ad Hoc Networks --- p.3 / Chapter 1.3 --- Ad Hoc Routing Protocols --- p.3 / Chapter 1.4 --- Information Capacity --- p.4 / Chapter 1.5 --- Cooperative Communications --- p.6 / Chapter 1.6 --- Outline of Thesis --- p.7 / Chapter 2 --- Background and Related Work --- p.8 / Chapter 2.1 --- Cooperative Communications --- p.8 / Chapter 2.1.1 --- Cooperative Diversity --- p.8 / Chapter 2.1.2 --- User Cooperation --- p.10 / Chapter 2.1.3 --- Coded Cooperation --- p.11 / Chapter 2.2 --- Cooperative Routing --- p.12 / Chapter 2.3 --- Information-Theoretic Study --- p.16 / Chapter 2.4 --- Optimization techniques --- p.17 / Chapter 3 --- Single-Source Single-Destination Cooperative Routing --- p.21 / Chapter 3.1 --- System Model --- p.22 / Chapter 3.1.1 --- Network Assumptions --- p.22 / Chapter 3.1.2 --- Routing Process --- p.22 / Chapter 3.1.3 --- Transmitting Signal --- p.23 / Chapter 3.1.4 --- Link Cost Formulation --- p.23 / Chapter 3.2 --- Minimum Energy Cooperative Route --- p.25 / Chapter 3.2.1 --- Cooperative Graph --- p.25 / Chapter 3.2.2 --- An Example of the Cooperative Graph --- p.27 / Chapter 3.2.3 --- Non-reducible property of the Cooperative Graph --- p.29 / Chapter 3.3 --- Optimized Scheduling --- p.32 / Chapter 3.3.1 --- KKT conditions --- p.32 / Chapter 3.3.2 --- Newton´ةs Method --- p.34 / Chapter 3.4 --- Complexity Analysis --- p.35 / Chapter 3.5 --- Simplified Scheduling Process --- p.37 / Chapter 3.5.1 --- Linear relationship in low rate regime --- p.37 / Chapter 3.5.2 --- The Simplified Scheduling Algorithm --- p.39 / Chapter 4 --- Heuristic Single-Source Cooperative Routing Schemes --- p.41 / Chapter 4.1 --- Maximum Hops Cut --- p.42 / Chapter 4.1.1 --- The Routing Protocol --- p.42 / Chapter 4.1.2 --- Simulations --- p.46 / Chapter 4.2 --- Maximum Relays Subgraph --- p.47 / Chapter 4.2.1 --- The Routing Protocol --- p.47 / Chapter 4.2.2 --- Simulations --- p.51 / Chapter 4.3 --- Adaptive Maximum Relays Subgraph --- p.55 / Chapter 4.3.1 --- The Routing Protocol --- p.55 / Chapter 4.3.2 --- Simulations --- p.57 / Chapter 4.4 --- Comparison of three protocols --- p.60 / Chapter 4.4.1 --- Implementation --- p.60 / Chapter 4.4.2 --- Cooperative Performance --- p.60 / Chapter 4.5 --- Enhancement of the algorithms --- p.61 / Chapter 4.5.1 --- Conclusion --- p.63 / Chapter 5 --- Multiplexing Cooperative Routes in Multi-source Networks --- p.64 / Chapter 5.1 --- Problem Formation --- p.65 / Chapter 5.1.1 --- The Network Model --- p.65 / Chapter 5.1.2 --- Objective Aim --- p.65 / Chapter 5.1.3 --- Link Cost Formulation --- p.66 / Chapter 5.1.4 --- Time Sharing and Interference --- p.66 / Chapter 5.1.5 --- Multiple Sources Consideration --- p.67 / Chapter 5.2 --- Multi-Source Route-Multiplexing Protocols --- p.68 / Chapter 5.2.1 --- Full Combination with Interference (FCI) --- p.68 / Chapter 5.2.2 --- Full Combination with Time Sharing (FCTS) --- p.68 / Chapter 5.2.3 --- Selection Between Interference and Time Sharing (SBITS) --- p.69 / Chapter 5.2.4 --- Interference and time sharing combinations --- p.71 / Chapter 5.2.5 --- The Simplified Version for SBITS --- p.72 / Chapter 5.3 --- Stage Cost Calculation --- p.73 / Chapter 5.3.1 --- Total stage cost formation in the sub timeslot --- p.73 / Chapter 5.3.2 --- Total stage cost formulation in different routing protocols --- p.74 / Chapter 5.3.3 --- Multiplexing for non-uniform timeslot routes --- p.75 / Chapter 5.4 --- Simulation --- p.76 / Chapter 5.4.1 --- Simulation model --- p.76 / Chapter 5.4.2 --- Simulation detail --- p.77 / Chapter 5.4.3 --- Simulation evaluation --- p.78 / Chapter 6 --- Conclusion and Future Work --- p.83 / Chapter 6.1 --- Conclusion --- p.83 / Chapter 6.2 --- Future Work --- p.84 / Chapter 6.2.1 --- Multiple-Source System Optimal Route --- p.84 / Chapter 6.2.2 --- Better Relay-Selection Policy --- p.85 / Chapter 6.2.3 --- Single Optimization for Minimum Energy Cooperative Route --- p.85 / Chapter 6.2.4 --- Dynamic Programming for Minimum Energy Cooperative Route --- p.85 / Chapter 6.2.5 --- Min-Max Problem --- p.85 / Chapter 6.2.6 --- Distributed Algorithm --- p.86 / Chapter 6.2.7 --- Game Theory --- p.86 / Bibliography --- p.87

Jia, Lu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (p. 76-80). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background Study --- p.7 / Chapter 3 --- Analysis of P2P Tracker Designs --- p.11 / Chapter 1 --- Tracker design in P2P systems --- p.11 / Chapter 1.1 --- A taxonomy of tracker designs --- p.11 / Chapter 1.2 --- Design considerations --- p.14 / Chapter 2 --- A reliability model for DHT-based tracker design --- p.15 / Chapter 2.1 --- DHT basics --- p.15 / Chapter 2.2 --- Model preliminaries and assumptions --- p.16 / Chapter 2.3 --- Model description --- p.18 / Chapter 3 --- Reliability analysis --- p.25 / Chapter 3.1 --- Related parameters --- p.25 / Chapter 3.2 --- Simulation setup --- p.27 / Chapter 3.3 --- Results --- p.30 / Chapter 3.4 --- Observations from modeling work --- p.35 / Chapter 3.5 --- Methods of DHT stabilization --- p.37 / Chapter 4 --- A Black-Box Study of Xunlei --- p.44 / Chapter 1 --- An Overview of Xunlei and its key components --- p.44 / Chapter 1.1 --- An overview --- p.44 / Chapter 1.2 --- Key components --- p.46 / Chapter 2 --- Participating into other swarms: Xunlei´ةs multi-protocol downloading strategy --- p.47 / Chapter 2.1 --- BitTorrent and eMule basics --- p.47 / Chapter 2.2 --- BitTorrent and eMule in Xunlei --- p.48 / Chapter 2.3 --- Multi-protocol downloading --- p.52 / Chapter 3 --- Xunlei servers --- p.54 / Chapter 4 --- Understanding Xunlei!s private protocol --- p.56 / Chapter 4.1 --- Exchanging peer lists --- p.56 / Chapter 4.2 --- Exchanging file data --- p.58 / Chapter 4.3 --- Error control and congestion control --- p.62 / Chapter 5 --- Further discussions --- p.65 / Chapter 5.1 --- Proximity of content --- p.65 / Chapter 5.2 --- Active swarm peers --- p.66 / Chapter 5.3 --- UDP-based data transmission --- p.69 / Chapter 5 --- Conclusion --- p.74 / Bibliography --- p.76