In today's heterogeneous computing environment, a wide variety of computing devices with varying capabilities need to access information in the network. Existing network is not able to differentiate the different device capabilities, and indiscriminatingly send information to the end-devices, without regard to the ability of the end-devices to use the information. The goal of a device-aware network is to match the capability of the end-devices to the information delivered, thereby optimizing the network resource usage. In the battlefield, all resources - including time, network bandwidth and battery capacity - are very limited. A device-aware network avoids the waste that happens in current, device-ignorant networks. By eliminating unusable traffic, a device-aware network reduces the time the end-devices spend receiving extraneous information, and thus saves time and conserves battery-life. In this thesis, we evaluated two potential DAN architectures, Proxy-based and Router-based approaches, based on the key requirements we identified. To demonstrate the viability of DAN, we built a prototype using a hybrid of the two architectures. The key elements of our prototype include a DAN browser, a DAN Lookup Server and DAN Processing Unit (DPU). We have demonstrated how our architecture can enhance the overall network utility by ensuring that only appropriate content is delivered to the end-devices.

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

by Wong Leung-Chung Chris. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 86-[92]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Routing Overview --- p.2 / Chapter 1.2 --- Routing in the Internet --- p.5 / Chapter 1.2.1 --- Inter-Domain Routing --- p.6 / Chapter 1.2.2 --- Intra-Domain Routing --- p.7 / Chapter 1.2.3 --- The Future Trend --- p.7 / Chapter 2 --- Inter-Domain Routing --- p.9 / Chapter 2.1 --- Inter-Domain Routing Protocols --- p.9 / Chapter 2.1.1 --- Exterior Gateway Protocol (EGP) --- p.10 / Chapter 2.1.2 --- Border Gateway Protocol (BGP) --- p.11 / Chapter 2.1.3 --- Inter-Domain Policy Routing (IDPR) --- p.12 / Chapter 2.1.4 --- Other Protocols --- p.13 / Chapter 2.2 --- The Need for Pricing on Inter-Domain Routing Protocols --- p.13 / Chapter 2.3 --- Pricing Scheme on the Inter-Domain level --- p.15 / Chapter 2.4 --- Routing Protocols to Support Pricing on the Internet --- p.16 / Chapter 2.4.1 --- Routing Towards Multiple-Additive Metrics --- p.16 / Chapter 2.4.2 --- "Network Model, Notations and Assumptions" --- p.16 / Chapter 2.4.3 --- The Problem Statement --- p.18 / Chapter 3 --- Application of Neural Nets in Route Selection --- p.20 / Chapter 3.1 --- Neural Network (NN) Overview --- p.20 / Chapter 3.1.1 --- Brief History on Neural Network Research --- p.20 / Chapter 3.1.2 --- Definition of Neural Network --- p.21 / Chapter 3.1.3 --- Neural Network Architectures --- p.22 / Chapter 3.1.4 --- Transfer Fucntion of a Neuron --- p.24 / Chapter 3.1.5 --- Learning Methods --- p.25 / Chapter 3.1.6 --- Applications in Telecommunications --- p.26 / Chapter 3.2 --- Review on the Applications of Neural Networks in Packet Routing --- p.27 / Chapter 3.2.1 --- The JEB Branch --- p.27 / Chapter 3.2.2 --- The Hopfield/Energy Minimization Branch (HEM) --- p.29 / Chapter 3.2.3 --- Supervised Learning (SL) --- p.34 / Chapter 3.3 --- Discussions --- p.35 / Chapter 4 --- Route Selection as “Link-state´ح Classification --- p.36 / Chapter 4.1 --- Multi-Layer Feedforward Network (MLFN) --- p.37 / Chapter 4.1.1 --- Function Approximation Power of MLFN --- p.38 / Chapter 4.1.2 --- Choosing MLFN parameters..........´ب --- p.40 / Chapter 4.1.3 --- Trailing a MLFN --- p.41 / Chapter 4.2 --- The Utility Function --- p.43 / Chapter 4.3 --- The Neural Network Architecture --- p.46 / Chapter 4.3.1 --- Routing Graph Representation with Successor Sequence Table (SST) --- p.46 / Chapter 4.3.2 --- The Neural Network Layout --- p.52 / Chapter 4.3.3 --- How the Neural Network Controller Works --- p.55 / Chapter 4.3.4 --- Training --- p.56 / Chapter 4.4 --- Simulation --- p.56 / Chapter 4.4.1 --- Performance Parameters --- p.56 / Chapter 4.4.2 --- Simulation Results --- p.57 / Chapter 4.5 --- Conclusions and Discussions --- p.70 / Chapter 5 --- Route Selection as Energy Minimization - A Theoretical Study --- p.73 / Chapter 5.1 --- The Hopfield/Tank NN Model --- p.73 / Chapter 5.2 --- Boltzman's Machine --- p.76 / Chapter 5.3 --- Boltzman's Machine Model for Multiple-Metrices Routing --- p.79 / Chapter 5.4 --- Conclusions --- p.82 / Chapter 6 --- Conclusions --- p.84 / Bibliography --- p.86

by Chan Tsan Jim. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 68-71). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Background --- p.2 / Chapter 1.2.1 --- Introduction --- p.2 / Chapter 1.2.2 --- Wavelength Division Multiplexing --- p.3 / Chapter 1.2.3 --- Arrayed Waveguide Grating --- p.5 / Chapter 1.2.4 --- Passive Optical Networks --- p.7 / Chapter 1.3 --- Outline of the thesis --- p.10 / Chapter Chapter 2 --- Review of Protection and Restoration Schemes --- p.12 / Chapter 2.1 --- Introduction --- p.12 / Chapter 2.2 --- Protection Schemes --- p.14 / Chapter 2.2.1 --- Path Protection --- p.14 / Chapter 2.2.2 --- Link Protection --- p.16 / Chapter 2.3 --- Restoration Schemes --- p.17 / Chapter 2.3.1 --- Path Restoration --- p.17 / Chapter 2.3.2 --- Link Restoration --- p.18 / Chapter 2.4 --- Protection and Restoration Schemes in PON --- p.18 / Chapter 2.4.1 --- Protection Schemes in G.983.1 --- p.18 / Chapter 2.4.2 --- Other Proposed Schemes --- p.21 / Chapter Chapter 3 --- Design of WDM PON Network Architecture --- p.26 / Chapter 3.1 --- Introduction --- p.26 / Chapter 3.2 --- The Group Protection Architecture (GPA) --- p.27 / Chapter 3.2.1 --- Network Design --- p.27 / Chapter 3.2.2 --- Protection Mechanism --- p.28 / Chapter 3.2.3 --- Wavelength Assignments --- p.30 / Chapter 3.2.4 --- Power Budget Calculation --- p.32 / Chapter 3.2.5 --- Crosstalk Analysis --- p.33 / Chapter 3.2.6 --- Discussion --- p.35 / Chapter 3.3 --- The Enhanced Group Protection Architecture (EGPA) --- p.36 / Chapter 3.3.1 --- Introduction --- p.36 / Chapter 3.3.2 --- Network Design --- p.37 / Chapter 3.3.3 --- Protection Mechanism --- p.38 / Chapter 3.3.4 --- Wavelength Assignments --- p.39 / Chapter 3.3.5 --- Power Budget Calculation --- p.40 / Chapter 3.3.6 --- Crosstalk Analysis --- p.41 / Chapter 3.3.7 --- Discussion --- p.42 / Chapter 3.4 --- The Hybrid Ring Architecture (HR) --- p.42 / Chapter 3.4.1 --- Introduction --- p.42 / Chapter 3.4.2 --- Network Design --- p.43 / Chapter 3.4.3 --- Protection Mechanism --- p.44 / Chapter 3.4.4 --- Wavelength Assignments --- p.45 / Chapter 3.4.5 --- Power Budget Calculation --- p.46 / Chapter 3.4.6 --- Crosstalk Analysis --- p.47 / Chapter 3.4.7 --- Discussion --- p.47 / Chapter 3.5 --- Comparison of the three schemes --- p.48 / Chapter 3.6 --- Summary of the three schemes --- p.50 / Chapter Chapter 4 --- Experimental Evaluation --- p.51 / Chapter 4.1 --- Introduction --- p.51 / Chapter 4.2 --- Experimental Setup --- p.51 / Chapter 4.2.1 --- The GPA Scheme --- p.51 / Chapter 4.2.2 --- The EGPA Scheme --- p.53 / Chapter 4.2.3 --- The HR Scheme --- p.54 / Chapter 4.3 --- Experimental Result --- p.55 / Chapter 4.3.1 --- Optical Spectrum --- p.55 / Chapter 4.3.2 --- Transmission Performance --- p.58 / Chapter 4.3.3 --- Switching/Restoration Time --- p.61 / Chapter 4.3.4 --- Crosstalk Penalty --- p.63 / Chapter 4.4 --- Conclusion --- p.64 / Chapter Chapter 5 --- Conclusion and Future Works --- p.65 / Chapter 5.1 --- Introduction --- p.65 / Chapter 5.2 --- Conclusion --- p.65 / Chapter 5.3 --- Future Works --- p.66 / References --- p.67

In Service-Oriented Architectures, everything is a service and services can interact with each other when needed. Web services (or simply services) are loosely coupled software components that are published, discovered, and invoked across the Web. As the use of Web services grows, in order to correctly interact with the growing services, it is important to understand the business protocols that provide clients with the information on how to interact with services. In dynamic Web services environments, service providers need to constantly adapt their business protocols for reflecting the restrictions and requirements proposed by new applications, new business strategies, and new laws, or for fixing the problems found in the protocol definition. However, the effective management of such a protocol evolution raises critical problems: one of the most critical issues is to handle instances running under the old protocol when their protocol has been changed. Simple solutions, such as aborting them or allowing them to continue to run according to the old protocol, can be considered, but they are inapplicable for many reasons (e.g., the lose of work already done and the critical nature of work). We present a framework that supports service administrators in managing the business protocol evolution by providing several features, such as a set of change operators allowing modifications of protocols, a variety of protocol change impact analyses automatically determining which ongoing instances can be migrated to the new version of protocol, and data mining techniques inducing a model for classifying ongoing instances migrateable to the new protocol. To support the protocol evolution process, we have also developed database-backed GUI tools on top of our existing system. The proposed approach and tools can help service administrators in managing the evolution of ongoing instances when the business protocols of services with which they are interacting have changed.

"February 2003" / Includes bibliography (leaves 192-203) / xix, 203 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 2003

Thesis (M.S.) -- Worcester Polytechnic Institute. / Keywords: virtual machine; agility. Includes bibliographical references (p.58-59).

Graduation date: 1994

TASKMASTER is an experimental microcontroller node of a real-time control oriented network which was proposed by James H. Herzog and Tinggui Zhang to demonstrate the feasibility of a task oriented control structure in performing distributed control actions. This study is a continuation of research involving the TASKMASTER network. A high performance microcontroller the 32-bit Motorola MC68332 has been used in this study to implement a node of the TASKMASTER network. Use of the MC68332 with its powerful peripheral subsystems offers significant scope for improvement of the overall performance of the network in addition to strengthening its control processing capabilities. An 8-bit microcontroller the Intel 8052 has also been used to implement a node of the network. A high-level language C has been used for coding of the operating system of the network which previously has been coded in assembly. In addition to being more readable, use of a high-level language offers other significant advantages such as portability, smaller code development time and code debugging time and the ability to compare different microcontrollers on a common basis. A performance analysis and comparison between the two microcontrollers used and the language used in coding them was also performed using performance measures designed as part of this study. / Graduation date: 1994

Thesis (Ph. D.)--Ohio State University, 2006. / Title from first page of PDF file. Includes bibliographical references (p. 255-261).