Sun Tong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 77-81). / Abstracts in English and Chinese. / Chinese Abstract --- p.I / Abstract --- p.II / Acknowledgements --- p.III / List of Contents --- p.IV / List of Figures --- p.VII / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Multicast Routing Problem --- p.1 / Chapter 1.2 --- Constrained multicast routing problem and SSRA algorithm --- p.4 / Chapter 1.3 --- Thesis organization --- p.7 / Chapter Chapter 2 --- Constrained Multicast Routing Algorithms --- p.8 / Chapter 2.1 --- Steiner tree heuristic --- p.8 / Chapter 2.1.1 --- Shortest Paths Heuristic --- p.9 / Chapter 2.1.2 --- Distance Network Heuristic --- p.10 / Chapter 2.2 --- Review of existing constrained multicast routing algorithms --- p.10 / Chapter 2.2.1 --- Static group member --- p.10 / Chapter 2.2.2 --- Dynamic group member --- p.14 / Chapter 2.2.2.1 --- Non-rearrangeable --- p.15 / Chapter 2.2.2.2 --- Rearrangeable --- p.23 / Chapter Chapter 3 --- Small Scale Rearrangement Algorithm for Multicast Routing --- p.32 / Chapter 3.1 --- Problem formulation --- p.32 / Chapter 3.1.1 --- Network Model --- p.32 / Chapter 3.1.2 --- Problem Specification --- p.33 / Chapter 3.1.3 --- Definitions and Notations --- p.36 / Chapter 3.2 --- Local Checking Scheme (LCS) --- p.37 / Chapter 3.3 --- Small Scale Rearrangement Algorithm (SSRA) for Multicast Routing --- p.41 / Chapter 3.3.1 --- Static group membership --- p.42 / Chapter 3.3.2 --- Dynamic group membership --- p.43 / Chapter 3.3.2.1 --- Node addition --- p.44 / Chapter 3.3.2.2 --- Node removal --- p.44 / Chapter 3.3.2.3 --- General steps --- p.45 / Chapter 3.3.2.4 --- Example --- p.47 / Chapter Chapter 4 --- Analysis --- p.50 / Chapter Chapter 5 --- Simulations --- p.54 / Chapter 5.1 --- Simulation Model --- p.54 / Chapter 5.2 --- Simulation Parameters Parameter Default Value/Generating Method --- p.56 / Chapter 5.3 --- Performance Metrics --- p.58 / Chapter 5.4 --- Discussion of Results --- p.59 / Chapter 5.4.1 --- Group 1: static group membership --- p.59 / Chapter 5.4.2 --- Group 2: dynamic group membership --- p.63 / Chapter 5.4.3 --- Comparison --- p.69 / Chapter 5.5 --- Implementation Issue --- p.73 / Chapter Chapter 6 --- Conclusion --- p.75 / Reference --- p.77

Wan, Yujie. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 52-56). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Nonblocking Conditions of Three-stage Clos Networks --- p.2 / Chapter 1.2 --- Previous Works on Unicast Nonblocking Conditions --- p.4 / Chapter 1.3 --- Previous Works on Multicast Nonblocking Conditions --- p.7 / Chapter 1.4 --- Thesis Organization and Contributions --- p.9 / Chapter 2 --- Unified Coloring Framework --- p.11 / Chapter 2.1 --- Conflict Graph of Multicast Calls --- p.11 / Chapter 2.2 --- Check of Unicast Nonblocking Conditions --- p.17 / Chapter 2.3 --- Call Splitting and Hardware Models --- p.20 / Chapter 3 --- SNB Conditions --- p.24 / Chapter 3.1 --- Model 1 --- p.25 / Chapter 3.2 --- "Model 0, 2, and 3" --- p.26 / Chapter 3.2.1 --- Worst-Case Call Splitting --- p.26 / Chapter 3.2.2 --- Proof of Nonblocking Conditions --- p.27 / Chapter 3.3 --- Comparison and Discussion --- p.31 / Chapter 4 --- WSNB and RNB Conditions --- p.33 / Chapter 4.1 --- Review of Results for Model 1 --- p.33 / Chapter 4.2 --- Review of Results for Model 2 --- p.35 / Chapter 4.3 --- New Results for Model 3 --- p.36 / Chapter 4.3.1 --- Proof of Nonblocking Conditions --- p.36 / Chapter 4.3.2 --- WSNB Routing Algorithm --- p.39 / Chapter 4.3.3 --- Comparison and Discussion --- p.40 / Chapter 4.4 --- New Results for Model 0 --- p.41 / Chapter 4.4.1 --- Equivalence between RNB Condition and K-partite Vertex Coloring --- p.41 / Chapter 4.4.2 --- Proof of Nonblocking Conditions --- p.43 / Chapter 4.4.3 --- Comparison and Discussion --- p.47 / Chapter 5 --- Conclusion and Future Work --- p.49 / Bibliography --- p.52

by Yiu Sau Yan Vincent. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 86-88). / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Related Works --- p.3 / Chapter 2.1 --- Tightly-coupled Parallel Systems --- p.5 / Chapter 2.2 --- Loosely-coupled Parallel Systems --- p.6 / Chapter 3 --- Communication Protocol --- p.11 / Chapter 3.1 --- Terminology --- p.12 / Chapter 3.2 --- CUP Model --- p.14 / Chapter 3.3 --- Message Format --- p.15 / Chapter 3.4 --- Message Header --- p.16 / Chapter 3.5 --- Message Content - Control Message --- p.17 / Chapter 3.6 --- Message Transfer Functions --- p.18 / Chapter 3.7 --- Application Development --- p.22 / Chapter 4 --- Multiple Computer Infrastructure --- p.28 / Chapter 4.1 --- Application Supper --- p.32 / Chapter 4.1.1 --- Send and Receive --- p.34 / Chapter 4.1.2 --- Multicast --- p.35 / Chapter 4.1.3 --- Barrier Synchronization --- p.36 / Chapter 4.1.4 --- Start and Delete Process --- p.37 / Chapter 4.2 --- Local Message Routing --- p.39 / Chapter 4.2.1 --- Berkeley Socket --- p.40 / Chapter 4.2.2 --- System V Message Queue --- p.45 / Chapter 4.2.3 --- Shared Memory Queue SMQ --- p.47 / Chapter 4.3 --- Network Message Routing --- p.49 / Chapter 4.3.1 --- Ethernet & TCP Socket --- p.51 / Chapter 4.3.2 --- SCSI Link --- p.52 / Chapter 5 --- System Supporting Facilities --- p.54 / Chapter 5.1 --- Kernel Message Support --- p.54 / Chapter 5.2 --- SCSI Hardware & Device Driver --- p.60 / Chapter 5.2.1 --- SCSI Bus Operations --- p.61 / Chapter 5.2.2 --- Device Driver Internals --- p.65 / Chapter 6 --- Performance --- p.73 / Chapter 7 --- Conclusion --- p.83 / Chapter 7.1 --- Summary of Our Research --- p.83 / Chapter 7.2 --- Future Researches --- p.84

Digitized by Kansas Correctional Industries

No description available.

Computing the reliability of a network is a #P-complete problem, therefore estimation by means of simulation often becomes a favourable choice. In modern communication networks, link failure probabilities are usually small and hence network failures become rare events. This poses a challenge to estimate the network reliability. In this thesis we present different techniques for network reliability estimation. There are two main sampling techniques in reliability estimation: combinatorial and permutational sampling. Combinatorial sampling has the advantage of speed but has poor performance in rare event simulations. Permutational sampling gives good simulation performance but at a higher computational cost. We combine the two techniques and propose a hybrid sampling scheme called Tree Cut and Merge. By employing simple bounding together with clever conditional sampling, the TCM scheme achieves over 10(superscript 7) times speed up in certain classes of heterogeneous networks. The Crude Monte Carlo (combinatorial) component in the Tree Cut and Merge scheme may cause problems in some situations. In bad cases, the slow convergence problem re-appears. To address the problem, we modifed the scheme by introducing the Importance Sampling technique. The new Tree Cut and Merge with Importance Sampling scheme maintained the speed advantage of the Tree Cut and Merge and minimizes, at the same time, the potential problems caused by the Crude Monte Carlo component. Associated with the Importance Sampling technique, a new technique called the Cross-Entropy method has been developed in the late 90's to find the optimal Importance Sampling parameters. By employing the Cross-Entropy technique, we propose a new scheme called the Merge Process with Cross-Entropy. The new scheme improves the Merge Process in nearly all classes of network; in contrast, Tree Cut and Merge with Importance Sampling scheme sees the greatest improvement in heterogeneous networks. Besides estimating the reliability of a single network, this thesis also investigates a closely related problem: estimating the difference in reliability of two very similar networks. The problem is closely linked to the applications in the areas of network optimization, network evolution, reconfiguration and recovery, for example. The fact that the probabilities of rare events are hard to estimate makes estimating their difference even more difficult. Coupled and differential sampling techniques are proposed and applied to various schemes in this thesis. They prove to be superior to the conventional independent "estimate and subtract" method. Interestingly, these concepts also lead to new ideas regarding the estimation of the reliability of networks that are similar to networks with polynomially computable reliability. / Thesis (Ph.D.)--School of Mathematical Sciences, 2005.

Thesis (M. Soc. Sc.)--University of Hong Kong, 2006.

Thesis (M.S.)--Rutgers University, 2009. / "Graduate Program in Computer Science." Includes bibliographical references (p. 60-63).

Thesis (M.S. in Computer Science)--Naval Postgraduate School, December 2009. / Thesis Advisor(s): Fulp, J. D. ; Huffmire, Ted. "December 2009." Description based on title screen as viewed on February 01, 2010. Author(s) subject terms: Authentication protocols, taxonomy, protocol classification, protocol applicability, operating environment. Includes bibliographical references (p. 69-72). Also available in print.

Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from UMI Company.