Typescript (photocopy). / Digitized by Kansas Correctional Industries

Thesis. 1977. Ph.D.--Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. / Microfiche copy available in Archives and Aeronautics. / Vita. / Bibliography : leaves 302-304. / Ph.D.

Thesis. 1977. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography : leaf 83. / M.S.

As digital systems continue to grow in complexity, the design of conventional synchronous systems is facing unprecedented challenges. The number of transistors on individual chips is already in the multi-billion range, and a greatly increasing number of components are being integrated onto a single chip. As a consequence, modern digital designs are under strong time-to-market pressure, and there is a critical need for composable design approaches for large complex systems. In the past two decades, networks-on-chip (NoC’s) have been a highly active research area. In a NoC-based system, functional blocks are first designed individually and may run at different clock rates. These modules are then connected through a structured network for on-chip global communication. However, due to the rigidity of centrally-clocked NoC’s, there have been bottlenecks of system scalability, energy and performance, which cannot be easily solved with synchronous approaches. As a result, there has been significant recent interest in combing the notion of asynchrony with NoC designs. Since the NoC approach inherently separates the communication infrastructure, and its timing, from computational elements, it is a natural match for an asynchronous paradigm. Asynchronous NoC’s, therefore, enable a modular and extensible system composition for an ‘object-orient’ design style. The thesis aims to significantly advance the state-of-art and viability of asynchronous and globally-asynchronous locally-synchronous (GALS) networks-on-chip, to enable high-performance and low-energy systems. The proposed asynchronous NoC’s are nearly entirely based on standard cells, which eases their integration into industrial design flows. The contributions are instantiated in three different directions. First, practical acceleration techniques are proposed for optimizing the system latency, in order to break through the latency bottleneck in the memory interfaces of many on-chip parallel processors. Novel asynchronous network protocols are proposed, along with concrete NoC designs. A new concept, called ‘monitoring network’, is introduced. Monitoring networks are lightweight shadow networks used for fast-forwarding anticipated traffic information, ahead of the actual packet traffic. The routers are therefore allowed to initiate and perform arbitration and channel allocation in advance. The technique is successfully applied to two topologies which belong to two different categories – a variant mesh-of-trees (MoT) structure and a 2D-mesh topology. Considerable and stable latency improvements are observed across a wide range of traffic patterns, along with moderate throughput gains. Second, for the first time, a high-performance and low-power asynchronous NoC router is compared directly to a leading commercial synchronous counterpart in an advanced industrial technology. The asynchronous router design shows significant performance improvements, as well as area and power savings. The proposed asynchronous router integrates several advanced techniques, including a low-latency circular FIFO for buffer design, and a novel end-to-end credit-based virtual channel (VC) flow control. In addition, a semi-automated design flow is created, which uses portions of a standard synchronous tool flow. Finally, a high-performance multi-resource asynchronous arbiter design is developed. This small but important component can be directly used in existing asynchronous NoC’s for performance optimization. In addition, this standalone design promises use in opening up new NoC directions, as well as for general use in parallel systems. In the proposed arbiter design, the allocation of a resource to a client is divided into several steps. Multiple successive client-resource pairs can be selected rapidly in pipelined sequence, and the completion of the assignments can overlap in parallel. In sum, the thesis provides a set of advanced design solutions for performance optimization of asynchronous and GALS networks-on-chip. These solutions are at different levels, from network protocols, down to router- and component-level optimizations, which can be directly applied to existing basic asynchronous NoC designs to provide a leap in performance improvement.

No description available.

Chen Zhaole. / Thesis submitted in: Aug 2003. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 54-56). / Abstracts in English and Chinese. / Abstract / Acknowledgement / Chapter 1 --- Introduction --- p.1 / Chapter 1.1. --- Motivation --- p.2 / Chapter 1.2. --- The Problem --- p.2 / Chapter 1.3. --- Project Introduction --- p.3 / Chapter 1.4. --- Thesis Outline --- p.4 / Chapter 2 --- Denial-of-Service Attacks --- p.5 / Chapter 2.1 --- Introduction --- p.6 / Chapter 2.2 --- Denial-of-Service Attacks --- p.7 / Chapter 2.2.1 --- Direct DoS Attacks --- p.7 / Chapter 2.2.2 --- Reflector DoS Attacks --- p.11 / Chapter 3 --- Related Work --- p.14 / Chapter 3.1 --- Introduction --- p.15 / Chapter 3.2 --- Link Testing --- p.15 / Chapter 3.3 --- Probabilistic Marking Scheme --- p.16 / Chapter 3.4 --- ICMP Traceback --- p.17 / Chapter 3.5 --- Algebraic Marking Scheme --- p.18 / Chapter 3.6 --- Advanced and Authenticated Marking Scheme --- p.19 / Chapter 4 --- An Innovative Algebraic Approach for IP Traceback --- p.21 / Chapter 4.1 --- Introduction --- p.22 / Chapter 4.2 --- Background --- p.23 / Chapter 4.2.1 --- Definitions --- p.23 / Chapter 4.2.2 --- Assumptions --- p.24 / Chapter 4.2.3 --- Basic Principles --- p.25 / Chapter 4.3 --- Marking Schemes for Tracing DoS Attacks --- p.26 / Chapter 4.3.1 --- Simplified Algebraic Marking Scheme --- p.26 / Chapter 4.3.2 --- Reflective Algebraic Marking Scheme --- p.31 / Chapter 5 --- Feasibility and Performance Analysis --- p.35 / Chapter 5.1 --- Backward Compatibility --- p.36 / Chapter 5.2 --- Number of False Positives --- p.37 / Chapter 5.3 --- Minimum Number of Packets for Reconstruction --- p.38 / Chapter 5.4 --- Multiple Attacks --- p.38 / Chapter 5.5 --- Reconstruction Time --- p.39 / Chapter 5.6 --- Router Performance --- p.39 / Chapter 6 --- Experiment Results --- p.40 / Chapter 6.1 --- Experiments of Simplified Marking Scheme --- p.41 / Chapter 6.2 --- Experiments of Reflective Marking Scheme --- p.44 / Chapter 7 --- Conclusions and future work --- p.47 / Chapter 7.1 --- Conclusions --- p.47 / Chapter 7.2 --- Future Work --- p.48 / Bibliography --- p.50

Lau Nga Sin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 101-110). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Research Motivation --- p.2 / Chapter 1.2 --- Problem Statement --- p.3 / Chapter 1.3 --- Research Objectives --- p.4 / Chapter 1.4 --- Structure of the Thesis --- p.6 / Chapter 2 --- Background Study on DDoS Attacks --- p.8 / Chapter 2.1 --- Distributed Denial of Service Attacks --- p.8 / Chapter 2.1.1 --- DDoS Attack Architecture --- p.9 / Chapter 2.1.2 --- DDoS Attack Taxonomy --- p.11 / Chapter 2.1.3 --- DDoS Tools --- p.19 / Chapter 2.1.4 --- DDoS Detection --- p.21 / Chapter 2.2 --- DDoS Countermeasure: Attack Source Traceback --- p.23 / Chapter 2.2.1 --- Link Testing --- p.23 / Chapter 2.2.2 --- Logging --- p.24 / Chapter 2.2.3 --- ICMP-based traceback --- p.26 / Chapter 2.2.4 --- Packet marking --- p.28 / Chapter 2.2.5 --- Comparison of various IP Traceback Schemes --- p.31 / Chapter 2.3 --- DDoS Countermeasure: Packet Filtering --- p.33 / Chapter 2.3.1 --- Ingress Filtering --- p.33 / Chapter 2.3.2 --- Egress Filtering --- p.34 / Chapter 2.3.3 --- Route-based Packet Filtering --- p.35 / Chapter 2.3.4 --- IP Traceback-based Packet Filtering --- p.36 / Chapter 2.3.5 --- Router-based Pushback --- p.37 / Chapter 3 --- Domain-based IP Traceback Scheme --- p.40 / Chapter 3.1 --- Overview of our IP Traceback Scheme --- p.41 / Chapter 3.2 --- Assumptions --- p.44 / Chapter 3.3 --- Proposed Packet Marking Scheme --- p.45 / Chapter 3.3.1 --- IP Markings with Edge Sampling --- p.46 / Chapter 3.3.2 --- Domain-based Design Motivation --- p.48 / Chapter 3.3.3 --- Mathematical Principle --- p.49 / Chapter 3.3.4 --- Marking Mechanism --- p.51 / Chapter 3.3.5 --- Storage Space of the Marking Fields --- p.56 / Chapter 3.3.6 --- Packet Marking Integrity --- p.57 / Chapter 3.3.7 --- Path Reconstruction --- p.58 / Chapter 4 --- Route-based Packet Filtering Scheme --- p.62 / Chapter 4.1 --- Placement of Filters --- p.63 / Chapter 4.1.1 --- At Sources' Networks --- p.64 / Chapter 4.1.2 --- At Victim's Network --- p.64 / Chapter 4.2 --- Proposed Packet Filtering Scheme --- p.65 / Chapter 4.2.1 --- Classification of Packets --- p.66 / Chapter 4.2.2 --- Filtering Mechanism --- p.67 / Chapter 5 --- Performance Evaluation --- p.70 / Chapter 5.1 --- Simulation Setup --- p.70 / Chapter 5.2 --- Experiments on IP Traceback Scheme --- p.72 / Chapter 5.2.1 --- Performance Metrics --- p.72 / Chapter 5.2.2 --- Choice of Marking Probabilities --- p.73 / Chapter 5.2.3 --- Experimental Results --- p.75 / Chapter 5.3 --- Experiments on Packet Filtering Scheme --- p.82 / Chapter 5.3.1 --- Performance Metrics --- p.82 / Chapter 5.3.2 --- Choices of Filtering Probabilities --- p.84 / Chapter 5.3.3 --- Experimental Results --- p.85 / Chapter 5.4 --- Deployment Issues --- p.91 / Chapter 5.4.1 --- Backward Compatibility --- p.91 / Chapter 5.4.2 --- Processing Overheads to the Routers and Network --- p.93 / Chapter 5.5 --- Evaluations --- p.95 / Chapter 6 --- Conclusion --- p.96 / Chapter 6.1 --- Contributions --- p.96 / Chapter 6.2 --- Discussions and future work --- p.99 / Bibliography --- p.110

Hui Ying Kin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 62-64). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.10 / Chapter 1.1 --- Motivation --- p.10 / Chapter 1.2 --- P2P small-world solution --- p.11 / Chapter 1.3 --- Balance of this thesis --- p.12 / Chapter 2 --- Background --- p.13 / Chapter 2.1 --- Small World phenomenon --- p.13 / Chapter 2.2 --- Internet Flash Crowds --- p.16 / Chapter 2.3 --- Dynamics in the small world network --- p.17 / Chapter 3 --- Small-world Overlay Protocol --- p.19 / Chapter 3.1 --- Overview --- p.23 / Chapter 3.2 --- Join Cluster Protocol (JCP): --- p.25 / Chapter 3.3 --- Leave Cluster Protocol (LCP): --- p.29 / Chapter 3.4 --- Object Lookup Protocol (OLP): --- p.31 / Chapter 3.5 --- Experimental Results Of Comparing with Other Structured P2P Networks --- p.33 / Chapter 3.5.1 --- Performance of object lookup: --- p.33 / Chapter 3.5.2 --- Effect of object lookup performance under different net- work sizes and number of long links: --- p.34 / Chapter 3.5.3 --- Comparison of Clustering Coefficient: --- p.35 / Chapter 4 --- Protocols for Handling Flash Crowd --- p.39 / Chapter 4.1 --- Static Flash Crowd --- p.40 / Chapter 4.2 --- Dynamic Flash Crowd --- p.44 / Chapter 4.3 --- Experimental Results for Replicating Popular Object --- p.45 / Chapter 4.3.1 --- Comparison between Chord and SWOP --- p.46 / Chapter 4.3.2 --- Comparison on Queue Size --- p.48 / Chapter 4.3.3 --- Variation on object request rate --- p.49 / Chapter 4.3.4 --- Variation on Number of Long Link Neighbors (k) --- p.50 / Chapter 4.4 --- Experiment Results for Examining the Effects on Traffic Loadings --- p.51 / Chapter 5 --- Performance Analysis --- p.53 / Chapter 5.1 --- Lookup complexity of SWOP --- p.53 / Chapter 5.2 --- Average time used for replicating item to all clusters in SWOP --- p.56 / Chapter 6 --- Related Work --- p.59 / Chapter 7 --- Conclusion --- p.61

Wong Kar Yiu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 109-111). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgement --- p.iv / Table of Contents --- p.v / List of Figure --- p.vii / Chapter Chapter 1. --- Introduction --- p.9 / Chapter 1.1 --- Introduction --- p.9 / Chapter 1.2 --- Background --- p.11 / Chapter 1.3 --- Ant Colony Optimization (ACO) --- p.15 / Chapter 1.4 --- Main contribution --- p.16 / Chapter 1.5 --- Thesis organization --- p.18 / Chapter Chapter 2. --- Related Work --- p.19 / Chapter 2.1 --- Multicast routing in general --- p.19 / Chapter 2.2 --- Multicast routing techniques --- p.22 / Chapter 2.3 --- Best-effort multicast routing --- p.25 / Chapter 2.4 --- Quality-of-Service (QoS) multicast routing --- p.30 / Chapter 2.5 --- Adaptive multicast routing --- p.34 / Chapter Chapter 3. --- Load-Sensitive Multicast Routing Protocol (LSMRP) --- p.37 / Chapter 3.1 --- Overview --- p.37 / Chapter 3.2 --- Problem Formulation --- p.37 / Chapter 3.3 --- Types of ant in LSMRP --- p.39 / Chapter 3.3.1 --- Forward Ants --- p.39 / Chapter 3.3.2 --- Random Ants --- p.41 / Chapter 3.3.3 --- Backward Ants --- p.42 / Chapter 3.3.4 --- Multicast Ants --- p.44 / Chapter 3.3.5 --- Multicast Backward Ants --- p.44 / Chapter 3.4 --- Global Algorithm --- p.47 / Chapter 3.4.1 --- Pheromone trails stage --- p.50 / Chapter 3.4.2 --- Multicast tree stage --- p.53 / Chapter 3.4.3 --- Routing table --- p.56 / Chapter 3.4.4 --- Messages Exchange and Mechanisms --- p.57 / Chapter 3.4.5 --- mapping --- p.58 / Chapter 3.4.6 --- Members join --- p.59 / Chapter 3.4.7 --- Members update --- p.59 / Chapter 3.4.8 --- Members leave --- p.61 / Chapter Chapter 4. --- Analysis of LSMRP --- p.63 / Chapter 4.1 --- Analysis of pheromone trail values --- p.63 / Chapter Chapter 5. --- Evaluation and Experimental Results --- p.80 / Chapter 5.1 --- System model --- p.80 / Chapter 5.2 --- Result --- p.84 / Chapter 5.2.1 --- Packets received --- p.84 / Chapter 5.2.2 --- Throughput --- p.86 / Chapter 5.2.3 --- Packet Loss --- p.98 / Chapter Chapter 6. --- Conclusion --- p.107 / Chapter 6.1 --- Future work/ open question --- p.107 / References --- p.109

Kong Chun Wai. / Thesis submitted in: July 2003. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 53-54). / Abstracts in English and Chinese. / Contents / acknowledgement --- p.I / Abstract --- p.II / 摘要 --- p.III / Chapter Chapter 1 --- Introduction --- p.1 / Chapter Chapter 2 --- Related Works --- p.4 / Chapter 2.1 --- Previous Work --- p.4 / Chapter 2.2 --- Comparison --- p.5 / Chapter Chapter 3 --- System Architecture --- p.7 / Chapter 3.1 --- Transmission Scheduling --- p.7 / Chapter 3.2 --- Admission Control --- p.9 / Chapter 3.3 --- Challenges in Supporting VBR-encoded Video --- p.10 / Chapter Chapter 4 --- Priority Scheduling --- p.12 / Chapter 4.1 --- Static Channel Priority (SCP) --- p.13 / Chapter 4.2 --- Dynamic Channel Priority (DCP) --- p.16 / Chapter Chapter 5 --- Turbo-Slice-and-Patch --- p.19 / Chapter 5.1 --- Video Pre-processing --- p.19 / Chapter 5.2 --- Bandwidth Allocation --- p.22 / Chapter 5.3 --- Three-Phase Patching --- p.23 / Chapter 5.4 --- Client Buffer Requirement --- p.27 / Chapter Chapter 6 --- Playback Continuity --- p.30 / Chapter Chapter 7 --- Performance Evaluation --- p.39 / Chapter 7.1 --- Average Latency --- p.40 / Chapter 7.2 --- Client Buffer Requirement --- p.43 / Chapter 7.3 --- Choice of Parameter Rcut --- p.44 / Chapter 7.4 --- Latency versus Arrival Rate --- p.46 / Chapter 7.5 --- Server Bandwidth Comparison --- p.48 / Chapter 7.6 --- Bandwidth Partitioning --- p.50 / Chapter Chapter 8 --- Conclusions --- p.52 / Bibliography --- p.53