Photocopy of typescript. / Digitized by Kansas Correctional Industries

Photocopy of typescript. / Digitized by Kansas Correctional Industries

Photocopy of typescript. / Digitized by Kansas Correctional Industries

Photocopy of typescript. / Digitized by Kansas Correctional Industries

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Law Chi Hung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 86-91). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Contents --- p.v / List of Figures --- p.viii / List of Tables --- p.x / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.4 / Chapter 1.2 --- Thesis Organization --- p.7 / Chapter 2 --- Literature Review --- p.9 / Chapter 2.1 --- Logical Time --- p.9 / Chapter 2.1.1 --- Event Model --- p.9 / Chapter 2.1.2 --- Lamport's Logical Clock --- p.10 / Chapter 2.1.3 --- Mattern's Vector Time --- p.14 / Chapter 2.2 --- Snapshot Algorithms --- p.18 / Chapter 2.2.1 --- Preliminaries --- p.19 / Chapter 2.2.2 --- Chandy-Lamport --- p.22 / Chapter 2.2.3 --- Lai-Yang and Mattern --- p.24 / Chapter 2.2.4 --- Sato --- p.25 / Chapter 3 --- Ad-hoc Network System --- p.29 / Chapter 3.1 --- Event Model --- p.30 / Chapter 3.2 --- Snapshot Problem --- p.32 / Chapter 4 --- Time Approximation in Distributed Systems --- p.37 / Chapter 4.1 --- Definitions --- p.38 / Chapter 4.1.1 --- Preliminary --- p.38 / Chapter 4.1.2 --- Event Ordering --- p.39 / Chapter 4.1.3 --- Clock --- p.40 / Chapter 4.1.4 --- Time Approximation Levels --- p.41 / Chapter 4.1.5 --- Offline Algorithm --- p.41 / Chapter 4.2 --- Time Approximation in Static Network Systems --- p.42 / Chapter 4.2.1 --- Stable Snapshot --- p.43 / Chapter 4.2.2 --- Snapshot --- p.50 / Chapter 4.2.3 --- Latest Snapshot --- p.52 / Chapter 4.2.4 --- Time Approximation Levels --- p.54 / Chapter 4.3 --- Time Approximation in Ad-hoc Network Systems --- p.54 / Chapter 4.3.1 --- Snapshot --- p.56 / Chapter 4.3.2 --- Latest Snapshot --- p.61 / Chapter 4.3.3 --- Time Approximation Levels --- p.61 / Chapter 4.3.4 --- Bi-vector Clock --- p.63 / Chapter 4.3.5 --- Strong Snapshot Problem --- p.67 / Chapter 5 --- Snapshot Algorithm for Ad-hoc Network Systems --- p.69 / Chapter 5.1 --- Algorithm --- p.70 / Chapter 5.1.1 --- Notations --- p.70 / Chapter 5.1.2 --- Rules of Maintaining Si and Ti in Pi --- p.72 / Chapter 5.1.3 --- The Properties --- p.73 / Chapter 5.1.4 --- Algorithm --- p.78 / Chapter 5.2 --- Enhancements --- p.82 / Chapter 5.2.1 --- Reduction of Stored States and Exchanged Logs --- p.82 / Chapter 5.2.2 --- LCC Synchronization --- p.82 / Chapter 6 --- Conclusion --- p.84 / Bibliography --- p.86 / Publications --- p.91

Zhang Xinyan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves [78]-[85]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Multiple Point Communication --- p.1 / Chapter 1.2 --- Major Contributions --- p.2 / Chapter 1.3 --- Thesis Organization --- p.4 / Chapter 2 --- Related Work --- p.5 / Chapter 2.1 --- Peer-to-Peer Networks --- p.5 / Chapter 2.2 --- Application Layer Multicast --- p.11 / Chapter 2.3 --- Internet Traffic Engineering --- p.19 / Chapter 3 --- MultiServ: Application Layer Multiple Path Routing --- p.23 / Chapter 3.1 --- Motivation --- p.24 / Chapter 3.2 --- MultiServ Overlay Construction --- p.28 / Chapter 3.3 --- MultiServ Routing --- p.33 / Chapter 3.3.1 --- The importance of routing strategy --- p.33 / Chapter 3.3.2 --- Solutions for IP network --- p.35 / Chapter 3.3.3 --- MultiServ routing --- p.37 / Chapter 3.3.4 --- MultiServ routing with bounded complexity --- p.39 / Chapter 3.3.5 --- Routing implementation --- p.41 / Chapter 3.4 --- Performance Evaluation --- p.45 / Chapter 3.4.1 --- End-to-end streaming --- p.45 / Chapter 3.4.2 --- Application-layer multicast --- p.50 / Chapter 3.4.3 --- Experiments in real network --- p.54 / Chapter 3.5 --- Summary and Future Work --- p.57 / Chapter 4 --- DDS: Distributed Dynamic Streaming --- p.59 / Chapter 4.1 --- Motivation --- p.59 / Chapter 4.2 --- Distributed Dynamic Streaming --- p.61 / Chapter 4.2.1 --- DDS overlay construction --- p.62 / Chapter 4.2.2 --- DDS streaming --- p.64 / Chapter 4.3 --- Performance Analysis in Dynamic User Environment --- p.66 / Chapter 4.3.1 --- Basic definition and user model --- p.67 / Chapter 4.3.2 --- Data outage in tree topology --- p.68 / Chapter 4.3.3 --- Data outage in DDS --- p.70 / Chapter 4.4 --- Performance Evaluation --- p.73 / Chapter 4.4.1 --- Simulation setup --- p.73 / Chapter 4.4.2 --- Simulation results --- p.74 / Chapter 4.5 --- Summary and Future Work --- p.75 / Chapter 5 --- Concluding Remarks --- p.76 / Bibliography --- p.77

Computing consistent global states in a distributed system is a fundamental problem. A large class of distributed system problems can be cast as construction of consistent global states and evaluation of relevant properties over these global states. Examples of such problems include the monitoring and debugging of distributed systems, the detection of stable properties such as deadlock, termination, and loss of tokens, protocol specification and verification, garbage collection, checkpointing and failure recovery, and many others. / Finally, we will present a suit of three new snapshot algorithms for mobile ad hoc network systems: cooperative, localized, and centralized. These new snapshot algorithms have different timing and tailoring components, Compared to existing snapshot algorithms, our snapshot algorithms can be proven to work in the presence of node mobility and dynamic topology changes, i.e., all of them can compute consistent global states in a mobile ad hoc network system. We will also evaluate the effectiveness and efficiency of these newly proposed snapshot algorithms by using extensive simulations. / Firstly, we will develop a system model for a mobile ad hoc network system. In addition to the internal, send and receive events that are considered in a traditional system model for static systems, two novel types of events called on and off are introduced to represent dynamic topology changes in our system model. Based on these on and off events, it is convenient to devise new distributed algorithms that can handle dynamic topology changes for the mobile ad hoc network environment. We will also propose a new relation called the extended-happened-before relation, which is generalized from the well-known happened-before relation defined by Lamport, to fully model the ordering of events in a mobile ad hoc network system. The event orders captured by the extended-happened-before relation playa critical role in solving the snapshot problem at hand. / However, consistent global states are not freely available in distributed systems without shared memory and synchronized clocks. In the literature, the fundamental problem of constructing consistent global states in a distributed system was defined as the snapshot problem. Although many solutions to the snapshot problem have been developed for various types of distributed systems, most of them cannot be applied directly to a mobile ad hoc network system, which has no fixed network infrastructure for operating support and may experience dynamic topology changes due to node mobility. In this thesis, we present a systematic study on the snapshot problem in mobile ad hoc network systems. / Secondly, we will derive a new consistency criterion for constructing a global state in a mobile ad hoc network system. Without a common time base and shared memory, the development of the new consistency criterion sticks to the fundamental principle that if the events for recording the local states are ensured to be concurrent, then the recorded local states are equivalent to those that are recorded simultaneously in real time and the resulting global state is guaranteed to be consistent. Importantly, we will also show a consistency theorem, which gives a necessary and sufficient condition for computing consistent global states in a mobile ad hoc network system. That is, a global state of a mobile ad hoc network system is consistent if and only if its corresponding cut is not only causally consistent but also topologically consistent. / Thirdly, we will propose a simple method called timing-and-tailoring to design and analyze snapshot algorithms in a well structured approach. In this generic method, a snapshot algorithm is decomposed into two basic components. The first component called timing is used to record the ordering of events by using logical time algorithms. The second component called tailoring is used to find a consistent global state based on known event ordering. To demonstrate the proposed timing-and-tailoring method, we will also present several examples of using this method to design and analyze snapshot algorithms. These examples provide helpful insights in designing new snapshot algorithms for mobile ad hoc network systems. / Wu, Dan. / Adviser: Man Hon Wong. / Source: Dissertation Abstracts International, Volume: 73-04, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 135-145). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Wong, Yuk Yin. / "December 2002." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (p. 193-206). / 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. / Abstracts in English and Chinese.