The development of miniaturized radio and sensing technologies have enabled the deployment of large quantities of wireless sensors capable of forming multi-hop networks. Emerging applications of this technology such as surveillance and disaster monitoring have throughput and efficiency requirements not met by current routing algorithms. These requirements are also shared by ad-hoc networks. Early routing protocols for these wireless networks were based on algorithms designed for wired networks. Geographic routing (routing based on position), was proposed. These algorithms perform poorly since they do not account for the fading and interference effects of wireless channels. Recent protocols that have attempted to account for the wireless channel focus on single-hop situations and are not readily extensible to multi-hop networks. In this thesis we present a framework for routing based on a distributed routing decision and provide several example protocols. This framework provides a cross-layer design where the routing decision is decided through silent negotiation between candidate relays. We investigate the performance and parameters of this framework. We then present an example protocol using this framework which provides low-overhead opportunistic routing using cooperative diversity. This protocol uses the intrinsic characteristics of the wireless channel to achieve diversity while still maintaining relatively low overhead. An adaptation of the protocol for heterogeneous networks equipped with multiple antennas has also been discussed and evaluated through simulations. We also investigate another protocol based on this framework using the product of the instantaneous packet reception rate and the marginal progress towards the destination as a routing metric, offering enhanced throughput.

Overlay networks have recently gained popularity as a viable alternative to overcome functionality limitations of the Internet (e.g., lack of QoS, multicast routing). They offer enhanced functionality to end-users by forming an independent and customizable virtual network over the native network. Typically, the routing at the overlay layer operates independent of that at the underlying native layer. There are several potential problems with this approach because overlay networks are selfish entities that are chiefly concerned with achieving the routing objective of their own users. This leads to complex cross-layer interactions between the native and overlay layers, and often tends to degrade the achieved performance for both layers. As overlay applications proliferate and the amount of selfish overlay traffic surges, there is a clear need for understanding the complex interactions and for strategies to manage them appropriately. Our work addresses these issues in the context of "service overlay networks", which represent virtual networks formed of persistent nodes that collaborate to offer improved services to actual end-systems. Typically, service overlays alter the route between the overlay nodes in a dynamic manner in order to satisfy a selfish objective. The objective of this thesis is to improve the stability and performance of overlay routing in this multi-layer environment. <br><br> We investigate the common problems of functionality overlap, lack of cross-layer awareness, mismatch or misalignment in routing objectives and the contention for native resources between the two layers. These problems often lead to deterioration in performance for the end-users. This thesis presents an analysis of the cross-layer interaction during fault recovery, inter-domain policy enforcement and traffic engineering in the multi-layer context. Based on our characterization of the interaction, we propose effective strategies that improve overall routing performance, with minimal side-effects on other traffic. These strategies typically 1) increase the layer-awareness (awareness of information about the other layer) at each layer, 2) introduce better control over routing dynamics and 3) offer improved overlay node placement options. Our results demonstrate how applying these strategies lead to better management of the cross-layer interaction, which in turn leads to improved routing performance for end-users.

Accelerated by on-demand computing, the number and diversity of the Internet services is increasing. Such online services often have unique requirements for the underlying wide-area network: For instance, online gaming service might benefit from low delay and jitter paths to client, while online data backup service might benefit from cheaper paths. Unfortunately, today's Internet does not accommodate fine-grained, service-specific wide-area route control. In this dissertation, I achieve the following goals: 1) improve the access to the routes, 2) quantify the benefits of fine-grained route control, and 3) evaluate the efficiency of current payment schemes for the wide-area routes. * Improving access to wide-area route control. Online services face significant technological and procedural hurdles in accessing the routes: Each service in need to control the Internet routes, has to obtain own equipment, Internet numbered resources, and establish contracts with upstream ISPs. In this dissertation, I propose and describe implementation and deployment of a secure and scalable system which provides on-demand access to the Internet routes. In setting such as cloud data center, the system can support multiple online services, providing each service with an illusion of direct connectivity to the neighboring Internet networks, which, for all practical purposes, allows services to participate fully in the Internet routing. * Quantifying the benefits of fine-grained route control. Even if online services are presented with wide-area route choice, it is not clear how much tangible benefit such choice provides. Most modern Online Service Providers (OSP) rely primarily on the content routing to improve network performance between the clients and the replicas. In this dissertation, I quantify the potential benefit the OSPs can gain if they perform a joint network and content routing. Among other findings, I find that by performing joint content and network routing, OSPs can achieve 22% larger latency reduction than can be obtained by content routing alone. * Modeling and evaluating the efficiency of the current payment schemes for wide-area routes. Finally, increasing diversity and sophistication of the online services participating in the Internet routing poses a challenge to payment models used in today's Internet. Service providers today charge business customers a blended rate: a single, "average" price for unit of bandwidth, without regard to cost or value of individual customer's flows. In my dissertation, I set to understand how efficient this payment model is and if more granular payment model, accounting for the cost and value of different flows could increase the ISP profit and the consumer surplus. I develop an econometric demand and cost model and map three real-world ISP data sets to it. I find that ISPs can indeed improve the economic efficiency with just a few pricing tiers.

M. Tech. Electrical engineering. / Discusses the interference and bandwidth adjusted ETX routing metric uses a logical interference model that refers to the interference arising from the Carrier Sensing Multiple Access with Collision Avoidance (CSMA-CA) based Medium Access Control. This approach of capturing inter-flow is complex and more restrictive. In this dissertation, a more realistic and less restrictive approach based on the information available at the physical layer (signal strength) is used to capture the interference.In contrast to the logical interference model, this has the excellent advantage of measuring the parameters using online data traffic. The question is whether actual capacity improvements can be achieved by considering the physical interference model.

The IEEE 802.16 standard popularly known as WiMAX is at the forefront of the technological drive. Achieving high system throughput in these networks is challenging due to interference which limits concurrent transmissions. In this thesis, we study routing and link scheduling inWiMAX mesh networks. We present simple joint routing and link scheduling algorithms that have outperformed most of the existing proposals in our experiments. Our session based routing and links scheduling produced results approximately 90% of a trivial lower bound. We also study the problem of quality of service (QoS) provisioning in WiMAX mesh networks. QoS has become an attractive area of study driven by the increasing demand for multimedia content delivered wirelessly. To accommodate the different applications, the IEEE 802.16 standard defines four classes of service. In this dissertation, we propose a comprehensive scheme consisting of routing, link scheduling, call admission control (CAC) and channel assignment that considers all classes of service. Much of the work in the literature considers each of these problems in isolation. Our routing schemes use a metric that combines interference and traffic load to compute routes for requests while our link scheduling ensures that the QoS requirements of admitted requests are strictly met. Results from our simulation indicate that our routing and link scheduling schemes significantly improve network performance when the network is congested. / ix, 77 leaves : ill. ; 29 cm

[Truncated abstract] An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. Due to its peculiar establishment and operational properties it is also often termed an infrastructure-less, self-organised, or spontaneous network. In order to extend the communication range of the nodes, beyond a single hop, specially configured routing protocols are used. The unique feature of these protocols is their ability to form routes in spite of a dynamic topology. For effective functioning of the network it is essential that the network nodes execute the routing protocols in a truthful manner regardless of their contemporary commitments and workload. In real life, this is more than often extremely difficult to realise, and so we often find malicious nodes also present in the same network. These nodes can either join externally or may originate internally by compromis- ing an existing benevolent node in the network. These malicious nodes can carry out an array of attacks against the routing protocols leading to route severing, unavailability of service or deception. A number of secure routing protocols, which make use of cryptographic algorithms to secure the routes, have recently been proposed. ... In order to sustain the improvised nature of ad-hoc networks, in this thesis, we have moved from the common mechanism of achieving trust via security to enforcing dependability through collaboration. We desist from the customary strategy of employing cryptography and instead use a trust model that is influ- enced by the human behavioural model. All nodes in the network independently execute this trust model and maintain their own assessment concerning other nodes in the network. Each node, based upon its individual experiences, rewards collabo- rating nodes for their benevolent behaviour and penalises malicious nodes for their malevolent conduct. To highlight the efficacy of this unique approach, we apply the trust model to three contemporary reactive routing protocols in a pure ad-hoc network. These trust reinforced routing protocols locate dependable routes in the network by observing the sincerity in participation of other nodes using a set of trust categories. The routes worked out in this way are neither protected in terms of security nor minimal in terms of hops. However, these routes traverse nodes, which have been identified as more trustworthy than others and for this reason are more dependable in extemporised circumstances. Through the help of extensive simulations, we have demonstrated that the usage of these protocols significantly improves the overall performance of the network even in the presence of a high percentage of malicious nodes. These protocols, being independent of a trust infrastructure, also enable rapid deployment and improved operation with dynamic adaptation to the current scenario. The prime advantage being gained is the ability to seamlessly integrate ad-hoc wireless networks belonging to dissimilar organisations.

Thesis--Auburn University, 2009. / Abstract. Vita. Includes bibliographic resources (p.88-89).

Thesis (Ph. D.)--Ohio State University, 2005. / Title from first page of PDF file. Includes bibliographical references (p. 164-173).

Orientador: Paulo Licio de Geus / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-04T19:10:45Z (GMT). No. of bitstreams: 1 Kropiwiec_DiogoDitzel_M.pdf: 1443116 bytes, checksum: e21c7e873f831958ffc9ce27db574054 (MD5) Previous issue date: 2005 / Resumo: A Internet trouxe grandes benefícios às organizações e usuários de computadores, porém causou também uma maior exposição dos sistemas computacionais interligados em rede. Inúmeros têm sido os esforços para conter o crescente aumento dos ataques que ocorrem no mundo todo, dentre os quais inclui-se o desenvolvimento de sistemas operacionais mais seguros. Entretanto, a adoção desses sistemas ainda é incipiente, devido a várias dificul-dades envolvidas no processo, dentre as quais destaca-se a complexidade de configuração e gerenciamento de políticas de segurança. Nesta dissertação, são apresentados os aspectos estudados durante o desenvolvimento do mestrado, que permitiram a identificação dos problemas atuais associados a segu-rança de sistemas operacionais e políticas de segurança. Isso resultou no projeto e imple-mentação do Policy Viewer, uma ferramenta de visualização de políticas de segurança. Sua finalidade é auxiliar o administrador de políticas na compreensão, visualização e verificação das políticas de segurança especificadas para o sistema operacional. Utilizando as características apresentadas no projeto, foi desenvolvida uma imple-mentação parcial da ferramenta contendo um subconjunto das funcionalidades previstas, sobre o qual foram elaborados exemplos para demonstrar sua utilidade no auxilio da configuração de políticas e na identificação de problemas da política especificada / Abstract: The Internet brought great benefits to organizations and computer users, but has also caused a larger exposure of the computing systems connected to the network. Countless efforts are being made to contain the increasingly higher leveI of attacks that happen ali over the world, among which stands the development of safer operating systems. Un-fortunately, the adoption of these systems is still incipient, because of several obstacles involved in the processo One of them is the complexity of configuring and managing security policies.This dissertation shows aspects of operating system security and security policies stu-died during the Masters program, leading to the identification of current problems asso-ciated with them. This resulted in the project and implementation of Policy Viewer, a tool for the visualization of security policies. Its purpose is to aid the policy administrator in the comprehension, visualization and validation of operating systems security policies. The tool has been partialiy implemented with a subset of the intended functions, using the features presented in the project. Also, examples are shown to demonstrate its utility toward aiding in the process of policy configuration and in the identification of possible problems of such policies / Mestrado / Mestre em Ciência da Computação

Orientador: Edmundo Roberto Mauro Madeira / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-08T13:56:53Z (GMT). No. of bitstreams: 1 Malheiros_NeumarCosta_M.pdf: 2725607 bytes, checksum: f54c00065fc570ea3f84ae73359abcf8 (MD5) Previous issue date: 2006 / Resumo: Um plano de controle distribuído, como a arquitetura GMPLS (Generalized Multiprotocol Label Switching), permite o aprovisionamento dinâmico de conexões em redes de transporte de camada 1, como redes ópticas ou redes TDM (Time Division Multiplexing). Dessa forma, essas redes podem oferecer serviços mais sofisticados como serviços VPN (Virtual Private Network). Esses serviçõs, então denominados VPN de camada 1 (L1VPN - Layer 1 VPN), permitem que a infra-estrutura de transporte do provedor seja compartilhada entre múltiplas redes clientes. Neste trabalho, é proposta uma arquitetura para gerência de serviços L1VPN. A abordagem foi utilizar o paradigma de Gerência Baseada em Políticas (PBM ? Policy-Based Management) para prover aos clientes um certo nível de controle e gerência sobre suas L1VPNs. Além disso, é apresentada a implementação de um protótipo da arquitetura proposta, assim como uma discussão das implicações de diferentes políticas para a gerência de configuração de serviços L1VPN, a partir de um estudo de caso / Abstract: A distributed control plane architecture as GMPLS enhances transport networks with dynamic connection control. As a result, it allows the provisioning of advanced connectivity services, like Virtual Private Networks (VPNs), on layer 1 switching networks as optical and TDM networks. Such Layer 1 VPN (L1VPN) services enable multiple customer networks to share a single transport network. In this work, an architecture for L1VPN management is proposed. The approach is based on Policy-Based Management (PBM) to provide customers with some level of control and management over their L1VPNs. Furthermore, a prototype implementation of the proposed architecture is presented and from a case study implications of different policies for L1VPN service configuration management are discussed. / Mestrado / Mestre em Ciência da Computação