Thesis (Ph. D.)--University of Washington, 2005. / Vita. Includes bibliographical references (p. 93-103).

Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2007. / Dr. Henry L. Owen III, Committee Member ; Dr. David Keezer, Committee Member ; Dr. D. Scott Wills, Committee Chair.

Devido à evolução e à crescente complexidade dos sistemas computacionais, grandes mudanças ocorreram na área de gerenciamento de redes. Os modelos tradicionais centralizados se mostraram limitados, e novos modelos de gerenciamento de redes estão sendo propostos e investigados. Neste cenário, modelos de comunicação P2P permitem a construção de ambientes dinâmicos e versáteis capazes de resolver problemas de diferentes áreas da computação, entre elas o gerenciamento de redes. O modelo P2P torna-se atrativo porque se encaixa perfeitamente no gerenciamento de redes distribuído atualmente solicitado. A partir da proposta de gerenciamento de redes usando P2P e da apresentação de um novo modelo conceitual usando essa nova perspectiva, foi desenvolvido um projeto de arquiteturas para gerenciamento baseadas em P2P, focando-se em entidades tais como peers de gerenciamento Top-Level (TLM) e Mid-Level (MLM). A fim de efetivamente concretizar o gerenciamento baseado em P2P, foram introduzidas definições de blocos básicos para sistemas de gerenciamento baseados em P2P. A integração desses blocos básicos com soluções tradicionais de gerenciamento, tal como a estrutura SNMP, também foi apresentada. Um dos conceitos centrais da arquitetura apresentada são os Serviços de Gerenciamento, que definem as tarefas básicas de gerenciamento do sistema, e foram inspirados nos conceitos de Web Services e na concepção de serviços das Arquiteturas Orientadas a Serviço (SOA). Para a avaliação desse novo modelo de gerenciamento de redes e da arquitetura associada, surgiu a necessidade do desenvolvimento de um protótipo do sistema, com o intuito de servir como uma plataforma para desenvolvimento e implantação de Serviços de Gerenciamento. Esse protótipo é usado para avaliação e análise de testes e resultados associados. Para preservar as características de disponibilidade e escalabilidade que são inerentes dos sistemas P2P, definiu-se que os Serviços de Gerenciamento devem ser disponibilizados por Grupos de MLMs, organizados de forma a fazer a distribuição de tarefas de gerenciamento entre si. Diversos modelos de distribuição de carga foram investigados, foram realizadas avaliações e gráficos comparativos, e foram estabelecidas diretrizes sobre quando e como deve ser aplicado cada modelo, de modo a alcançar sempre o melhor rendimento e a maximização do aproveitamento dos recursos disponíveis ao sistema. A avaliação realizada consistiu na execução de diversas requisições com diferentes números de MLMs usando diferentes algoritmos de distribuição de carga, e na comparação entre a vazão, os tempos de resposta e o tráfego de rede gerados pelos diferentes casos de uso. A implementação desenvolvida neste trabalho demonstrou ser promissora, apresentando resultados bastante satisfatórios com relação aos parâmetros avaliados. / Due to the increasing complexity of computer systems, deep changes have occurred in network management in the past few years. Traditional centralized models have been proved limited, and new network management models are being proposed and investigated. In this scenery, P2P communication models allow for the creation of dynamic and versatile environments, able to solve problems in various computational areas, one of them being network management. The P2P model fits perfectly in the current demands of distributed network management. Starting from the proposed P2P-based network management model, a new P2P-based network management architecture has been developed, focusing on entities like Top-Level (TLM) and Mid-Level (MLM) management peers. With the purpose of making the P2P-based network management real, new building blocks for P2P-based network management systems have been defined. In the present work, an integration of these new building blocks with traditional network management solutions - like SNMP - is presented. One of the main concepts of the proposed architecture is on Management Services, inspired by Web Services and in the service definition of Service Oriented Architectures (SOA). To evaluate this new network management model and its associated architecture, it was necessary to develop a prototype system to be used as platform for development and deployment of Management Services. This prototype was used for evaluation, testing and result analysis. To hold the characteristics of availability and scalability that are inherent to the P2P systems, the Management Services had to be served by MLM groups, organized in a way to distribute the management tasks between them. Several load distribution models were investigated, with evaluation and comparative graphics fulfilled, and some guidelines were established as to when and how each model should be applied to reach the best performance and the maximization of the computational resources available to the system. The evaluation consisted in the execution of several requests in groups with distinct MLM numbers and using distinct load distribution algorithms. Then, the response time and network traffic generated by use cases were compared. We then showed that the developed implementation of our proposal is promising, and presents good results in relation with the evaluated parameters.

Devido à evolução e à crescente complexidade dos sistemas computacionais, grandes mudanças ocorreram na área de gerenciamento de redes. Os modelos tradicionais centralizados se mostraram limitados, e novos modelos de gerenciamento de redes estão sendo propostos e investigados. Neste cenário, modelos de comunicação P2P permitem a construção de ambientes dinâmicos e versáteis capazes de resolver problemas de diferentes áreas da computação, entre elas o gerenciamento de redes. O modelo P2P torna-se atrativo porque se encaixa perfeitamente no gerenciamento de redes distribuído atualmente solicitado. A partir da proposta de gerenciamento de redes usando P2P e da apresentação de um novo modelo conceitual usando essa nova perspectiva, foi desenvolvido um projeto de arquiteturas para gerenciamento baseadas em P2P, focando-se em entidades tais como peers de gerenciamento Top-Level (TLM) e Mid-Level (MLM). A fim de efetivamente concretizar o gerenciamento baseado em P2P, foram introduzidas definições de blocos básicos para sistemas de gerenciamento baseados em P2P. A integração desses blocos básicos com soluções tradicionais de gerenciamento, tal como a estrutura SNMP, também foi apresentada. Um dos conceitos centrais da arquitetura apresentada são os Serviços de Gerenciamento, que definem as tarefas básicas de gerenciamento do sistema, e foram inspirados nos conceitos de Web Services e na concepção de serviços das Arquiteturas Orientadas a Serviço (SOA). Para a avaliação desse novo modelo de gerenciamento de redes e da arquitetura associada, surgiu a necessidade do desenvolvimento de um protótipo do sistema, com o intuito de servir como uma plataforma para desenvolvimento e implantação de Serviços de Gerenciamento. Esse protótipo é usado para avaliação e análise de testes e resultados associados. Para preservar as características de disponibilidade e escalabilidade que são inerentes dos sistemas P2P, definiu-se que os Serviços de Gerenciamento devem ser disponibilizados por Grupos de MLMs, organizados de forma a fazer a distribuição de tarefas de gerenciamento entre si. Diversos modelos de distribuição de carga foram investigados, foram realizadas avaliações e gráficos comparativos, e foram estabelecidas diretrizes sobre quando e como deve ser aplicado cada modelo, de modo a alcançar sempre o melhor rendimento e a maximização do aproveitamento dos recursos disponíveis ao sistema. A avaliação realizada consistiu na execução de diversas requisições com diferentes números de MLMs usando diferentes algoritmos de distribuição de carga, e na comparação entre a vazão, os tempos de resposta e o tráfego de rede gerados pelos diferentes casos de uso. A implementação desenvolvida neste trabalho demonstrou ser promissora, apresentando resultados bastante satisfatórios com relação aos parâmetros avaliados. / Due to the increasing complexity of computer systems, deep changes have occurred in network management in the past few years. Traditional centralized models have been proved limited, and new network management models are being proposed and investigated. In this scenery, P2P communication models allow for the creation of dynamic and versatile environments, able to solve problems in various computational areas, one of them being network management. The P2P model fits perfectly in the current demands of distributed network management. Starting from the proposed P2P-based network management model, a new P2P-based network management architecture has been developed, focusing on entities like Top-Level (TLM) and Mid-Level (MLM) management peers. With the purpose of making the P2P-based network management real, new building blocks for P2P-based network management systems have been defined. In the present work, an integration of these new building blocks with traditional network management solutions - like SNMP - is presented. One of the main concepts of the proposed architecture is on Management Services, inspired by Web Services and in the service definition of Service Oriented Architectures (SOA). To evaluate this new network management model and its associated architecture, it was necessary to develop a prototype system to be used as platform for development and deployment of Management Services. This prototype was used for evaluation, testing and result analysis. To hold the characteristics of availability and scalability that are inherent to the P2P systems, the Management Services had to be served by MLM groups, organized in a way to distribute the management tasks between them. Several load distribution models were investigated, with evaluation and comparative graphics fulfilled, and some guidelines were established as to when and how each model should be applied to reach the best performance and the maximization of the computational resources available to the system. The evaluation consisted in the execution of several requests in groups with distinct MLM numbers and using distinct load distribution algorithms. Then, the response time and network traffic generated by use cases were compared. We then showed that the developed implementation of our proposal is promising, and presents good results in relation with the evaluated parameters.

Devido à evolução e à crescente complexidade dos sistemas computacionais, grandes mudanças ocorreram na área de gerenciamento de redes. Os modelos tradicionais centralizados se mostraram limitados, e novos modelos de gerenciamento de redes estão sendo propostos e investigados. Neste cenário, modelos de comunicação P2P permitem a construção de ambientes dinâmicos e versáteis capazes de resolver problemas de diferentes áreas da computação, entre elas o gerenciamento de redes. O modelo P2P torna-se atrativo porque se encaixa perfeitamente no gerenciamento de redes distribuído atualmente solicitado. A partir da proposta de gerenciamento de redes usando P2P e da apresentação de um novo modelo conceitual usando essa nova perspectiva, foi desenvolvido um projeto de arquiteturas para gerenciamento baseadas em P2P, focando-se em entidades tais como peers de gerenciamento Top-Level (TLM) e Mid-Level (MLM). A fim de efetivamente concretizar o gerenciamento baseado em P2P, foram introduzidas definições de blocos básicos para sistemas de gerenciamento baseados em P2P. A integração desses blocos básicos com soluções tradicionais de gerenciamento, tal como a estrutura SNMP, também foi apresentada. Um dos conceitos centrais da arquitetura apresentada são os Serviços de Gerenciamento, que definem as tarefas básicas de gerenciamento do sistema, e foram inspirados nos conceitos de Web Services e na concepção de serviços das Arquiteturas Orientadas a Serviço (SOA). Para a avaliação desse novo modelo de gerenciamento de redes e da arquitetura associada, surgiu a necessidade do desenvolvimento de um protótipo do sistema, com o intuito de servir como uma plataforma para desenvolvimento e implantação de Serviços de Gerenciamento. Esse protótipo é usado para avaliação e análise de testes e resultados associados. Para preservar as características de disponibilidade e escalabilidade que são inerentes dos sistemas P2P, definiu-se que os Serviços de Gerenciamento devem ser disponibilizados por Grupos de MLMs, organizados de forma a fazer a distribuição de tarefas de gerenciamento entre si. Diversos modelos de distribuição de carga foram investigados, foram realizadas avaliações e gráficos comparativos, e foram estabelecidas diretrizes sobre quando e como deve ser aplicado cada modelo, de modo a alcançar sempre o melhor rendimento e a maximização do aproveitamento dos recursos disponíveis ao sistema. A avaliação realizada consistiu na execução de diversas requisições com diferentes números de MLMs usando diferentes algoritmos de distribuição de carga, e na comparação entre a vazão, os tempos de resposta e o tráfego de rede gerados pelos diferentes casos de uso. A implementação desenvolvida neste trabalho demonstrou ser promissora, apresentando resultados bastante satisfatórios com relação aos parâmetros avaliados. / Due to the increasing complexity of computer systems, deep changes have occurred in network management in the past few years. Traditional centralized models have been proved limited, and new network management models are being proposed and investigated. In this scenery, P2P communication models allow for the creation of dynamic and versatile environments, able to solve problems in various computational areas, one of them being network management. The P2P model fits perfectly in the current demands of distributed network management. Starting from the proposed P2P-based network management model, a new P2P-based network management architecture has been developed, focusing on entities like Top-Level (TLM) and Mid-Level (MLM) management peers. With the purpose of making the P2P-based network management real, new building blocks for P2P-based network management systems have been defined. In the present work, an integration of these new building blocks with traditional network management solutions - like SNMP - is presented. One of the main concepts of the proposed architecture is on Management Services, inspired by Web Services and in the service definition of Service Oriented Architectures (SOA). To evaluate this new network management model and its associated architecture, it was necessary to develop a prototype system to be used as platform for development and deployment of Management Services. This prototype was used for evaluation, testing and result analysis. To hold the characteristics of availability and scalability that are inherent to the P2P systems, the Management Services had to be served by MLM groups, organized in a way to distribute the management tasks between them. Several load distribution models were investigated, with evaluation and comparative graphics fulfilled, and some guidelines were established as to when and how each model should be applied to reach the best performance and the maximization of the computational resources available to the system. The evaluation consisted in the execution of several requests in groups with distinct MLM numbers and using distinct load distribution algorithms. Then, the response time and network traffic generated by use cases were compared. We then showed that the developed implementation of our proposal is promising, and presents good results in relation with the evaluated parameters.

Wireless sensor networks are ad hoc networks of tiny battery powered sensor nodes that can organize themselves to form self-organized networks and collect information regarding temperature, light, and pressure in an area. Though the applications of sensor networks are very promising, sensor nodes are limited in their capability due to many factors. The main limitation of these battery powered nodes is energy. Sensor networks are expected to work for long periods of time once deployed and it becomes important to conserve the battery life of the nodes to extend network lifetime. This work examines non-uniform grid-based routing protocol as an effort to minimize energy consumption in the network and extend network lifetime. The entire test area is divided into non-uniformly shaped grids. Fixed source and sink nodes with unlimited energy are placed in the network. Sensor nodes with full battery life are deployed uniformly and randomly in the field. The source node floods the network with only the coordinator node active in each grid and the other nodes sleeping. The sink node traces the same route back to the source node through the same coordinators. This process continues till a coordinator node runs out of energy, when new coordinator nodes are elected to participate in routing. Thus the network stays alive till the link between the source and sink nodes is lost, i.e., the network is partitioned. This work explores the efficiency of the non-uniform grid-based routing protocol for different node densities and the non-uniform grid structure that best extends network lifetime.

This paper explores how an all pair shortest path can be obtained in a wireless sensor network when sensors fail. Sensors are randomly deployed in a predefined geographical area, simulating the deployment of sensors from an airplane, and finding shortest path between all the sensors deployed based on distance. A major problem to address in wireless sensor networks is the impact of sensor failures on existing shortest paths in the network. An application is developed to simulate a network and find shortest paths affected by a sensor failure and find alternative shortest path. When a sensor fails, all the shortest paths and all the remaining sensors in the network are checked to see if the sensor failure has any impact on the network. Alternative shortest path is calculated for those paths affected by sensor failures.

One of the fundamental challenges in building Peer-to-Peer (P2P) applications is to locate resources across a dynamic set of nodes without centralised servers. Structured overlay networks solve this challenge by proving a key-based routing (KBR) layer that maps keys to nodes. The performance of KBR is strongly influenced by the dynamic and unpredictable conditions of P2P environments. To cope with such conditions a node must maintain its routing state. Routing state maintenance directly influences both lookup latency and bandwidth consumption. The more vigorously that state information is disseminated between nodes, the greater the accuracy and completeness of the routing state and the lower the lookup latency, but the more bandwidth that is consumed. Existing structured P2P overlays provide a set of configuration parameters that can be used to tune the trade-off between lookup latency and bandwidth consumption. However, the scale and complexity of the configuration space makes the overlays difficult to optimise. Further, it is increasingly difficult to design adaptive overlays that can cope with the ever increasing complexity of P2P environments. This thesis is motivated by the vision that adaptive P2P systems of tomorrow, would not only optimise their own parameters, but also generate and adapt their own design. This thesis studies the effects of using an adaptive technique to automatically adapt state dissemination cost and lookup latency in structured overlays under churn. In contrast to previous adaptive approaches, this work investigates the algorithmic adaptation of the fundamental data dissemination protocol rather than tuning the parameter values of a protocol with fixed design. This work illustrates that such a technique can be used to design parameter-free structured overlays that outperform other structured overlays with fixed design such as Chord in terms of lookup latency, bandwidth consumption and lookup correctness. A large amount of experimentation was performed, more than the space allows to report. This thesis presents a set of key findings. The full set of experiments and data is available online at: http://trombone.cs.st-andrews.ac.uk/thesis/analysis.

This dissertation presents methods of extending the network lifetime of multi-hop wireless sensor networks (WSNs) through routing that uses cooperative transmission (CT), referred to as cooperative routing. CT can have a signal-to-noise ratio (SNR) advantage over non-CT schemes through cooperative diversity and simple aggregation of transmit power, and one of its abilities is to extend the communication range of a wireless device using this SNR advantage. In this research, we use the range-extension ability of CT as a tool to mitigate the energy-hole problem of multi-hop WSNs and extend the network lifetime. The main contributions of this research are (i) an analytical model for a cooperative routing protocol with a deployment method, (ii) cooperative routing protocols that can extend the network lifetime, and (iii) formulating the lifetime-optimization problem for cooperative routing. The analytical model developed in this research theoretically proves that, in a situation where non-CT routing cannot avoid the energy-hole problem, our CT method can solve the problem. PROTECT, a CT method based on the analytical model, provides a very simple way of doing cooperative routing and can improve the lifetime of non-CT networks significantly. REACT, a cooperative routing protocol that uses the energy information of nodes, overcomes some of the limitations of PROTECT and can be applied to any existing non-CT routing protocol to improve the network lifetime. Using REACT and analytical approaches, we also show that cooperative routing can be beneficial in multi-hop energy-harvesting WSNs. By formulating and solving the lifetime-optimization problem of cooperative routing, which requires a much more sophisticated formulation than that of non-CT routing, we explore the optimal lifetime bounds and behaviors of cooperative routing. Finally, we study and design online cooperative routing methods that can perform close to the optimal cooperative routing.

Delay tolerant networks (DTNs) are a class of emerging networks that exhibit significantly different characteristics from today's Internet, such as intermittent connectivity, large delay, and high loss rates. DTNs have important applications in disaster relief, military, rural Internet access, environmental sensing and surveillance, interplanetary communication, underwater sensing, and vehicular communication. While not the common case for networking, DTNs represent some of the most critical cases, where the ability to communicate can make a huge difference for human lives. Supporting effective communication in DTNs, however, is challenging. First, with intermittent connectivity, DTNs are often extremely limited in capacity. Second, given resource limitations and uncertainty in DTNs, it is critical to deliver data efficiently and robustly. The situation is especially acute for multicast which sends data to multiple destinations. This thesis seeks to address these two issues. To enhance network capacity in DTNs, we propose a message ferrying scheme that exploits the use of special mobile nodes (called message ferries) and controlled device mobility to deliver data. Message ferries are utilized to transport data via mobility between sources and destinations. We develop a foundation for the control of the mobility of message ferries, and nodes if possible, to cooperatively deliver data under a variety of conditions. We also study another approach which deploys new nodes called throwboxes to enhance capacity. Throwboxes are small and inexpensive wireless devices. By relaying data between mobile nodes, throwboxes are able to create data transfer opportunities that otherwise would not exist. We systematically investigate the issues of deployment and routing, and develop algorithms for various deployment and routing approaches. Based on extensive evaluation, we obtain several findings to guide the design and operation of throwbox-augmented DTNs. To address the issue of efficient and robust data delivery, we focus on DTN multicasting. Given the unique characteristics of DTNs, traditional solutions such as IP multicast can not be simply ported to DTNs. We identify the limitations of IP multicast semantics in DTNs and define new semantic models for DTN multicast. Based on these semantic models, we develop and evaluate several multicast routing algorithms with different routing strategies.