Uma arquitetura P2P baseada na hierarquia do endereçamento IP com roteamento unificado

There are some approaches that take advantage of unused computational resources in the Internet nodes - users´ machines. In the last years , the peer-to-peer networks (P2P) have gaining a momentum mainly due to its support for scalability and fault tolerance. However, current P2P architectures present some problems such as nodes overhead due to messages routing, a great amount of nodes reconfigurations when the network topology changes, routing traffic inside a specific network even when the traffic is not directed to a machine of this network, and the lack of a proximity relationship among the P2P nodes and the proximity of these nodes in the IP network. Although some architectures use the information about the nodes distance in the IP network, they use methods that require dynamic information. In this work we propose a P2P architecture to fix the problems afore mentioned. It is composed of three parts. The first part consists of a basic P2P architecture, called SGrid, which maintains a relationship of nodes in the P2P network with their position in the IP network. Its assigns adjacent key regions to nodes of a same organization. The second part is a protocol called NATal (Routing and NAT application layer) that extends the basic architecture in order to remove from the nodes the responsibility of routing messages. The third part consists of a special kind of node, called LSP (Lightware Super-Peer), which is responsible for maintaining the P2P routing table. In addition, this work also presents a simulator that validates the architecture and a module of the Natal protocol to be used in Linux routers

Mobile P2Ping: A Super-Peer based Structured P2P System Using a Fleet of City Buses

Recently, researchers have introduced the notion of super-peers to improve signaling efficiency as well as lookup performance of peer-to-peer (P2P) systems. In a separate development, recent works on applications of mobile ad hoc networks (MANET) have seen several proposals on utilizing mobile fleets such as city buses to deploy a mobile backbone infrastructure for communication and Internet access in a metropolitan environment. This paper further explores the possibility of deploying P2P applications such as content sharing and distributed computing, over this mobile backbone infrastructure. Specifically, we study how city buses may be deployed as a mobile system of super-peers. We discuss the main motivations behind our proposal, and outline in detail the design of a super-peer based structured P2P system using a fleet of city buses.

Modelling and analysis of new coolstreaming for P2P IPTV

Peer to peer networks are being used extensively nowadays for file sharing, video on demand and live streaming. For IPTV, delay deadlines are more stringent compared to file sharing. Coolstreaming was the first P2P IPTV system. In this paper, we model New Coolstreaming (newer version of Coolstreaming) via a queueing network. We use two time scale decomposition of Markov chains to compute the stationary distribution of number of peers and the expected number of substreams in the overlay which are not being received at the required rate due to parent overloading. We also characterize the end-to-end delay encountered by a video packet received by a user and originated at the server. Three factors contribute towards the delay. The first factor is the mean shortest path length between any two overlay peers in terms of overlay hops of the partnership graph which is shown to be O (log n) where n is the number of peers in the overlay. The second factor is the mean number of routers between any two overlay neighbours which is seen to be at most O (log N-I) where N-I is the number of routers in the internet. Third factor is the mean delay at a router in the internet. We provide an approximation of this mean delay E W]. Thus, the mean end to end delay in New Coolstreaming is shown to be upper bounded by O (log E N]) (log N-I) E (W)] where E N] is the mean number of peers at a channel.

Query routing in cooperative semi-structured peer-to-peer information retrieval networks

Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.

Espectro de polariton de plasmons e propriedades ópitcas de super-redes tipo cantor

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Ondas de spin em super-redes ferromagnéticas com campo de anisotropia

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Polaritons de exciton em super-redes semicondutoras

In this work we study the spectrum (bulk and surface modes) of exciton-polaritons in infinite and semi-infinite binary superlattices (such as, ···ABABA···), where the semiconductor medium (A), whose dielectric function depends on the frequency and the wavevector, alternating with a standard dielectric medium B. Here the medium A will be modeled by a nitride III-V semiconductor whose main characteristic is a wide-direct energy gap Eg. In particular, we consider the numerical values of gallium nitride (GaN) with a crystal structure wurtzite type. The transfer-matrix formalism is used to find the exciton-polariton dispersion relation. The results are obtained for both s (TE mode: transverse electric) and p (TM mode: transverse magnetic) polarizations, using three diferent kind of additional boundary conditions (ABC1, 2 e 3) besides the standard Maxwell's boundary conditions. Moreover, we investigate the behavior of the exciton-polariton modes for diferent ratios of the thickness of the two alternating materials forming the superlattice. The spectrums shows a confinement of the exciton-polariton modes due to the geometry of the superlattice. The method of Attenuated Total Reflection (ATR) and Raman scattering are the most adequate for probing this excitations

Excitações elementares em super-redes quasiperiódicas com simetria espelho

In this thesis, we investigated the magnonic and photonic structures that exhibit the so-called deterministic disorder. Speci cally, we studied the effects of the quasiperiodicity, associated with an internal structural symmetry, called mirror symmetry, on the spectra of photonics and magnonics multilayer. The quasiperiodicity is introduced when stacked layers following the so-called substitutional sequences. The three sequences used here were the Fibonacci sequence, Thue-Morse and double-period, all with mirror symmetry. Aiming to study the propagation of light waves in multilayer photonic, and spin waves propagation in multilayer magnonic, we use a theoretical model based on transfer matrix treatment. For the propagation of light waves, we present numerical results that show that the quasiperiodicity associated with a mirror symmetry greatly increases the intensity of transmission and the transmission spectra exhibit a pro le self-similar. The return map plotted for this system show that the presence of internal symmetry does not alter the pattern of Fibonacci maps when compared with the case without symmetry. But when comparing the maps of Thue-Morse and double-time sequences with their case without the symmetry mirror, is evident the change in the pro le of the maps. For magnetic multilayers, we work with two di erent systems, multilayer composed of a metamagnetic material and a non-magnetic material, and multilayers composed of two cubic Heisenberg ferromagnets. In the rst case, our calculations are carried out in the magnetostatic regime and calculate the dispersion relation of spin waves for the metamgnetic material considered FeBr2. We show the e ect of mirror symmetry in the spectra of spin waves, and made the analysis of the location of bulk bands and the scaling laws between the full width of the bands allowed and the number of layers of unit cell. Finally, we calculate the transmission spectra of spin waves in quasiperiodic multilayers consisting of Heisenberg ferromagnets. The transmission spectra exhibit self-similar patterns, with regions of scaling well-de ned in frequency and the return maps indicates only dependence of the particular sequence used in the construction of the multilayer

Simulação computacional de materiais com elétrons fortemente interagentes: DMRG aplicado a super-redes Hubbard com modulação de condução entre camadas

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Estudo da interação entre camadas de super-redes supercondutor/isolante/ferromagneto

Pós-graduação em Ciência e Tecnologia de Materiais - FC

Análise de desempenho de redes p2p com protocolo push/pull para distribuição de vídeo na presença de nós não-cooperativos.

O uso de Internet para a distribuição de fluxos de vídeo tem se mostrado uma tendência atual e traz consigo grandes desafios. O alicerce sobre qual a Internet está fundamentada, comutação por pacotes e arquitetura cliente-servidor, não proporciona as melhores condições para este tipo de serviço. A arquitetura P2P (peer-to-peer) vem sendo considerada como infraestrutura para a distribuição de fluxos de vídeo na Internet. A idéia básica da distribuição de vídeo com o suporte de P2P é a de que os vários nós integrantes da rede sobreposta distribuem e encaminham pedaços de vídeo de forma cooperativa, dividindo as tarefas, e colocando à disposição da rede seus recursos locais. Dentro deste contexto, é importante investigar o que ocorre com a qualidade do serviço de distribuição de vídeo quando a infraestrutura provida pelas redes P2P é contaminada por nós que não estejam dispostos a cooperar, já que a base desta arquitetura é a cooperação. Neste trabalho, inicialmente é feito um estudo para verificar o quanto a presença de nós não-cooperativos pode afetar a qualidade da aplicação de distribuição de fluxo de vídeo em uma rede P2P. Com base nos resultados obtidos, é proposto um mecanismo de incentivo à cooperação para que seja garantida uma boa qualidade de vídeo aos nós cooperativos e alguma punição aos nós não-cooperativos. Os testes e avaliações foram realizados utilizando-se o simulador PeerSim.

Adaptive Routing of QoS-constrained Media Streams over Scalable Overlay Topologies

Current research on Internet-based distributed systems emphasizes the scalability of overlay topologies for efficient search and retrieval of data items, as well as routing amongst peers. However, most existing approaches fail to address the transport of data across these logical networks in accordance with quality of service (QoS) constraints. Consequently, this paper investigates the use of scalable overlay topologies for routing real-time media streams between publishers and potentially many thousands of subscribers. Specifically, we analyze the costs of using k-ary n-cubes for QoS-constrained routing. Given a number of nodes in a distributed system, we calculate the optimal k-ary n-cube structure for minimizing the average distance between any pair of nodes. Using this structure, we describe a greedy algorithm that selects paths between nodes in accordance with the real-time delays along physical links. We show this method improves the routing latencies by as much as 67%, compared to approaches that do not consider physical link costs. We are in the process of developing a method for adaptive node placement in the overlay topology, based upon the locations of publishers, subscribers, physical link costs and per-subscriber QoS constraints. One such method for repositioning nodes in logical space is discussed, to improve the likelihood of meeting service requirements on data routed between publishers and subscribers. Future work will evaluate the benefits of such techniques more thoroughly.

Informed Content Delivery Across Adaptive Overlay Networks

Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large, multipoint transfers across richly connected overlay networks, focusing on the question of what to put in each transmitted packet. We first make the case for transmitting encoded content in this scenario, arguing for the digital fountain approach which enables end-hosts to efficiently restitute the original content of size n from a subset of any n symbols from a large universe of encoded symbols. Such an approach affords reliability and a substantial degree of application-level flexibility, as it seamlessly tolerates packet loss, connection migration, and parallel transfers. However, since the sets of symbols acquired by peers are likely to overlap substantially, care must be taken to enable them to collaborate effectively. We provide a collection of useful algorithmic tools for efficient estimation, summarization, and approximate reconciliation of sets of symbols between pairs of collaborating peers, all of which keep messaging complexity and computation to a minimum. Through simulations and experiments on a prototype implementation, we demonstrate the performance benefits of our informed content delivery mechanisms and how they complement existing overlay network architectures.

Estudo, desenvolvimento e caracterização de revestimentos do tipo super-rede de dureza

Nos últimos 10 anos, o desenvolvimento de técnicas de deposição e seus equipamentos permitiu o surgimento de novos tipos de filmes finos, principalmente voltados para aplicações mecânicas e tribológicas, que são multicamadas nanoestruturadas. Esses revestimentos apresentam propriedades que não são diretamente ligadas as propriedades das camadas individuais de cada material, geralmente apresentando valores de dureza extremamente elevados relacionados a um período de modulação crítico ΛC. Esses filmes demonstram um claro potencial para aplicações tribológicas mesmo com o seu comportamento de dureza ainda não completamente esclarecido. O objetivo deste trabalho é produzir multicamadas nanoestruturadas do tipo metal / nitreto pela técnica de magnetron sputtering usando Nb, Ta e TiN, visando obter uma estrutura com valores de dureza extremamente elevados, tipicamente observados em revestimentos do tipo super-redes. A estrutura periódica dos revestimentos com baixo valor de Λ (< 10 nm) foi caracterizada por XRR (Refletividade por Difração de Raios X) e por RBS (Espectrometria por Retroespalhamento Rutherford) para os valores altos de Λ. As propriedades mecânicas dos revestimentos foram avaliadas por testes instrumentados de dureza usando um equipamento Fischerscope HV100. Todas as multicamadas foram produzidas com sucesso e apresentaram uma periodicidade bem definida, o que foi confirmado pelos resultados de RBS e XRR. Os valores de dureza medidos apresentaram um comportamento tipicamente observado em superredes com um valor máximo maior que 50 GPa sempre relacionado a uma valor crítico de Λ. O valor ΛC foi 8 nm para as amostras de Nb/TiN e 4 nm para as amostras de Ta/TiN. A razão H/E indicou que o revestimento nanoestruturado mais adequado para aplicações tribológicas foram as multicamadas com maior valor de dureza. Esses resultados mostraram claramente a possibilidade de aplicação industrial destes revestimentos.