Typescript, etc. / Digitized by Kansas Correctional Industries

Liu Yunkai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 43-45). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background --- p.4 / Chapter 2.1 --- Notations --- p.4 / Chapter 2.2 --- Service Overlay Network Architecture --- p.5 / Chapter 2.3 --- The SON Cost Model --- p.5 / Chapter 2.4 --- Bandwidth Provisioning Problem --- p.7 / Chapter 2.5 --- Traffic Variation and QoS Violation Penalty --- p.8 / Chapter 3 --- Service Replication Model --- p.12 / Chapter 3.1 --- One-to-One Service Model --- p.13 / Chapter 3.2 --- Service Delivery Tree Model --- p.16 / Chapter 3.2.1 --- Problem Formulation --- p.17 / Chapter 3.2.2 --- Distributed Evaluation of SDT --- p.20 / Chapter 3.2.3 --- Approximation --- p.22 / Chapter 4 --- Service Replication Algorithms --- p.24 / Chapter 4.1 --- Centralized Service Replication Algorithm --- p.24 / Chapter 4.1.1 --- Preprocessing Phase --- p.24 / Chapter 4.1.2 --- Searching Phase --- p.26 / Chapter 4.2 --- Distributed Service Replication Algorithm --- p.27 / Chapter 4.3 --- Improved Distributed Algorithm --- p.28 / Chapter 5 --- Performance Evaluations --- p.32 / Chapter 5.1 --- Experiment 1: Algorithm Illustration --- p.32 / Chapter 5.2 --- Experiment 2: Performance Comparison --- p.34 / Chapter 5.3 --- Experiment 3: Scalability Analysis --- p.36 / Chapter 5.3.1 --- Experiment 3A --- p.36 / Chapter 5.3.2 --- Experiment 3B --- p.37 / Chapter 5.3.3 --- Experiment 3C --- p.38 / Chapter 5.4 --- Experiment 4: Multiple replications --- p.39 / Chapter 6 --- Related Work --- p.41 / Chapter 7 --- Conclusion --- p.42 / Bibliography --- p.45

Middleboxes, such as firewalls, Network Address Translators (NATs), Wide Area Network (WAN) optimizers, or Deep Packet Inspector (DPIs), are widely deployed in modern networks to improve network security and performance. Traditional middleboxes are typically hardware based, which are expensive and closed systems with little extensibility. Furthermore, they are developed by different vendors and deployed as standalone devices with little scalability. As the development of networks in scale, the limitations of traditional middleboxes bring great challenges in middlebox deployments. Network Function Virtualization (NFV) technology provides a promising alternative, which enables flexible deployment of middleboxes, as virtual machines (VMs) running on standard servers. However, the flexibility also creates a challenge for efficiently placing such middleboxes, due to the availability of multiple hosting servers, capabilities of middleboxes to change traffic volumes, and dependency between middleboxes. In our first two work, we addressed the optimal placement challenge of NFV middleboxes by considering middlebox traffic changing effects and dependency relations. Since each VM has only a limited processing capacity restricted by its available resources, multiple instances of the same function are necessary in an NFV network. Thus, routing in an NFV network is also a challenge to determine not only via a path from the source to destination but also the service (middlebox) locations. Furthermore, the challenge is complicated by the traffic changing effects of NFV services and dependency relations between them. In our third work, we studied how to efficiently route a flow to receive services in an NFV network. We conducted large-scale simulations to evaluate our proposed solutions, and also implemented a Software-Defined Networking (SDN) based prototype to validate the solutions in realistic environments. Extensive simulation and experiment results have been fully demonstrated the effectiveness of our design.

The Network on Chip (NoC) paradigm was introduced as a scalable communication infrastructure for future System-on-Chip applications. Designing application specific customized communication architectures is critical for obtaining low power, high performance solutions. Two significant design automation problems are the creation of an optimized configuration, given application requirement the implementation of this on-chip network. Automating the design of on-chip networks requires models for estimating area and energy, algorithms to effectively explore the design space and network component libraries and tools to generate the hardware description. Chip architects are faced with managing a wide range of customization options for individual components, routers and topology. As energy is of paramount importance, the effectiveness of any custom NoC generation approach lies in the availability of good energy models to effectively explore the design space. This thesis describes a complete NoC synthesis ???ow, called NoCGEN, for creating energy-efficient custom NoC architectures. Three major automation problems are addressed: custom topology generation, energy modeling and generation. An iterative algorithm is proposed to generate application specific point-to-point and packet-switched networks. The algorithm explores the design space for efficient topologies using characterized models and a system-level ???oorplanner for evaluating placement and wire-energy. Prior to our contribution, building an energy model required careful analysis of transistor or gate implementations. To alleviate the burden, an automated linear regression-based methodology is proposed to rapidly extract energy models for many router designs. The resulting models are cycle accurate with low-complexity and found to be within 10% of gate-level energy simulations, and execute several orders of magnitude faster than gate-level simulations. A hardware description of the custom topology is generated using a parameterizable library and custom HDL generator. Fully reusable and scalable network components (switches, crossbars, arbiters, routing algorithms) are described using a template approach and are used to compose arbitrary topologies. A methodology for building and composing routers and topologies using a template engine is described. The entire flow is implemented as several demonstrable extensible tools with powerful visualization functionality. Several experiments are performed to demonstrate the design space exploration capabilities and compare it against a competing min-cut topology generation algorithm.

Thesis (M.S.)--University of Missouri--Rolla, 2007. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed November 30, 2007) Includes bibliographical references (p. 55-57).

Thesis (M.Eng.)--University of Louisville, 2007. / Title and description from thesis home page (viewed December 14, 2007). Department of Computer Engineering and Computer Science. Vita. "May 2007." Includes bibliographical references (p. 163-170).

<p>This thesis deals with the creation of a library that can be used in the construction of</p><p>network protocols. The library provides functions that are useful for organizing protocols as</p><p>stacks of layers and for processing packets. The thesis implements the main concepts of the</p><p>special purpose language, Morpheus [2]. Morpheus was designed by Mark Bert Abbott at</p><p>the University of Arizona in 1994 but has not yet been implemented. We have implemented</p><p>the main concepts of Morpheus by using a concurrent programming language called MPD</p><p>(Multithreaded, Parallel and Distributed) [5] and a programming discipline known as</p><p>reactive objects. Morpheus is based on the concept of protocol shapes. A protocol shape is</p><p>a template for implementing protocols with certain functions. Three main protocol shapes</p><p>are router, sequencer and multiplexor. The protocol implementer constructs protocols by</p><p>extending these shapes. Our library implements these shapes as objects. Each of these</p><p>shapes in turn extends from a base protocol object called Protocol. We have used reactive</p><p>objects for allowing communication between protocols.</p>

<p>Automotive manufacturers face interesting challenges as electronic devices are becoming essential in modern vehicles. Therefore new approaches and strategies are to be adopted in order to tackle the coming challenges. One of the most rapidly growing domains is infotainment and telematics, where applications require a large amount of data to be transmitted on-board and also exchanged with the external world. The in-vehicle communication networks for infotainment systems must consequently be devised considering the need for transporting the considerable amount of data of multimedia applications as well as features particular to this area.</p><p>This thesis is intended to analyze possible implementations of multimedia networks for heavy transport vehicles, in relation to various aspects and features in this area. The thesis presents an analysis of different protocols and technologies used in automotive multimedia networks. Furthermore, characteristic requirements for automotive electronics systems and especially for automotive multimedia networks are investigated in detail. Based on these requirements different multimedia networks are proposed and studied, making a comparison between them with regard to a number of criteria.</p><p>A broad approach during the investigation of the multimedia protocols is chosen in order to enlarge the area of used technology and to bring new technologies and possibilities for the truck industry. The observations and the experiences from the car industry are used in the truck domain, where the specifics of the truck industry are taken into account. The comparison gives an insight into the particulars of the proposed solutions from several viewpoints so that a suitable multimedia network can be selected based on different criteria.</p>

Graduation date: 1996

This thesis deals with the creation of a library that can be used in the construction of network protocols. The library provides functions that are useful for organizing protocols as stacks of layers and for processing packets. The thesis implements the main concepts of the special purpose language, Morpheus [2]. Morpheus was designed by Mark Bert Abbott at the University of Arizona in 1994 but has not yet been implemented. We have implemented the main concepts of Morpheus by using a concurrent programming language called MPD (Multithreaded, Parallel and Distributed) [5] and a programming discipline known as reactive objects. Morpheus is based on the concept of protocol shapes. A protocol shape is a template for implementing protocols with certain functions. Three main protocol shapes are router, sequencer and multiplexor. The protocol implementer constructs protocols by extending these shapes. Our library implements these shapes as objects. Each of these shapes in turn extends from a base protocol object called Protocol. We have used reactive objects for allowing communication between protocols.