by Kwan Kar Kin, Karl. / Thesis (M.Ph.)--Chinese University of Hong Kong, 1987. / Bibliography: leaves 77-79. / Library's copy:Disk for circulation (3.5 in.)

Chan Kwun-chung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 71-73). / Abstracts in English and Chinese. / 摘要 --- p.II / ABSTRACT --- p.III / ACKNOWLEDGEMENT --- p.V / TABLE OF CONTENTS --- p.VI / LIST OF FIGURES --- p.X / LIST OF SYMBOLS --- p.XII / Chapter 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- Contributions --- p.3 / Chapter 1.2 --- Organization of the Thesis --- p.4 / Chapter 1.3 --- Publications --- p.5 / Chapter 2. --- RELATED WORKS --- p.6 / Chapter 2.1 --- Previous VOD System --- p.7 / Chapter 2.1.1 --- Service Model --- p.7 / Chapter 2.1.1.1 --- Unicast VOD --- p.7 / Chapter 2.1.1.2 --- Multicast VOD --- p.8 / Chapter 2.1.2 --- Architecture --- p.9 / Chapter 2.1.2.1 --- Centralized Architecture --- p.9 / Chapter 2.1.2.2 --- Distributed Architecture --- p.10 / Chapter 2.1.3 --- Interactive Function --- p.11 / Chapter 2.1.3.1 --- Limited Interactive Function --- p.11 / Chapter 2.1.3.2 --- Unlimited Interactive Function --- p.11 / Chapter 2.1.4 --- Split and Merge Operation --- p.12 / Chapter 2.1.4.1 --- SAM Scheme (Split and Merge) --- p.12 / Chapter 2.1.4.2 --- SRMDRU Scheme (Single Rate Multicast Double Rate Unicast) --- p.14 / Chapter 2.2 --- Previous Caching Algorithm --- p.15 / Chapter 2.2.1 --- LFU (Least Frequently Used) --- p.15 / Chapter 2.2.2 --- LRU (Least Recently Used) --- p.15 / Chapter 2.2.3 --- Media Stream Caching --- p.15 / Chapter 3. --- DESIGN OFA NOVEL VOD SYSTEM --- p.17 / Chapter 3.1 --- System Architecture --- p.18 / Chapter 3.1.1 --- Multicast Video Server Cluster (MVSC) --- p.19 / Chapter 3.1.2 --- Unicast Video Server Cluster (UVSC) --- p.20 / Chapter 3.1.3 --- Multicast Backbone Network (MBN) --- p.20 / Chapter 3.1.4 --- Local Distribution Network (LDN) --- p.21 / Chapter 3.1.5 --- Distributed Interactive Server (DIS) --- p.21 / Chapter 3.1.6 --- Distributed Proxy Server (DPS) --- p.22 / Chapter 3.1.7 --- Client Station (CS) --- p.22 / Chapter 3.2 --- Batched Multicast Transmission --- p.24 / Chapter 3.3 --- Split and Merge Operation --- p.26 / Chapter 3.4 --- Interactive Function --- p.31 / Chapter 3.4.1 --- Pause --- p.31 / Chapter 3.4.2 --- Slow Motion --- p.35 / Chapter 3.4.3 --- Various Speed Fast Forward / Fast Rewind (FF/REW) --- p.37 / Chapter 3.4.4 --- Jump Forward/Jump Backward (JF/JB) --- p.42 / Chapter 3.5 --- Performance Analysis --- p.46 / Chapter 3.5.1 --- Model --- p.46 / Chapter 3.5.2 --- System Parameters --- p.49 / Chapter 3.5.3 --- Results --- p.49 / Chapter 4. --- DESIGN OF A VIDEO PROXY SYSTEM --- p.57 / Chapter 4.1 --- Video Proxy System --- p.58 / Chapter 4.1.1 --- Priority Function --- p.59 / Chapter 4.1.2 --- Two-Stage Replacement Policy --- p.60 / Chapter 4.1.3 --- Caching Policy --- p.61 / Chapter 4.2 --- Performance Evaluation --- p.63 / Chapter 4.2.1 --- Simulation Environment --- p.63 / Chapter 4.2.2 --- Performance Metric --- p.64 / Chapter 4.2.3 --- Results --- p.64 / Chapter 5. --- CONCLUSION --- p.69 / BIBLIOGRAPHY --- p.71

by Mo Chun Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 72-80). / Abstracts in English and Chinese. / Chapter 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- The Mobile Agents --- p.2 / Chapter 1.2 --- The Mobile Agent Paradigm --- p.4 / Chapter 1.2.1 --- Initiatives --- p.5 / Chapter 1.2.2 --- Applications --- p.7 / Chapter 1.3 --- The Mobile Agent S ystem --- p.8 / Chapter 1.4 --- Security in Mobile Agent System --- p.9 / Chapter 1.5 --- Thesis Organization --- p.11 / Chapter 2 --- BACKGROUND AND FOUNDATIONS --- p.12 / Chapter 2.1 --- Encryption/Decryption --- p.12 / Chapter 2.2 --- One-way Hash Function --- p.13 / Chapter 2.3 --- Message Authentication Code (MAC) --- p.13 / Chapter 2.4 --- Homomorphic Encryption Scheme --- p.14 / Chapter 2.5 --- One-Round Oblivious Transfer --- p.14 / Chapter 2.6 --- Polynomial-time Algorithms --- p.14 / Chapter 2.7 --- Circuit --- p.15 / Chapter 3 --- SURVEY OF PROTECTION SCHEMES ON MOBILE AGENTS --- p.16 / Chapter 3.1 --- Introduction --- p.16 / Chapter 3.2 --- Detection Approaches --- p.17 / Chapter 3.2.1 --- Execution Traces --- p.17 / Chapter 3.2.2 --- Partial Result Encapsulation --- p.18 / Chapter 3.2.3 --- State Appraisal --- p.20 / Chapter 3.3 --- Prevention Approaches --- p.20 / Chapter 3.3.1 --- Sliding Encryption --- p.20 / Chapter 3.3.2 --- Tamper-resistant Hardware --- p.21 / Chapter 3.3.3 --- Multi-agent Cooperation --- p.22 / Chapter 3.3.4 --- Code Obfuscation --- p.23 / Chapter 3.3.5 --- Intention Spreading and Shrinking --- p.26 / Chapter 3.3.6 --- Encrypted Function Evaluation --- p.26 / Chapter 3.3.7 --- Black Box Test Prevention --- p.27 / Chapter 3.4 --- Chapter Summary --- p.29 / Chapter 4 --- TAXONOMY OF ATTACKS --- p.30 / Chapter 4.1 --- Introduction --- p.30 / Chapter 4.2 --- Whatis attack? --- p.31 / Chapter 4.3 --- How can attacks be done? --- p.32 / Chapter 4.4 --- Taxonomy of Attacks --- p.33 / Chapter 4.4.1 --- Purposeful Attack --- p.33 / Chapter 4.4.2 --- Frivolous Attack --- p.36 / Chapter 4.4.3 --- The Full Taxonomy --- p.38 / Chapter 4.5 --- Using the Taxonomy --- p.38 / Chapter 4.5.1 --- Match to Existing Protection Schemes --- p.38 / Chapter 4.5.2 --- Insight to Potential Protection Schemes --- p.41 / Chapter 4.6 --- Chapter Summary --- p.42 / Chapter 5 --- PROTECTION FOR REACTIVE MOBILE AGENTS --- p.43 / Chapter 5.1 --- Introduction --- p.43 / Chapter 5.2 --- The Model --- p.45 / Chapter 5.2.1 --- The Non-reactive and Reactive Mobile Agent Model --- p.45 / Chapter 5.2.2 --- The Computation Flow --- p.47 / Chapter 5.2.3 --- An Example --- p.49 / Chapter 5.3 --- tools --- p.51 / Chapter 5.3.1 --- Encrypted Circuit Construction --- p.51 / Chapter 5.3.2 --- Circuit Cascading --- p.53 / Chapter 5.4 --- Proposed Protection Scheme --- p.54 / Chapter 5.4.1 --- Two-hop Protocol --- p.55 / Chapter 5.4.2 --- Multi-hop Protocol --- p.60 / Chapter 5.5 --- Security Analysis --- p.60 / Chapter 5.5.1 --- Security under Purposeful Attacks --- p.61 / Chapter 5.5.2 --- Security under Frivolous Attacks --- p.62 / Chapter 5.6 --- Improvements --- p.62 / Chapter 5.6.1 --- Basic Idea --- p.63 / Chapter 5.6.2 --- Input Retrieval Protocol --- p.63 / Chapter 5.6.3 --- Combating Frivolous Attacks --- p.65 / Chapter 5.7 --- Further Considerations --- p.66 / Chapter 5.8 --- Chapter Summary --- p.67 / Chapter 6 --- CONCLUSIONS --- p.68 / APPENDIX --- p.71 / BIBLIOGRAPHY --- p.72

by Ng Chi Ho. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 64-65). / Abstracts in English and Chinese. / ABSTRACT --- p.I / ACKNOWLEDGEMENT --- p.II / TABLE OF CONTENTS --- p.III / LIST OF TABLES --- p.VI / LIST OF FIGURES --- p.VII / LIST OF ABBREVIATIONS --- p.X / Chapter CHAPTER 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.2 --- Related works --- p.5 / Chapter 1.3 --- Organization of this Thesis --- p.6 / Chapter CHAPTER 2 --- BACKGROUND --- p.7 / Chapter 2.1 --- Introduction to VOD Systems --- p.7 / Chapter 2.1.1 --- Pure unicast VOD System --- p.8 / Chapter 2.1.2 --- Pure multicast VOD System --- p.9 / Chapter 2.1.3 --- Centralized VOD System --- p.9 / Chapter 2.1.4 --- Distributed VOD System --- p.10 / Chapter 2.1.5 --- Hybrid VOD System (DINA) --- p.11 / Chapter 2.1.6 --- Comparisons --- p.12 / Chapter 2.2 --- Interactive Functions --- p.14 / Chapter 2.2.1 --- Speedup --- p.14 / Chapter 2.2.2 --- Split and merge (I and S streams) --- p.14 / Chapter 2.2.3 --- Prerecord --- p.15 / Chapter 2.3 --- Error Recovery --- p.16 / Chapter 2.3.1 --- Pure FEC --- p.17 / Chapter 2.3.2 --- Pure ARQ --- p.17 / Chapter 2.3.3 --- Hybrid ARQ --- p.18 / Chapter 2.3.4 --- Rate-Compatible Punctured Convolutional Codes --- p.18 / Chapter CHAPTER 3 --- HYBRID MULTICAST-UNICAST VOD SYSTEM --- p.21 / Chapter 3.1 --- System Overview --- p.21 / Chapter 3.1.1 --- VSC (Video Server Cluster) --- p.22 / Chapter 3.1.2 --- DIS (Distributed Interactive Server) --- p.24 / Chapter 3.1.3 --- NAK (Negative Acknowledgement Server) --- p.25 / Chapter 3.1.4 --- CS (Client Stations) --- p.26 / Chapter 3.1.5 --- MBN (Multicast Backbone Network) --- p.27 / Chapter 3.1.6 --- LDN (Local Distribution Network) --- p.27 / Chapter 3.2 --- Interactive Functions --- p.28 / Chapter 3.2.1 --- Hybrid Multicast- Unicast --- p.28 / Chapter 3.2.2 --- Pause --- p.30 / Chapter 3.2.3 --- Slow Forward (SF) --- p.33 / Chapter 3.2.4 --- Slow Backward (SB) --- p.35 / Chapter 3.2.5 --- Fast Forward (FF) / Fast Backward (FB) --- p.38 / Chapter 3.2.6 --- Jump Forward (JF) / Jump Backward (JB) --- p.41 / Chapter 3.3 --- System Performance --- p.46 / Chapter 3.3.1 --- System Model --- p.46 / Chapter 3.3.2 --- Simulation Results --- p.47 / Chapter 3.3.3 --- Trade off --- p.53 / Chapter CHAPTER 4 --- DISTRIBUTED TYPE-II HARQ --- p.54 / Chapter 4.1 --- Algorithm Description --- p.54 / Chapter 4.1.1 --- Design details --- p.54 / Chapter 4.1.2 --- Simulation Results --- p.59 / Chapter CHAPTER 5 --- CONCLUSION --- p.62 / BIBLIOGRAPHY --- p.64

by Zhao Lei. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 78-85). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgments --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background --- p.5 / Chapter 2.1 --- Agents --- p.5 / Chapter 2.1.1 --- Deliberative Agents --- p.7 / Chapter 2.1.2 --- Reactive Agents --- p.8 / Chapter 2.1.3 --- Interacting Agents --- p.9 / Chapter 2.1.4 --- Hybrid Architectures --- p.10 / Chapter 2.2 --- Real-time Artificial Intelligence --- p.10 / Chapter 2.3 --- Real-Time Agents --- p.12 / Chapter 2.3.1 --- The Subsumption Architecture --- p.13 / Chapter 2.3.2 --- The InterRAP Architecture --- p.15 / Chapter 2.3.3 --- The 3T Architecture --- p.16 / Chapter 2.4 --- On-line Scheduling in Real-Time Agents --- p.18 / Chapter 3 --- A Real-Time Agent Architecture --- p.20 / Chapter 3.1 --- Human Cognition Model --- p.20 / Chapter 3.1.1 --- Perception --- p.22 / Chapter 3.1.2 --- Cognition --- p.22 / Chapter 3.1.3 --- Action --- p.23 / Chapter 3.2 --- Real-Time Message Passing Primitives and Process Structuring --- p.24 / Chapter 3.2.1 --- Message Passing as IPC --- p.25 / Chapter 3.2.2 --- Administrator and Worker Processes --- p.28 / Chapter 3.3 --- Agent Architecture --- p.29 / Chapter 3.3.1 --- Sensor Workers and the Sensor Administrator --- p.30 / Chapter 3.3.2 --- The Cognition Workers --- p.32 / Chapter 3.3.3 --- "The Task Administrator, the Scheduler Worker and Ex- ecutor Workers" --- p.32 / Chapter 3.4 --- An Agent-Based Real-time Arcade Game --- p.34 / Chapter 4 --- A Multiple Method Approach to Task Scheduling --- p.37 / Chapter 4.1 --- Task Scheduling Mechanism --- p.37 / Chapter 4.1.1 --- Task and Action --- p.38 / Chapter 4.1.2 --- Task Administrator --- p.40 / Chapter 4.1.3 --- Task Scheduler --- p.43 / Chapter 4.2 --- A Task Scheduling Model --- p.44 / Chapter 4.3 --- Combination Rules and Special Cases --- p.46 / Chapter 4.4 --- Scheduling Algorithms --- p.49 / Chapter 5 --- Task Scheduling Model: Analysis and Experiments --- p.53 / Chapter 5.1 --- Goodness Measure --- p.53 / Chapter 5.2 --- Theoretical Analysis --- p.54 / Chapter 5.3 --- Implementation --- p.59 / Chapter 5.3.1 --- Task Generator Implementation --- p.59 / Chapter 5.3.2 --- Executor Workers Implementation --- p.61 / Chapter 5.4 --- Experimental Results --- p.62 / Chapter 5.4.1 --- Hybrid Mechanism and Individual Algorithms --- p.63 / Chapter 5.4.2 --- Effect of Average Execution Time --- p.65 / Chapter 5.4.3 --- Effect of the Greedy Algorithm --- p.65 / Chapter 5.4.4 --- Effect of the Advanced Algorithm --- p.67 / Chapter 5.4.5 --- Effect of Actions and Relations Among Them --- p.68 / Chapter 5.4.6 --- Effect of Deadline --- p.71 / Chapter 6 --- Conclusions --- p.73 / Chapter 6.1 --- Summary of Contributions --- p.73 / Chapter 6.2 --- Future Work --- p.75

Chan, Hing-wing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 76-79). / Abstracts in English and Chinese. / Abstract --- p.i / Abstract (Chinese) --- p.ii / Acknowledgements --- p.iii / Contents --- p.iv / List of Figures --- p.vii / List of Tables --- p.viii / Chapter Chapter 1. --- Introduction --- p.1 / Chapter 1.1. --- Mobile Agents and the Problems --- p.1 / Chapter 1.2. --- Approach --- p.3 / Chapter 1.3. --- Contributions --- p.3 / Chapter 1.4. --- Organization of This Thesis --- p.4 / Chapter Chapter 2. --- The Mobile Code Paradigm --- p.6 / Chapter 2.1. --- Mobile Code: an Alternative to Client/Servers --- p.6 / Chapter 2.1.1. --- Classification of Mobile Codes --- p.8 / Chapter 2.1.2. --- Applications of Mobile Code Paradigms --- p.10 / Chapter 2.1.3. --- Supporting Implementation Technologies --- p.11 / Chapter 2.2. --- The Problems of Mobile Code --- p.13 / Chapter 2.2.1. --- Security Issues in Distributed Systems --- p.13 / Chapter 2.2.2. --- Security Concerns of Mobile Code Paradigms --- p.15 / Chapter 2.2.2.1. --- Security Attacks --- p.15 / Chapter 2.2.2.2. --- Security Mechanisms --- p.17 / Chapter 2.2.2.3. --- A Security Comparison between Paradigms --- p.20 / Chapter 2.2.3. --- Security Features of Implementation Technologies --- p.20 / Chapter 2.2.3.1. --- Security Services of Message-based Technology --- p.21 / Chapter 2.2.3.2. --- Security Services of Object-based Technology --- p.21 / Chapter 2.2.3.3. --- Security Services of Mobile Technology --- p.22 / Chapter 2.2.3.4. --- A Comparison of Technologies on Security Services --- p.22 / Chapter 2.3. --- Chapter Summary --- p.23 / Chapter Chapter 3. --- "Mobile Agents, Its Security and Reliability Issues" --- p.24 / Chapter 3.1. --- Advantages and Applications of Mobile Agents --- p.24 / Chapter 3.2. --- Security Concerns of Mobile Agents --- p.26 / Chapter 3.2.1. --- Host Security --- p.27 / Chapter 3.2.2. --- Agent Security --- p.27 / Chapter 3.3. --- Techniques to Protect Mobile Agents --- p.29 / Chapter 3.3.1. --- Protected Agent States --- p.29 / Chapter 3.3.2. --- Mobile Cryptography --- p.30 / Chapter 3.4. --- Reliability Concerns of Mobile Agents --- p.31 / Chapter Chapter 4. --- Security and Reliability Modeling for Mobile Agents --- p.32 / Chapter 4.1. --- Attack Model and Scenarios --- p.33 / Chapter 4.2. --- General Security Models --- p.34 / Chapter 4.2.1. --- Security and Reliability --- p.34 / Chapter 4.2.2. --- Deriving Security Models --- p.36 / Chapter 4.2.3. --- The Time-to-Effort Function --- p.38 / Chapter 4.3. --- A Security Model for Mobile Agents --- p.40 / Chapter 4.4. --- Discussion of the Proposed Model --- p.43 / Chapter 4.5. --- A Reliability Model for Mobile Agents --- p.43 / Chapter Chapter 5. --- The Concordia Mobile Agent Platform --- p.46 / Chapter 5.1. --- Overview --- p.46 / Chapter 5.2. --- Special Features --- p.47 / Chapter Chapter 6. --- SIAS: A Shopping Information Agent System --- p.49 / Chapter 6.1. --- What the System Does --- p.49 / Chapter 6.2. --- System Design --- p.50 / Chapter 6.2.1. --- Object Description --- p.50 / Chapter 6.2.2. --- Flow Description --- p.52 / Chapter 6.3. --- Implementation --- p.53 / Chapter 6.3.1. --- Choice of Programming Language --- p.53 / Chapter 6.3.2. --- Choice of Mobile Agent Platform --- p.53 / Chapter 6.3.3. --- Other Implementation Details --- p.54 / Chapter 6.4. --- Snapshots --- p.54 / Chapter 6.5. --- Security Design of SIAS --- p.57 / Chapter 6.5.1. --- Security Problems of SIAS --- p.58 / Chapter 6.5.2. --- Our Solutions to the Problems --- p.60 / Chapter 6.5.3. --- Evaluation of the Secure SIAS --- p.64 / Chapter 6.5.3.1. --- Security Analysis --- p.64 / Chapter 6.5.3.2. --- Performance Vs Query Size --- p.65 / Chapter 6.5.3.3. --- Performance Vs Number of Hosts --- p.67 / Chapter 6.6. --- Reliability Design of SIAS --- p.69 / Chapter 6.6.1. --- Reliability Problems of SIAS --- p.69 / Chapter 6.6.2. --- Our Solutions to the Problems --- p.70 / Chapter 6.6.3. --- Evaluation of the Reliable SIAS --- p.71 / Chapter Chapter 7. --- Conclusions and Future Work --- p.73 / Bibliography --- p.76

Lee Ting-on. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 116-121). / Abstracts in English and Chinese. / Acknowledgments --- p.i / Abstract --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Roadmap to the Thesis --- p.5 / Chapter 2 --- Software Agents and Agent Frameworks --- p.7 / Chapter 2.1 --- Software Agent --- p.7 / Chapter 2.1.1 --- Advantages of Agent --- p.10 / Chapter 2.1.2 --- Roles of Agent --- p.11 / Chapter 2.2 --- Agent Frameworks --- p.13 / Chapter 2.3 --- Communication Services and Concepts --- p.15 / Chapter 2.3.1 --- Message Channel --- p.15 / Chapter 2.3.2 --- Remote Procedure Call --- p.16 / Chapter 2.3.3 --- Event Channel --- p.17 / Chapter 2.4 --- Component --- p.18 / Chapter 3 --- Related Work --- p.20 / Chapter 3.1 --- Collaboration Behaviors --- p.20 / Chapter 3.2 --- Direct Coordination --- p.22 / Chapter 3.3 --- Meeting-oriented Coordination --- p.23 / Chapter 3.4 --- Blackboard-based Coordination --- p.24 / Chapter 3.5 --- Linda-like Coordination --- p.25 / Chapter 3.6 --- Reactive Tuple Spaces --- p.26 / Chapter 4 --- Background and Foundations --- p.27 / Chapter 4.1 --- Choice of Technologies --- p.27 / Chapter 4.2 --- Jini Technology --- p.28 / Chapter 4.2.1 --- The Lookup Service --- p.29 / Chapter 4.2.2 --- Proxy --- p.31 / Chapter 4.3 --- JavaSpaces --- p.32 / Chapter 4.4 --- Grasshopper Architecture --- p.33 / Chapter 5 --- The CoDAC Framework --- p.36 / Chapter 5.1 --- Requirements for Enabling Collaboration --- p.37 / Chapter 5.1.1 --- Consistent Group Membership --- p.37 / Chapter 5.1.2 --- Atomic Commitment --- p.39 / Chapter 5.1.3 --- Uniform Reliable Multicast --- p.40 / Chapter 5.1.4 --- Fault Tolerance --- p.40 / Chapter 5.2 --- System Components --- p.41 / Chapter 5.2.1 --- Distributed Agent Adapter --- p.42 / Chapter 5.2.2 --- CollaborationCore --- p.44 / Chapter 5.3 --- System Infrastructure --- p.45 / Chapter 5.3.1 --- Agent --- p.45 / Chapter 5.3.2 --- Distributed Agent Manager --- p.46 / Chapter 5.3.3 --- Collaboration Manager --- p.46 / Chapter 5.3.4 --- Kernel --- p.46 / Chapter 5.4 --- Collaboration --- p.47 / Chapter 5.5.1 --- Global Collaboration --- p.48 / Chapter 5.5.2 --- Local Collaboration --- p.48 / Chapter 6 --- Collaboration Life Cycle --- p.50 / Chapter 6.1 --- Initialization --- p.50 / Chapter 6.2 --- Resouces Gathering --- p.53 / Chapter 6.3 --- Results Delivery --- p.54 / Chapter 7 --- Protocol Suite --- p.55 / Chapter 7.1 --- The Group Membership Protocol --- p.56 / Chapter 7.1.1 --- Join Protocol --- p.56 / Chapter 7.1.2 --- Leave Protocol --- p.57 / Chapter 7.1.3 --- Recovery Protocol --- p.59 / Chapter 7.1.4 --- Proof --- p.61 / Chapter 7.2 --- Atomic Commitment Protocol --- p.62 / Chapter 7.3 --- Uniform Reliable Multicast --- p.63 / Chapter Chapter 8 --- Implementation --- p.66 / Chapter 8.1 --- Interfaces and Classes --- p.66 / Chapter 8.1.1 --- The CoDACAdapterInterface --- p.66 / Chapter 8.1.2 --- The CoDACEventListener --- p.69 / Chapter 8.1.3 --- The DAAdapter --- p.71 / Chapter 8.1.4 --- The DAManager --- p.75 / Chapter 8.1.5 --- The CoDACInternalEventListener --- p.77 / Chapter 8.1.6 --- The CollaborationManager --- p.77 / Chapter 8.1.7 --- The CollaborationCore --- p.78 / Chapter 8.2 --- Messaging Mechanism --- p.79 / Chapter 8.3 --- Nested Transaction --- p.84 / Chapter 8.4 --- Fault Detection --- p.85 / Chapter 8.5 --- Atomic Commitment Protocol --- p.88 / Chapter 8.5.1 --- Message Flow --- p.89 / Chapter 8.5.2 --- Timeout Actions --- p.91 / Chapter Chapter 9 --- Example --- p.93 / Chapter 9.1 --- System Model --- p.93 / Chapter 9.2 --- Auction Lifecycle --- p.94 / Chapter 9.2.1 --- Initialization --- p.94 / Chapter 9.2.2 --- Resource Gathering --- p.98 / Chapter 9.2.3 --- Results Delivery --- p.100 / Chapter Chapter 10 --- Discussions --- p.104 / Chapter 10.1 --- Compatibility --- p.104 / Chapter 10.2 --- Hierarchical Group Infrastructure --- p.106 / Chapter 10.3 --- Flexibility --- p.107 / Chapter 10.4 --- Atomicity --- p.108 / Chapter 10.5 --- Fault Tolerance --- p.109 / Chapter Chapter 11 --- Conclusion and Future Work --- p.111 / Chapter 11.1 --- Conclusion --- p.111 / Chapter 11.2 --- Future Work --- p.112 / Chapter 11.2.1 --- Electronic Commerce --- p.112 / Chapter 11.2.2 --- Workflow Management --- p.114 / Bibliography --- p.116 / Publication List --- p.121

Zhang, Yupeng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 45-48). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts also in Chinese.

To Ka Ki. / Thesis submitted in: August 2005. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 55-56). / Abstracts in English and Chinese. / Acknowledgement --- p.i / Abstract --- p.ii / 摘要 --- p.iii / Chapter Chapter 1 --- INTRODUCTION --- p.5 / Chapter Chapter 2 --- related WORKS --- p.12 / Chapter Chapter 3 --- Decentralization of Periodic Broadcasting --- p.16 / Chapter 3.1 --- Staggered Broadcasting --- p.16 / Chapter 3.2 --- Modified Staggered Broadcasting --- p.17 / Chapter Chapter 4 --- PEERS SYNCHRONIZATION --- p.21 / Chapter 4.1 --- Integrating PCS with Periodic Broadcasting --- p.22 / Chapter 4.2 --- Distributed PCS --- p.23 / Chapter Chapter 5 --- Performance Evaluations of Decentralized Periodic Broadcasting Architecture --- p.27 / Chapter 5.1 --- Sensitivity to Clock Drift --- p.28 / Chapter 5.2 --- System Dynamic Behavior --- p.30 / Chapter Chapter 6 --- P-NICE --- p.33 / Chapter 6.1 --- The Original NICE Protocol --- p.34 / Chapter 6.2 --- Parallel Overlay Architecture --- p.35 / Chapter 6.3 --- Control Overheads --- p.37 / Chapter Chapter 7 --- Performance Evaluations of P-NICE --- p.39 / Chapter 7.1 --- End-to-End Packet Delivery Ratio --- p.40 / Chapter 7.2 --- Utilization of Network Links --- p.41 / Chapter 7.3 --- Convergence Time of End-to-End Packet Delivery Ratio --- p.44 / Chapter 7.4 --- Effect of Number of Overlays --- p.45 / Chapter 7.5 --- End-to-End Data Delivery Delay --- p.47 / Chapter 7.6 --- Load Balance of Overlays --- p.47 / Chapter 7.7 --- Peers Reception Quality --- p.48 / Chapter 7.8 --- Control Overheads --- p.51 / Chapter Chapter 8 --- Conclusions --- p.53 / Bibliography --- p.55

The price of computers has dropped drastically over the past years enabling many households to have at least one computer. At the same time, the performance of computers has skyrocketed, far surpassing what a typical user needs, and most of the computational power of personal computers is wasted. Volunteer computing projects attempt to use this wasted computational power in order to solve problems that would otherwise be computationally infeasible. Some of these problems include medical applications like searching for cures for AIDS and cancer. However, the number of volunteer computing projects is increasing rapidly, requiring improvements in the field of volunteer computing to enable the increasing number of volunteer projects to continue making significant progress. This dissertation examines two ways to increase the productivity of volunteer computing: using the volunteered CPU cycles more effectively and exploring ways to increase the amount of CPU cycles that are donated. Each of the existing volunteer computing projects uses one of two task retrieval policies to enable the volunteered computers participating in projects to retrieve work. This dissertation compares the amount of work completed by the volunteered computers participating in projects based on which of the two task retrieval techniques the project employs. Additional task retrieval policies are also proposed and evaluated. The most commonly used task retrieval policy is shown to be less effective than both the less frequently used policy and a proposed policy. The potential that video game consoles have to be used for volunteer computing is explored, as well as the potential benefits of constructing different types of volunteer computing clients, rather than the most popular client implementation: the screensaver. In addition to examining methods of increasing the productivity of volunteer computing, 140 traces of computer usage detailing when computers are available to participate in volunteer computing is collected and made publicly available. Volunteer computing project-specific information that can be used in researching how to improve volunteer computing is collected and combined into the first summary of which we are aware.