Typescript, etc. / Digitized by Kansas Correctional Industries

No description available.

Fung, Wai Shing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 70-76). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Overview --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.1.1 --- Network Design --- p.1 / Chapter 1.1.2 --- Degree Bounded Network Design --- p.3 / Chapter 1.1.3 --- Degree Bounded Vertex Connectivity Network Design --- p.6 / Chapter 1.2 --- Our Results --- p.7 / Chapter 1.2.1 --- Problem Definition --- p.8 / Chapter 1.2.2 --- Main Result --- p.8 / Chapter 1.2.3 --- Organization of This Thesis --- p.9 / Chapter 1.3 --- Algorithm Outline --- p.10 / Chapter 1.3.1 --- Christofides' Algorithm for TSP --- p.10 / Chapter 1.3.2 --- Extending Christofides´ة Algorithm to K > 2 --- p.12 / Chapter 1.3.3 --- Bienstock et al´ةs Splitting-Off Theorem --- p.13 / Chapter 2 --- Basics --- p.18 / Chapter 2.1 --- Notations and Terminology --- p.18 / Chapter 2.2 --- .Menger's Theorem --- p.20 / Chapter 2.3 --- Submodular Functions --- p.21 / Chapter 2.4 --- Use of Submodularity in Proofs of Splitting-Off Theorems --- p.22 / Chapter 2.5 --- Splitting-Off Concerning Edge Connectivity --- p.27 / Chapter 2.6 --- Splitting-Off Concerning Vertex Connectivity --- p.30 / Chapter 2.7 --- Vertex Connectivity Network Design --- p.32 / Chapter 2.7.1 --- Rooted Connectivity --- p.33 / Chapter 2.7.2 --- Global Connectivity --- p.35 / Chapter 2.7.3 --- Generalized Steiner Network --- p.36 / Chapter 2.8 --- Network Design with Metric Cost --- p.37 / Chapter 2.8.1 --- Minimum Cost K-Vertex-Connected Subgraph --- p.38 / Chapter 2.8.2 --- Degree Bounded Minimum Spanning Tree --- p.40 / Chapter 3 --- Minimum Degree K-Vertex-Connected Subgraph --- p.42 / Chapter 3.1 --- Preliminary --- p.44 / Chapter 3.1.1 --- Tight Sets --- p.44 / Chapter 3.1.2 --- (xxi)-Critical Sets --- p.46 / Chapter 3.2 --- Splitting-Off with Parallel Edges --- p.47 / Chapter 3.2.1 --- When Does Replacement Fail? --- p.48 / Chapter 3.2.2 --- Deriving a Special Structure --- p.50 / Chapter 3.2.3 --- Such Structure Is Impossible --- p.50 / Chapter 3.3 --- Splitting-Off with Redundant Edges --- p.50 / Chapter 3.3.1 --- Proof Outline --- p.51 / Chapter 3.3.2 --- When Does Splitting-Off Fail? --- p.54 / Chapter 3.3.3 --- Admissible Pairs Exists If Two Redundant Edges Are Present --- p.57 / Chapter 3.3.4 --- Proof of Property(T*) --- p.58 / Chapter 3.3.5 --- Existence of Jointly Admissible Pairs --- p.62 / Chapter 3.4 --- Main Algorithm --- p.66 / Chapter 4 --- Concluding Remarks --- p.69 / Bibliography --- p.70

Yung, Chun Kong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 121-129). / Abstracts in English and Chinese. / Chapter 1 --- Overview --- p.2 / Chapter 2 --- Background --- p.7 / Chapter 2.1 --- Graphs and Edge-connectivitv --- p.7 / Chapter 2.1.1 --- Subgraphs --- p.9 / Chapter 2.1.2 --- Cut and Edge-Connectivitv --- p.10 / Chapter 2.1.3 --- Menger's Theorem --- p.12 / Chapter 2.2 --- Edge Splitting-off --- p.13 / Chapter 2.2.1 --- The Basics --- p.15 / Chapter 2.2.1.1 --- Supermodular and Submodular Set Functions --- p.16 / Chapter 2.2.1.2 --- Set Functions regarding Edge-Connectivity --- p.17 / Chapter 2.2.1.3 --- Dangerous and Tight Sets --- p.18 / Chapter 2.2.2 --- Proof of Mader's Theorem --- p.20 / Chapter 2.2.3 --- Global Arc-Connectivity Setting --- p.23 / Chapter 2.2.3.1 --- Local Arc-Connectivity Setting --- p.25 / Chapter 2.2.4 --- Incorporating Additional Properties --- p.26 / Chapter 2.2.4.1 --- Non-Admissibility Graph Method --- p.27 / Chapter 2.3 --- Edge-Connectivity Problems --- p.29 / Chapter 2.3.1 --- Degree Bounded Network Design Problems --- p.30 / Chapter 2.3.1.1 --- Metric Cost Assumption --- p.31 / Chapter 2.3.2 --- Edge-Connectivitv Augmentation Problems --- p.33 / Chapter 2.3.2.1 --- Prank's Framework --- p.34 / Chapter 2.3.2.2 --- Constrained Edge-Connectivity Augmentation Problems --- p.36 / Chapter 2.3.3 --- Edge Splitting-off Problems --- p.39 / Chapter 2.4 --- Edge Splitting-off Algorithms --- p.40 / Chapter 2.4.1 --- Fastest Algorithms --- p.41 / Chapter 2.4.2 --- An Intuitive Approach --- p.42 / Chapter 2.4.3 --- Global Connectivity Settings --- p.42 / Chapter 2.4.3.1 --- Legal Ordering --- p.43 / Chapter 2.4.3.2 --- Edmonds' Arborescences --- p.44 / Chapter 2.4.4 --- Local Edge-Connectivity Setting --- p.45 / Chapter 3 --- Degree Bounded Network Design Problem with Metric Cost --- p.47 / Chapter 3.1 --- Christofides'-like Algorithm --- p.49 / Chapter 3.2 --- Simplicity-Preserving Edge Splitting-Off --- p.50 / Chapter 3.2.1 --- Proof of Theorem 3.3 --- p.51 / Chapter 3.3 --- Approximation Algorithms for Network Design Problems --- p.56 / Chapter 3.3.1 --- Removing Redundant Edges --- p.57 / Chapter 3.3.2 --- Perfect Matching --- p.58 / Chapter 3.3.3 --- Edge Splitting-Off Restoring Simplicity --- p.59 / Chapter 3.4 --- Results in Different Settings --- p.60 / Chapter 3.4.1 --- Global Edge-Connectivity --- p.61 / Chapter 3.4.2 --- Local Edge-Connectivity --- p.62 / Chapter 4 --- Constrained Edge Splitting-off --- p.64 / Chapter 4.1 --- Preliminaries --- p.66 / Chapter 4.2 --- General Constrained Edge Splitting-off Lemma --- p.68 / Chapter 4.3 --- Structural Properties of Non-Admissible Pairs --- p.69 / Chapter 4.3.1 --- Some Useful Lemmas --- p.70 / Chapter 4.3.2 --- An Upper Bound on \Dp\ --- p.71 / Chapter 4.3.3 --- An Inductive Argument --- p.73 / Chapter 4.4 --- Non-Admissibility Graph and Constraint Graph --- p.75 / Chapter 4.4.1 --- Vertex Set Partition Constraint --- p.76 / Chapter 4.4.2 --- Graph Simplicity Constraint --- p.77 / Chapter 4.4.3 --- Simultaneous Graph Constraint --- p.78 / Chapter 4.4.4 --- Tight Sufficient Conditions --- p.79 / Chapter 4.5 --- Global Arc-Connectivity Setting --- p.79 / Chapter 4.5.1 --- Proof of Lemma 4.15 --- p.81 / Chapter 5 --- Constrained Edge-Connectivity Augmentation Problem --- p.83 / Chapter 5.1 --- Preliminaries --- p.84 / Chapter 5.2 --- Additive Approximation Algorithms --- p.87 / Chapter 5.2.1 --- Edge-Connectivitv Augmentation Preserving Vertex Set Partition --- p.87 / Chapter 5.2.2 --- Edge-Connectivity Augmentation Preserving Simplicity --- p.91 / Chapter 5.2.3 --- Simultaneous-Graph Edge-Connectivity Augmentation --- p.93 / Chapter 5.3 --- Global Arc-Connectivity Setting --- p.95 / Chapter 5.3.1 --- Edge-Connectivity Augmentation Preserving Vertex Set Partition --- p.95 / Chapter 5.3.2 --- Edge-Connectivity Augmentation Preserving Simplicity --- p.97 / Chapter 5.3.3 --- Simultaneous Edge-Connectivity Augmentation --- p.98 / Chapter 6 --- Efficient Edge Splitting-off Algorithm --- p.100 / Chapter 6.l --- Preliminaries --- p.102 / Chapter 6.1.1 --- Efficient Tools for Edge-Connectivity Problems --- p.103 / Chapter 6.1.2 --- An Alternative Proof of Mader's Theorem --- p.104 / Chapter 6.2 --- Framework for Complete Edge Splitting-off --- p.105 / Chapter 6.2.1 --- Proof of Lemma 6.5 --- p.106 / Chapter 6.3 --- Efficient Splitting-off Attempt --- p.108 / Chapter 6.3.1 --- Indicator Vertex --- p.109 / Chapter 6.3.2 --- Splitting-off to Capacity --- p.112 / Chapter 6.4 --- Randomized and Parallelized Edge Splitting-off Algorithm --- p.113 / Chapter 6.5 --- Deterministic Edge Splitting-off Algorithm --- p.114 / Chapter 6.6 --- Algorithms in Other Settings --- p.115 / Chapter 6.6.1 --- Edge Splitting-off in Network Design Problems --- p.115 / Chapter 6.6.2 --- Constrained Edge Splitting-off --- p.116 / Chapter 7 --- Concluding Remarks --- p.119 / Bibliography --- p.121

Xie, Zhenchang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (p. 48-50). / Abstracts in English and Chinese. / Abstract --- p.ii / Table of Contents --- p.v / List of Figures --- p.vi / List of Tables --- p.vii / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Development of fiber optic networks --- p.1 / Chapter 1.2 --- Optical transmission system --- p.2 / Chapter 1.3 --- The motivation of this thesis --- p.7 / Chapter 1.4 --- Outline of this thesis --- p.8 / Chapter Chapter 2 --- The Consolidation of Two Coexisting Networks with Full-Interconnection --- p.10 / Chapter 2.1 --- Assumptions and problem formulation --- p.10 / Chapter 2.2 --- Definitions and notations --- p.12 / Chapter 2.3 --- An algorithm to derive Lmin --- p.13 / Chapter 2.4 --- Example illustrations --- p.17 / Chapter 2.5 --- "The number of fiber links required over the number of nodes of a network, L/N" --- p.21 / Chapter 2.6 --- Summary --- p.22 / Chapter Chapter 3 --- The Consolidation of Two Coexisting Networks with Two Interconnection Links --- p.23 / Chapter 3.1 --- Assumptions --- p.24 / Chapter 3.2 --- Analysis on the optimal location of the two interconnection links --- p.25 / Chapter 3.3 --- Notations --- p.25 / Chapter 3.4 --- Theorems and corollaries --- p.25 / Chapter 3.5 --- "The number of fiber links required over the number of nodes of a network, L/N" --- p.35 / Chapter 3.6 --- Summary --- p.36 / Chapter Chapter 4 --- Protection of the Consolidated Network --- p.37 / Chapter 4.1 --- Full-interconnection case --- p.38 / Chapter 4.2 --- Two interconnection case --- p.39 / Chapter 4.3 --- Summary --- p.44 / Chapter Chapter 5 --- Summary and Future Works --- p.45 / Chapter 5.1 --- Summary --- p.45 / Chapter 5.2 --- Future works --- p.47 / Bibliography --- p.48 / Appendix ´ؤ List of publications --- p.52

Yam, Shing Chung Jonathan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 75-79). / Abstracts in English and Chinese. / Abstract / Acknowledgement / Contents / List of Figures / List of Tables / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.2 / Chapter 1.2 --- Thesis Organization --- p.5 / Chapter 2 --- Literature Review --- p.7 / Chapter 2.1 --- Data Sharing and Dissemination --- p.7 / Chapter 2.2 --- Data Aggregation --- p.12 / Chapter 2.3 --- Sensor Network Database Systems --- p.13 / Chapter 2.4 --- Data Routing and Networking --- p.23 / Chapter 2.5 --- Other Applications --- p.24 / Chapter 3 --- Preliminaries --- p.25 / Chapter 3.1 --- Probability Distribution and Gossipee-selection Schemes --- p.25 / Chapter 3.2 --- The Network Models --- p.28 / Chapter 3.3 --- Objective and Problem Statement --- p.30 / Chapter 3.4 --- Two-tier Gossip Mechanism --- p.31 / Chapter 3.5 --- Semantic-dependent Gossip Mechanism --- p.32 / Chapter 4 --- Results for Two-tier Gossip Mechanisms --- p.34 / Chapter 4.1 --- Background --- p.34 / Chapter 4.2 --- A Time Bound for Solving the Clustered Destination Problem with T-Theorem 1 --- p.39 / Chapter 4.3 --- Further Results´ؤTheorem 2 --- p.49 / Chapter 4.4 --- Experimental Results for Two-tier and N-tier Gossip Mechanisms --- p.51 / Chapter 4.4.1 --- Performance Evaluation of Two-tier Gossip Mechanisms --- p.52 / Chapter 4.4.2 --- Performance Evaluation of N-tier Gossip Mechanisms --- p.56 / Chapter 4.5 --- Discussion --- p.60 / Chapter 5 --- Results for Semantic-dependent Gossip Mechanisms --- p.62 / Chapter 5.1 --- Background --- p.62 / Chapter 5.2 --- Theory --- p.65 / Chapter 5.3 --- "Detection of Single Moving Heat Source with S max(2c1l,c1h ))" --- p.66 / Chapter 5.4 --- Detection of Multiple Static Heat Sources with Two-tier Gossip mechanism --- p.69 / Chapter 5.5 --- Discussion --- p.72 / Chapter 6 --- Conclusion --- p.73 / Chapter 7 --- References --- p.75 / Appendix Prove of Result 4.3 --- p.80

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Online content delivery has witnessed dramatic growth recently with traffic consuming over half of today’s Internet bandwidth. This escalating demand has motivated content publishers to move outside the traditional solutions of infrastructure-based content delivery networks (CDNs). Instead, many are employing peer-to-peer data transfers to reduce the service cost and avoid bandwidth over-provision to handle peak demands. Unfortunately, the open access work model of this paradigm, which allows anyone to join, introduces several design challenges related to security, efficiency, and peer availability. In this dissertation, we introduce CacheCash, a cryptocurrency-based decentralized content distribution network designed to address these challenges. CacheCash bypasses the centralized approach of CDN companies for one in which end users organically set up new caches in exchange for cryptocurrency tokens. Thus, it enables publishers to hire caches on an as-needed basis, without constraining these parties with long-term business commitments. To address the challenges encountered as the system evolved, we propose a number of protocols and techniques that represent basic building blocks of CacheCash’s design. First, motivated by the observation that conventional security assessment tools do not suit cryptocurrency-based systems, we propose ABC, a threat modeling framework capable of identifying attacker collusion and the new threat vectors that cryptocurrencies introduce. Second, we propose CAPnet, a defense mechanism against cache accounting attacks (i.e., a client pretends to be served allowing a colluding cache to collect rewards without doing any work). CAPnet features a bandwidth expenditure puzzle that clients must solve over the content before caches are given credit, which bounds the effectiveness of this collusion case. Third, to make it feasible to reward caches per data chunk served, we introduce MicroCash, a decentralized probabilistic micropayment scheme that reduces the overhead of processing these small payments. MicroCash implements several novel ideas that make micropayments more suitable for delay-sensitive applications, such as online content delivery. CacheCash combines the previous techniques to produce a novel service-payment exchange protocol that secures the content distribution process. This protocol utilizes gradual content disclosure and partial payment collection to encourage the honest collaborative work between participants. We present a detailed game theoretic analysis showing how to exploit rational financial incentives to address several security threats. This is in addition to various performance optimization mechanisms that promote system efficiency and scalability. Lastly, we evaluate system performance and show that modest machines can serve/retrieve content at a high bitrate with minimal overhead.

No description available.

This thesis proposes new algorithms for restoration strategies that provision bandwidth guaranteed recovery for unicast and multicast connections. The primary focus is on online restoration strategies that sequentially do pre-planning of resource for each request using the current network resource state. Online restoration strategies do not require prior knowledge of all the requests like that of offline restoration strategies. Therefore, online restoration strategies are more suitable for on-demand and dynamic traffic engineering control. The proposed new algorithms are compared to known algorithms from literature. Most literature evaluates the performance of the algorithms with two metrics only: total bandwidth requirement and the number of requests accepted in the network. This thesis evaluates the algorithms in one additional dimension: the computational time. This is an important criterion when response times for establishing new connections are stringent. Each algorithm makes trade-off between computational complexity, bandwidth efficiency, and number of accepted requests. Results show that the proposed algorithms provide alternative trade-offs between the three performance metrics when compared to other existing algorithms. The alternatives provide more choice for the network providers and the best algorithm to use depends on the network's requirements. The restoration strategies used for unicast and multicast connections in this thesis are very compatible thus it is possible to integrate the restoration strategies into a single system where they share the same backup resources. Results from simulations show that using an integrated restoration model has significant benefits, which includes lower backup bandwidth requirement than the separate restoration model.