Fu, Zhengjia. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (p. 64-70 ). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Design for group network communication --- p.6 / Chapter 2.1 --- Performance metrics of network Voice Conference: GMOS --- p.7 / Chapter 2.2 --- Conference Leader Selection strategies --- p.11 / Chapter 2.3 --- Experiment Description --- p.14 / Chapter 2.4 --- Data analysis and results --- p.16 / Chapter 2.5 --- Applications of Proposals to Voice Conference --- p.25 / Chapter 3 --- P2P Application Identification --- p.27 / Chapter 3.1 --- Periodic Group Communication Patterns --- p.28 / Chapter 3.1.1 --- Terminology for Behavioral Patterns --- p.29 / Chapter 3.1.2 --- Pattern 1: Gossip of Buffer Maps --- p.30 / Chapter 3.1.3 --- Pattern 2: Content flow control --- p.31 / Chapter 3.1.4 --- Pattern 3: Synchronized Link Activation and Deactivation --- p.32 / Chapter 3.2 --- Identification Based on behavioral signatures --- p.33 / Chapter 3.2.1 --- Algorithm Overview --- p.34 / Chapter 3.2.2 --- Sequence Generation (SG1): Time Series for the Gossip Pattern --- p.36 / Chapter 3.2.3 --- Transform Time-domain Sequence to Frequency-domain Sequence --- p.36 / Chapter 3.2.4 --- Sequence Generation (SG2): Time Series for Content Flow Control Pattern --- p.40 / Chapter 3.2.5 --- Sequence Generation (SG3): Time Series for Synchronized Start and Finish of Flows --- p.41 / Chapter 3.2.6 --- Analyzer step --- p.47 / Chapter 3.3 --- Behavioral signatures of popular P2P applications --- p.47 / Chapter 3.4 --- Experiment Results --- p.49 / Chapter 3.5 --- Discussion --- p.52 / Chapter 4 --- Related Work --- p.58 / Chapter 5 --- Conclusion --- p.62 / Bibliography --- p.64

Ruan, Sichao. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 62-65). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Multihop Ad Hoc Wireless Networks --- p.1 / Chapter 1.1.1 --- Introduction to Multihop Ad Hoc Networks --- p.2 / Chapter 1.1.2 --- Scalability of Ad Hoc Wireless Networks --- p.3 / Chapter 1.2 --- Hidden Terminal Problem --- p.3 / Chapter 1.3 --- Exposed Terminal Problem --- p.5 / Chapter 1.4 --- Overview of the Thesis --- p.6 / Chapter 2 --- Background --- p.8 / Chapter 2.1 --- MAC Protocols for Wireless Networks --- p.8 / Chapter 2.1.1 --- Aloha --- p.8 / Chapter 2.1.2 --- CSMA/CA --- p.9 / Chapter 2.1.3 --- IEEE 802.11 DCF Standard --- p.10 / Chapter 2.2 --- Related Work --- p.12 / Chapter 2.2.1 --- Schemes for Hidden Node Problem --- p.12 / Chapter 2.2.2 --- Schemes for Exposed Node Problem --- p.13 / Chapter 2.3 --- Tradeoff between Hidden and Exposed Nodes --- p.14 / Chapter 2.4 --- The Effect of Carrier Sensing Range --- p.17 / Chapter 3 --- Analysis on Carrier Sensing Range --- p.18 / Chapter 3.1 --- Analysis Model --- p.18 / Chapter 3.1.1 --- Terminal Configurations --- p.18 / Chapter 3.1.2 --- Timing/Packet Parameters --- p.19 / Chapter 3.1.3 --- Protocol Approximation --- p.20 / Chapter 3.1.4 --- Throughput Measurement --- p.21 / Chapter 3.2 --- Derivation of Throughput --- p.21 / Chapter 3.2.1 --- Channel Modeling --- p.22 / Chapter 3.2.2 --- Actual Transmission Rate --- p.24 / Chapter 3.2.3 --- Case One --- p.24 / Chapter 3.2.4 --- Case Two --- p.26 / Chapter 3.2.5 --- Mathematical Form of Throughput --- p.28 / Chapter 3.2.6 --- Analysis Results --- p.30 / Chapter 3.3 --- Implications --- p.31 / Chapter 3.3.1 --- Value of Sensing Range in CSMA/CA --- p.31 / Chapter 3.3.2 --- Need for New MAC Protocols --- p.32 / Chapter 4 --- MAC Protocols by Congestion Control --- p.34 / Chapter 4.1 --- Motivations and Principles --- p.34 / Chapter 4.1.1 --- Balancing Hidden and Exposed Nodes --- p.35 / Chapter 4.1.2 --- Controlling Carrier Sensing Range --- p.36 / Chapter 4.1.3 --- Non-homogenous Sensing Range --- p.36 / Chapter 4.2 --- Algorithm Descriptions --- p.38 / Chapter 4.2.1 --- Core Concept --- p.38 / Chapter 4.2.2 --- LDMI Control Scheme --- p.40 / Chapter 4.2.3 --- Tahoe Control Scheme --- p.41 / Chapter 5 --- Simulation Analysis --- p.44 / Chapter 5.1 --- Simulation Configurations --- p.44 / Chapter 5.1.1 --- Geometric Burst Traffic Model --- p.45 / Chapter 5.1.2 --- Network Topology --- p.46 / Chapter 5.1.3 --- Simulation Parameters --- p.47 / Chapter 5.2 --- Throughput Comparisons --- p.48 / Chapter 5.3 --- Fairness Comparisons --- p.50 / Chapter 5.3.1 --- Situation of Unfairness --- p.50 / Chapter 5.3.2 --- Fairness Measurement --- p.52 / Chapter 5.4 --- Convergence Comparisons --- p.54 / Chapter 5.5 --- Summary of Performance Comparison --- p.55 / Chapter 6 --- Conclusions --- p.56 / Chapter A --- Categories of CSMA/CA --- p.58 / Chapter A.1 --- 1-persistent CSMA/CA --- p.58 / Chapter A.2 --- non-persistent CSMA/CA --- p.58 / Chapter A.3 --- p-persistent CSMA/CA --- p.59 / Chapter B --- Backoff Schemes --- p.60 / Chapter B.1 --- Constant Window Backoff Scheme --- p.60 / Chapter B.2 --- Geometric Backoff Scheme --- p.60 / Chapter B.3 --- Binary Exponential Backoff Scheme --- p.61 / Bibliography --- p.62

Li, Qiuhui. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 46-47). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- An overview of the BitTorrent protocol --- p.3 / Chapter 2 --- Problem Formulation --- p.7 / Chapter 2.1 --- Type-based Peer Selection Algorithm --- p.7 / Chapter 2.2 --- Clustering Index --- p.9 / Chapter 3 --- Model Formulation --- p.11 / Chapter 3.1 --- Markovian Model --- p.12 / Chapter 3.2 --- Transition Matrix --- p.14 / Chapter 3.2.1 --- Search Process --- p.16 / Chapter 3.2.2 --- Match Process --- p.18 / Chapter 3.2.3 --- Cut Process --- p.19 / Chapter 3.3 --- Open System Model --- p.21 / Chapter 4 --- Numerical Results and Observations --- p.24 / Chapter 4.1 --- Clustering Index --- p.24 / Chapter 4.2 --- Upload Utilization --- p.26 / Chapter 4.3 --- Download Rate --- p.28 / Chapter 4.4 --- Open System --- p.30 / Chapter 5 --- Performance Evaluation --- p.32 / Chapter 5.1 --- Model Verification --- p.34 / Chapter 5.2 --- Control the Clustering Index --- p.36 / Chapter 6 --- Related Works --- p.40 / Chapter 7 --- Conclusions --- p.44 / Bibliography --- p.46

Zhang, Shuqiang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (p. 74-80). / Abstracts in English and Chinese. / Abstract --- p.i / 摘要 --- p.iv / Acknowledgements --- p.v / Table of Contents --- p.vi / Chapter Chapter 1 --- Background --- p.1 / Chapter 1.1 --- Routing and Wavelength Assignment --- p.1 / Chapter 1.2 --- Survivability in Optical Networks --- p.3 / Chapter 1.3 --- Optical Multicasting --- p.4 / Chapter 1.3.1 --- Routing and Wavelength Assignment of Optical Multicast --- p.5 / Chapter 1.3.2 --- Current Research Topics about Optical Multicast --- p.8 / Chapter 1.4 --- Traffic Grooming --- p.10 / Chapter 1.4.1 --- Static Traffic Grooming --- p.11 / Chapter 1.4.2 --- Dynamic Traffic Grooming --- p.13 / Chapter 1.5 --- Contributions --- p.15 / Chapter 1.5.1 --- Multicast Protection with Scheduled Traffic Model --- p.15 / Chapter 1.5.2 --- Energy Efficient Time-Aware Traffic Grooming --- p.16 / Chapter 1.6 --- Organization of Thesis --- p.18 / Chapter Chapter 2 --- Multicast Protection in WDM Optical Network with Scheduled Traffic --- p.19 / Chapter 2.1 --- Introduction --- p.19 / Chapter 2.2 --- Multicast Protection under FSTM --- p.22 / Chapter 2.3 --- Illustrative Examples --- p.28 / Chapter 2.4 --- Two-Step Optimization under SSTM --- p.37 / Chapter 2.5 --- Summary --- p.40 / Chapter Chapter 3 --- Energy Efficient Time-Aware Traffic Grooming in Wavelength Routing Networks --- p.41 / Chapter 3.1 --- Introduction --- p.41 / Chapter 3.2 --- Energy consumption model --- p.43 / Chapter 3.3 --- Static Traffic Grooming with Time awareness --- p.44 / Chapter 3.3.1 --- Scheduled Traffic Model for Traffic Grooming --- p.44 / Chapter 3.3.2 --- ILP Formulation --- p.44 / Chapter 3.3.3 --- Illustrative Numerical Example --- p.48 / Chapter 3.4 --- Dynamic Traffic Grooming with Time Awareness --- p.49 / Chapter 3.4.1 --- Time-Aware Traffic Grooming (TATG) --- p.51 / Chapter 3.5 --- Simulation Results of Dynamic Traffic Grooming --- p.54 / Chapter 3.5.1 --- 24-node USNET: --- p.55 / Chapter 3.5.2 --- 15-node Pacific Bell Network: --- p.59 / Chapter 3.5.3 --- 14-node NSFNET: --- p.63 / Chapter 3.5.4 --- Alternative Configuration of Simulation Parameters: --- p.67 / Chapter 3.6 --- Summary --- p.71 / Chapter Chapter 4 --- Conclusions and Future Work --- p.72 / Chapter 4.1 --- Conclusions --- p.72 / Chapter 4.2 --- Future Work --- p.73 / Bibliography --- p.74 / Publications during M.Phil Study --- p.80

Zhou, Yipeng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 64-66). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Contribution --- p.2 / Chapter 1.3 --- Organization --- p.4 / Chapter 2 --- Related Work --- p.5 / Chapter 2.1 --- Work of Streaming --- p.5 / Chapter 2.2 --- Work of P2P VoD --- p.6 / Chapter 3 --- Basic Model of Synchronized Case --- p.8 / Chapter 4 --- Model of Chunk Selection Strategies --- p.13 / Chapter 4.1 --- Chunk Selection Strategies --- p.13 / Chapter 4.1.1 --- Greedy Strategy --- p.14 / Chapter 4.1.2 --- Rarest First Strategy --- p.15 / Chapter 4.1.3 --- "Buffer Size, Peer Population and Continuity" --- p.16 / Chapter 4.1.4 --- Mixed Strategy --- p.17 / Chapter 4.2 --- Some Conclusion and Extension --- p.19 / Chapter 4.3 --- Metrics --- p.20 / Chapter 4.3.1 --- Continuity --- p.20 / Chapter 4.3.2 --- Start-up Latency --- p.20 / Chapter 5 --- Experiment and Application --- p.22 / Chapter 5.1 --- Numerical Examples and Analysis --- p.22 / Chapter 5.2 --- Sensitivity study --- p.30 / Chapter 5.2.1 --- Discrete Model with Factor --- p.30 / Chapter 5.2.2 --- Validate Discrete Model with Factor --- p.31 / Chapter 5.2.3 --- Server Use Pull Strategy --- p.31 / Chapter 5.2.4 --- Vary Subset Size Touched by Server --- p.32 / Chapter 5.3 --- Application to Real-world Protocols --- p.32 / Chapter 6 --- Model of Unsynchronized Case --- p.34 / Chapter 6.1 --- The model for unsynchronized playback --- p.34 / Chapter 6.1.1 --- Overlap maximization problem --- p.37 / Chapter 6.1.2 --- Properties of the synchronized cluster --- p.38 / Chapter 6.2 --- Analysis of playback continuity --- p.40 / Chapter 6.2.1 --- Peers with different buffer sizes --- p.41 / Chapter 6.2.2 --- Analysis of two clusters with a lag --- p.44 / Chapter 7 --- Performance Evaluation of Unsynchronized System --- p.48 / Chapter 7.1 --- Performance Evaluation --- p.48 / Chapter 8 --- conclusion --- p.54 / Chapter 8.1 --- Conclusion --- p.54 / Chapter A --- Equation Derivation --- p.56 / Bibliography --- p.64

Cheung, Man Hon. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 89-94). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Rayleigh Fading Channels --- p.1 / Chapter 1.2 --- Ultra-Wideband (UWB) Communications --- p.2 / Chapter 1.2.1 --- Definition --- p.2 / Chapter 1.2.2 --- Characteristics --- p.3 / Chapter 1.2.3 --- UWB Signals --- p.4 / Chapter 1.2.4 --- Applications --- p.5 / Chapter 1.3 --- Cooperative Communications --- p.7 / Chapter 1.4 --- Outline of Thesis --- p.7 / Chapter 2 --- Background Study --- p.9 / Chapter 2.1 --- Interference-Aware Routing --- p.9 / Chapter 2.2 --- Routing in UWB Wireless Networks --- p.11 / Chapter 2.3 --- Cooperative Communications and Routing --- p.12 / Chapter 3 --- Cooperative Routing in Rayleigh Fading Channel --- p.15 / Chapter 3.1 --- System Model --- p.16 / Chapter 3.1.1 --- Transmitted Signal --- p.16 / Chapter 3.1.2 --- Received Signal and Maximal-Ratio Combining (MRC) --- p.16 / Chapter 3.1.3 --- Probability of Outage --- p.18 / Chapter 3.2 --- Cooperation Criteria and Power Distribution --- p.21 / Chapter 3.2.1 --- Optimal Power Distribution Ratio --- p.21 / Chapter 3.2.2 --- Near-Optimal Power Distribution Ratio β´ة --- p.21 / Chapter 3.2.3 --- Cooperation or Not? --- p.23 / Chapter 3.3 --- Performance Analysis and Evaluation --- p.26 / Chapter 3.3.1 --- 1D Poisson Random Network --- p.26 / Chapter 3.3.2 --- 2D Grid Network --- p.28 / Chapter 3.4 --- Cooperative Routing Algorithm --- p.32 / Chapter 3.4.1 --- Cooperative Routing Algorithm --- p.33 / Chapter 3.4.2 --- 2D Random Network --- p.35 / Chapter 4 --- UWB System Model and BER Expression --- p.37 / Chapter 4.1 --- Transmit Signal --- p.37 / Chapter 4.2 --- Channel Model --- p.39 / Chapter 4.3 --- Received Signal --- p.39 / Chapter 4.4 --- Rake Receiver with Maximal-Ratio Combining (MRC) --- p.41 / Chapter 4.5 --- BER in the presence of AWGN & MUI --- p.46 / Chapter 4.6 --- Rake Receivers --- p.47 / Chapter 4.7 --- Comparison of Simple Routing Algorithms in ID Network --- p.49 / Chapter 5 --- Interference-Aware Routing in UWB Wireless Networks --- p.57 / Chapter 5.1 --- Problem Formulation --- p.57 / Chapter 5.2 --- Optimal Interference-Aware Routing --- p.58 / Chapter 5.2.1 --- Link Cost --- p.58 / Chapter 5.2.2 --- Per-Hop BER Requirement and Scaling Effect --- p.59 / Chapter 5.2.3 --- Optimal Interference-Aware Routing --- p.61 / Chapter 5.3 --- Performance Evaluation --- p.64 / Chapter 6 --- Cooperative Routing in UWB Wireless Networks --- p.69 / Chapter 6.1 --- Two-Node Cooperative Communication --- p.69 / Chapter 6.1.1 --- Received Signal for Non-Cooperative Communication --- p.69 / Chapter 6.1.2 --- Received Signal for Two-Node Cooperative Communication --- p.70 / Chapter 6.1.3 --- Probability of Error --- p.71 / Chapter 6.2 --- Problem Formulation --- p.75 / Chapter 6.3 --- Cooperative Routing Algorithm --- p.77 / Chapter 6.4 --- Performance Evaluation --- p.80 / Chapter 7 --- Conclusion and Future Work --- p.85 / Chapter 7.1 --- Conclusion --- p.85 / Chapter 7.2 --- Future Work --- p.86 / Chapter 7.2.1 --- Distributed Algorithm --- p.87 / Chapter 7.2.2 --- Performance Analysis in Random Networks --- p.87 / Chapter 7.2.3 --- Cross-Layer Optimization --- p.87 / Chapter 7.2.4 --- Game Theory --- p.87 / Chapter 7.2.5 --- Other Variations in Cooperative Schemes --- p.88 / Bibliography --- p.89

Ke, Bingwen. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 52-54). / Abstracts in Chinese and English. / Abstract --- p.3 / Acknowledgement --- p.5 / Content --- p.6 / Table of Figures --- p.8 / Chapter Chapter 1 --- Introduction --- p.9 / Chapter 1.1 --- Motivations and Contributions --- p.9 / Chapter 1.2 --- Organization of the Thesis --- p.11 / Chapter Chapter 2 --- Background --- p.12 / Chapter 2.1 --- Multiple-Input-Multiple-Output (MIMO) System --- p.12 / Chapter 2.1.1 --- Basic MIMO Structure --- p.12 / Chapter 2.1.2 --- Multiple User Detection (MUD) in MIMO Networks --- p.14 / Chapter 2.2 --- IEEE 802.11 --- p.16 / Chapter 2.2.1 --- CSMA/CA in 802.11 --- p.16 / Chapter 2.2.2 --- CSMA/CA(k) in 802.1 In --- p.18 / Chapter 2.2.3 --- Co-channel Transmission in MIMO WLAN --- p.19 / Chapter Chapter 3 --- Channel Correlation in MIMO Ad Hoc Networks --- p.20 / Chapter 3.1 --- Introduction of Channel Correlation --- p.20 / Chapter 3.2 --- Channel Correlation Threshold --- p.25 / Chapter Chapter 4 --- MAC with SINR Threshold --- p.28 / Chapter Chapter 5 --- Performance Evaluation of MWST in Fully-Connected Networks --- p.33 / Chapter Chapter 6 --- MAC with SINR Threshold (MWST) in Partially-Connected Networks --- p.38 / Chapter 6.1 --- Hidden Link Problem in Partially-Connected Networks --- p.38 / Chapter Chapter 7 --- Performance Evaluation in Partially-Connected Networks --- p.42 / Chapter 7.1 --- Fairness Issues in CSMA/CA(k) --- p.42 / Chapter 7.2 --- Fairness Performance of MWST --- p.45 / Conclusion --- p.50 / References --- p.52

Chau, Wai Shing. / Thesis submitted in: October 2007. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 64-66). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Ad hoc network --- p.1 / Chapter 1.2 --- Outline of the thesis --- p.3 / Chapter 2 --- Background Study --- p.4 / Chapter 2.1 --- Multiple Access Control (MAC) --- p.4 / Chapter 2.1.1 --- Time Division Multiple Access (TDMA) --- p.5 / Chapter 2.1.2 --- Spatial TDMA (STDMA) --- p.5 / Chapter 2.2 --- Interference Models --- p.6 / Chapter 2.2.1 --- Primary and Secondary Interferences --- p.6 / Chapter 2.2.2 --- Interference-based Model --- p.7 / Chapter 2.2.3 --- Graph-based Model --- p.7 / Chapter 2.3 --- Scheduling in Graph-based Model --- p.8 / Chapter 2.3.1 --- Conflict Graph --- p.9 / Chapter 3 --- Scheduling Algorithms in Ring Networks --- p.11 / Chapter 3.1 --- Problem Formulation --- p.12 / Chapter 3.2 --- Regular Sequences --- p.14 / Chapter 3.3 --- Scheduling in Ring Networks with Even-number of Edges --- p.22 / Chapter 3.4 --- Scheduling in Ring Networks with an Odd-number of Edges --- p.26 / Chapter 3.4.1 --- Scheduling by Reducing a Ring Network with an Odd-number of Edges into a Ring- Network with an Even-number of Edges --- p.28 / Chapter 3.4.2 --- Scheduling by Shifting the Regular Sequences --- p.32 / Chapter 3.5 --- Discussion --- p.42 / Chapter 3.6 --- Conclusion --- p.42 / Chapter 4 --- Distributed Scheduling Algorithm for Ad Hoc Network --- p.43 / Chapter 4.1 --- Problem Formulation --- p.44 / Chapter 4.2 --- Distributed Scheduling Heuristic Algorithm --- p.44 / Chapter 4.2.1 --- Weight functions --- p.44 / Chapter 4.2.2 --- Main Algorithm --- p.46 / Chapter 4.3 --- Centralized algorithm on a chain network --- p.49 / Chapter 4.4 --- Performance of the Algorithm on Chain Network --- p.50 / Chapter 4.4.1 --- Comparison 1 --- p.51 / Chapter 4.4.2 --- Comparsion 2 --- p.52 / Chapter 4.4.3 --- Comparsion 3 --- p.53 / Chapter 4.5 --- Performance of the Algorithm on Random Conflict graph --- p.55 / Chapter 4.6 --- Discussion --- p.57 / Chapter 4.7 --- Special Graphs --- p.58 / Chapter 4.8 --- Conclusion --- p.61 / Chapter 5 --- Conclusion --- p.62 / Bibliography --- p.64

Ye, Chong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 61-63). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Classification of P2P systems --- p.1 / Chapter 1.2 --- Replication in P2P systems --- p.3 / Chapter 1.3 --- Related work --- p.7 / Chapter 1.4 --- Organization --- p.10 / Chapter 1.5 --- Publications derived from this work --- p.11 / Chapter 2 --- P2P Replication System --- p.12 / Chapter 2.1 --- Peers --- p.13 / Chapter 2.2 --- Erasure code replication --- p.13 / Chapter 2.3 --- Estimation of file availability --- p.14 / Chapter 2.4 --- Problem formulation --- p.15 / Chapter 2.5 --- Performance metrics --- p.17 / Chapter 3 --- Decentralized Decisions --- p.19 / Chapter 3.1 --- Writable peer set --- p.20 / Chapter 3.2 --- Stretch factor estimation --- p.21 / Chapter 3.3 --- Locking phase --- p.22 / Chapter 4 --- Equal Weight Replication --- p.23 / Chapter 4.1 --- The decentralized replication algorithms --- p.23 / Chapter 4.1.1 --- Random algorithm --- p.23 / Chapter 4.1.2 --- Group partition algorithm --- p.25 / Chapter 4.1.3 --- High Available First (HAF) algorithm --- p.27 / Chapter 4.2 --- Evaluation of algorithms --- p.29 / Chapter 4.2.1 --- Simulation setup --- p.29 / Chapter 4.2.2 --- Simulation results --- p.31 / Chapter 4.3 --- Summary --- p.40 / Chapter 4.4 --- Clarification of individual contributions --- p.41 / Chapter 5 --- Replication with Preferences --- p.43 / Chapter 5.1 --- Problem re-defined --- p.44 / Chapter 5.2 --- The Bi-weight model --- p.46 / Chapter 5.3 --- The statistical rounding policy --- p.48 / Chapter 5.4 --- The distributed replication algorithm --- p.49 / Chapter 5.5 --- Evaluation of the algorithm --- p.51 / Chapter 5.5.1 --- Simulation setup --- p.51 / Chapter 5.5.2 --- Simulation results --- p.52 / Chapter 5.6 --- Discussion --- p.56 / Chapter 5.7 --- Summary --- p.57 / Chapter 6 --- Future work --- p.58 / Chapter 7 --- Conclusion --- p.59 / Bibliography --- p.61

Ip, Yin Ki. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 96-102). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background Study --- p.6 / Chapter 2.1 --- DTN Reference Implementation Model --- p.7 / Chapter 2.2 --- DTN Applications --- p.9 / Chapter 2.3 --- Multiple-copy Routing Strategies --- p.11 / Chapter 2.4 --- Buffer Management Strategies --- p.12 / Chapter 2.5 --- Performance Modeling of Multiple-copy Routing --- p.14 / Chapter 2.6 --- Conclusion on Background Study --- p.18 / Chapter 3 --- DTN with Resource Constraints --- p.20 / Chapter 3.1 --- Introduction --- p.20 / Chapter 3.2 --- Related Work --- p.21 / Chapter 3.3 --- "System Model, Replication, Forwarding and Buffer Management Strategies" --- p.22 / Chapter 3.4 --- Performance Evaluation --- p.29 / Chapter 3.4.1 --- Analysis on single-message-delivery with unlimited network resource --- p.29 / Chapter 3.4.2 --- Simulation study on multi-message-delivery with limited resource constraint --- p.34 / Chapter 3.5 --- Conclusion on DTN with Resource Constraints --- p.39 / Chapter 4 --- Multiple-copy Routing in DTN with Heteroge- neous Node Types --- p.41 / Chapter 4.1 --- Introduction --- p.41 / Chapter 4.2 --- Related Work --- p.44 / Chapter 4.3 --- System Model --- p.44 / Chapter 4.4 --- Performance Modeling --- p.46 / Chapter 4.4.1 --- Continuous Time Markov Chain (CTMC) Model --- p.46 / Chapter 4.4.2 --- Fluid Flow Approximation (FFA) --- p.53 / Chapter 4.5 --- Conclusion on DTN with Node Heterogeneity --- p.73 / Chapter 5 --- Conclusion and Future Work --- p.75 / Chapter A --- Random Direction Mobility Model --- p.78 / Chapter A.1 --- Mean Inter-encounter Interval --- p.79 / Chapter A.2 --- Inter-encounter Interval Distribution --- p.86 / Chapter A.3 --- Concluding Remarks --- p.88 / Chapter B --- Additional Results by Fluid Flow Approximation and Moment Closure Methods --- p.92 / Bibliography --- p.96