• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Secure and Distributed Multicast Address Allocation on IPv6 Networks

Slaviero, Marco Lorenzo 10 February 2005 (has links)
Address allocation has been a limiting factor in the deployment of multicast solutions, and, as other multicast technologies advance, a general solution to this problem becomes more urgent. This study examines the current state of address allocation and finds impediments in many of the proposed solutions. A number of the weaknesses can be traced back to the rapidly ageing Internet Protocol version 4, and therefore it was decided that a new approach is required. A central part of this work relies on the newer Internet Protocol version 6, specifically the Unicast prefix based multicast address format. The primary aim of this study was to develop an architecture for secure distributed IPv6 multicast address allocation. The architecture should be usable by client applications to retrieve addresses which are globally unique. The product of this work was the Distributed Allocation Of Multicast Addresses Protocol, or DAOMAP. It is a system whichcan be deployed on nodes which wish to take part in multicast address allocation and an implementation was developed. Analysis and simulations determined that the devised model fitted the stated requirements, and security testing determinedthat DAOMAP was safe from a series of attacks. / Dissertation (MSc (Computer Science))--University of Pretoria, 2006. / Computer Science / unrestricted
2

GAAP: um protocolo de alocação de endereços para redes ad hoc móveis em cenários de emergência

Bacelar Júnior, Laércio Péricles 25 March 2011 (has links)
Made available in DSpace on 2015-04-11T14:02:39Z (GMT). No. of bitstreams: 1 laercio.pdf: 2277333 bytes, checksum: 0c22421ce1e12c94ae57ae0a4365183e (MD5) Previous issue date: 2011-03-25 / In emergency scenarios, such as in natural disasters, technological or manmade, search and rescue teams in the affected region may use solutions for mobile ad hoc networks (Mobile Ad hoc Networks - MANETs) to address any lack of network infrastructure communication. Emergency networks are those built on disaster scenarios and have properties such as robust and resilient communication, not necessarily have some communication infrastructure and mainly offer not only data communication but also voice. Thus, in case of lack of communication infrastructure, a MANET can act as an emergency network. For communication between nodes in a MANET can be performed, it is necessary that each node is configured with unique address. Due to the ability of nodes self-organize, by creating temporary and arbitrary topologies, address allocation should be done automatically. Many papers have appeared dealing with the allocation of addresses in MANETs, but most solutions presents a number of limitations related mainly to the limited applicability in scenarios and introduction of high control traffic on the network. In this context, this paper presents a new solution for address allocation that assigns unique addresses to nodes in emergency networks. Results showed that the proposed solution is efficient in critical scenarios in comparison with other protocols examined, with low latency to obtain an address and reduced control traffic on the network reduced. / Em cenários de emergência, tais como em desastres naturais, tecnológicos ou causados pelo homem, equipes de busca e resgate da região afetada podem utilizar soluções de redes ad hoc móveis (Mobile Ad hoc Networks - MANETs) para suprir eventuais carências de infraestrutura da rede de comunicação. Redes de emergência são aquelas construídas sobre cenários de desastres e têm propriedades tais como comunicação robusta e resiliente, não são necessariamente infraestruturadas e principalmente oferecem comunicação de dados e não somente voz. Assim, em caso de carência de infraestrutura de comunicação, uma MANET pode atuar como uma rede de emergência. Para que a comunicação entre os nós de uma MANET possa ser realizada, é necessário que cada nó esteja configurado com endereço único. Devido à capacidade dos nós de se auto-organizarem criando topologias temporárias e arbitrárias, a alocação de endereços deve seja feita de forma automática. Muitos trabalhos têm surgido tratando da alocação de endereços em MANETs, porém a maioria das soluções apresenta uma série de limitações relacionadas principalmente à aplicabilidade em cenários restritos e introdução de elevado tráfego de controle na rede. Neste contexto, este trabalho apresenta uma nova solução de alocação de endereços que atribui endereços únicos aos nós em redes de emergência. Resultados mostraram que a solução proposta se mostrou eficiente em cenários críticos em comparação com outros protocolos analisados, apresentando baixa latência na obtenção de endereço e tráfego de controle reduzido na rede.
3

Struktury budoucích směrovacích tabulek pro IPv6 / Future Structure of IPv6 Routing Tables

Kšica, Martin January 2010 (has links)
This thesis is focused on structure of future IPv6 routing tables. It contains basic information about IPv6 addresses , description of hierarchy address allocation, multihoming , strategy of IPv4/IPv6 address allocation, statistics of structure properties at routing tables and forecast of future space for address IPv6 protocol. Other part of this thesis is implementation of IPv6 address generator which generates addresses according given configuration. This thesis simultaneously includes investigation of strategy IPv6 address allocation at region of RIPE NCC organization.

Page generated in 0.1203 seconds