Relevant bibliographies by topics / Peer-to-Peer (P2P) Overlay

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Peer-to-Peer (P2P) Overlay'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Peer-to-Peer (P2P) Overlay.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Peer-to-Peer (P2P) Overlay"

1

GARCÉS-ERICE, L., E. W. BIERSACK, K. W. ROSS, P. A. FELBER, and G. URVOY-KELLER. "HIERARCHICAL PEER-TO-PEER SYSTEMS." Parallel Processing Letters 13, no. 04 (December 2003): 643–57. http://dx.doi.org/10.1142/s0129626403001574.

Full text
Abstract:
Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.
APA, Harvard, Vancouver, ISO, and other styles
2

Sawamura, Soichi, Ailixier Aikebaier, Valbona Barolli, and Makoto Takizawa. "Trustworthy acquaintances in Peer-to-Peer (P2P) overlay networks." International Journal of Business Intelligence and Data Mining 6, no. 1 (2011): 42. http://dx.doi.org/10.1504/ijbidm.2011.038273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

LE, HANH, DOAN HOANG, and ANDREW SIMMONDS. "PARM: A PHYSICALLY-AWARE REFERENCE MODEL FOR PEER-TO-PEER OVERLAY INTERNETWORKING." Journal of Interconnection Networks 07, no. 04 (December 2006): 451–74. http://dx.doi.org/10.1142/s0219265906001806.

Full text
Abstract:
Peer-to-Peer (P2P) technologies developed rapidly in different directions with various applications and routing mechanisms. Each of them deals with a particular task, and/or provides a specific service. They were developed separately without a unified architecture taking into account all the performance factors of a P2P system. This makes the P2P systems incomplete and their performances far from optimal. This trend also restricts the interoperability amongst the systems because of the lack of standardization in functional architectures of the P2P systems. As a result, tangible benefits for Internet users are limited because the edge-Internet resources are not sharable amongst the systems. Inspired by TCP/IP model, this paper introduces PARM: a Physically-Aware Reference Model for Overlay Internetworking, which is an open reference structure for designing better performance P2P systems. PARM divides major functional P2P system tasks into layers so that they can be tackled individually and efficiently. A Peer Name Service was developed to evaluate the model. The service interprets peer names into their current locations. Simulation results indicate that PARM helps to produce excellent performance overlays. The overlays can achieve desirable features such as decentralization, self-organization, scalability, low overhead and minimal delay penalty.
APA, Harvard, Vancouver, ISO, and other styles
4

Polaczyk, Bartosz, Piotr Chołda, and Andrzej Jajszczyk. "Peer-to-Peer Multicasting Inspired by Huffman Coding." Journal of Computer Networks and Communications 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/312376.

Full text
Abstract:
Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (RTT) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distributed paradigm is shown. Performance evaluation results prove that the proposed approach considerably improves the overlay efficiency from the viewpoint of end-users and content providers. Moreover, the proposed technique ensures a high level of resilience against gateway-link failures and adaptively reorganizes the overlay topology in case of dynamic, transient network fluctuations.
APA, Harvard, Vancouver, ISO, and other styles
5

Gharib, Mohammed, Marzieh Malekimajd, and Ali Movaghar. "SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems." Algorithms 11, no. 10 (October 2, 2018): 150. http://dx.doi.org/10.3390/a11100150.

Full text
Abstract:
Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead.
APA, Harvard, Vancouver, ISO, and other styles
6

WATANABE, KENICHI, NAOHIRO HAYASHIBARA, and MAKOTO TAKIZAWA. "CBF: LOOK-UP PROTOCOL FOR DISTRIBUTED MULTIMEDIA OBJECTS IN PEER-TO-PEER OVERLAY NETWORKS." Journal of Interconnection Networks 06, no. 03 (September 2005): 323–44. http://dx.doi.org/10.1142/s0219265905001459.

Full text
Abstract:
Various types of applications take usage of multimedia objects like music and movies. Multimedia objects are distributed in peer-to-peer (P2P) overlay networks since the objects are downloaded and personalized in computers, mainly personal computers interconnected with the Internet. An application would like to take some service of a target object. A target peer is a peer which can manipulate a target object. First, the application has to find target peers which can support enough quality of service (QoS) of target multimedia objects. Due to the scalability and variety of peers in P2P overlay networks, it is difficult, possibly impossible to maintain a centralized directory showing in which peer each object is distributed. In this paper, we newly take an acquaintance approach where each peer maintains its acquaintance peers. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate in P2P overlay networks. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. In addition, we discuss a new type of flooding algorithm named charge-based flooding (CBF) algorithm to find target peers based on charge and acquaintance concepts so that areas in P2P overlay networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding (CBF) algorithm compared with a traditional TTL-based flooding algorithm in terms of the number of messages transmitted in networks.
APA, Harvard, Vancouver, ISO, and other styles
7

PAPADAKIS, HARRIS, PARASKEVI FRAGOPOULOU, EVANGELOS P. MARKATOS, MARIOS D. DIKAIAKOS, and ALEXANDROS LABRINIDIS. "HASH-BASED OVERLAY PARTITIONING IN UNSTRUCTURED PEER-TO-PEER SYSTEMS." Parallel Processing Letters 19, no. 01 (March 2009): 57–71. http://dx.doi.org/10.1142/s0129626409000067.

Full text
Abstract:
Unstructured peer-to-peer (P2P) networks suffer from the increased volume of traffic produced by flooding. Methods such as random walks or dynamic querying managed to limit the traffic at the cost of reduced network coverage. In this paper, we propose a partitioning method of the unstructured overlay network into a relative small number of distinct subnetworks. The partitioning is driven by the categorization of keywords based on a uniform hash function. The method proposed in this paper is easy to implement and results in significant benefit for the blind flood method. Each search is restricted to a certain partition of the initial overlay network and as a result it is much more targeted. Last but not least, the search accuracy is not sacrificed to the least since all related content is searched. The benefit of the proposed method is demonstrated with extensive simulation results, which show that the overhead for the implementation and maintenance of this system is minimal compared to the resulted benefit in traffic reduction.
APA, Harvard, Vancouver, ISO, and other styles
8

Gottron, Christian, André König, and Ralf Steinmetz. "A Survey on Security in Mobile Peer-to-Peer Architectures—Overlay-Based vs. Underlay-Based Approaches." Future Internet 2, no. 4 (October 13, 2010): 505–32. http://dx.doi.org/10.3390/fi2040505.

Full text
Abstract:
Mobile Ad hoc networks (MANET) and Peer-to-Peer (P2P) networks share central characteristics such as their distributed and decentralized nature. Combining both networking paradigms results in a Mobile Peer-to-Peer (MP2P) system that operates independently from a preexisting infrastructure. Securing MP2P networks in terms of availability and robustness as basic demands in envisioned application scenarios like first responder operations is a challenging task. In this article, we present a survey of selected threats and of state of the art countermeasures for MANETs and P2P networks. Further, we discuss the efficiency of MANET and P2P security mechanisms when applied in MP2P networks.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Ming, and Jin Qiu Yang. "A Multi-Dimensional Query Scheme in Structured Overlays." Key Engineering Materials 439-440 (June 2010): 870–74. http://dx.doi.org/10.4028/www.scientific.net/kem.439-440.870.

Full text
Abstract:
Structured peer-to-peer (P2P) systems are creating a large proportion of network traffic in today’s Internet. Peer-to-peer systems enable access to data spread over an extremely large number of machines. A P2P system typically involves thousands or millions of live peers in the network. Multi-dimensional data indexing has received much attention in a centralized database. In this paper, we propose and evaluate a multi-dimensional searching scheme in structured P2P networks. We present the design and implementation of a peer-to-peer index service for high dimensional data that is capable of handling complex queries. We design a VibIndex scheme in structured P2P overlay networks. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to search efficiently.
APA, Harvard, Vancouver, ISO, and other styles
10

Nath, Prem. "A Survey over Mechanisms for Reducing Free Riding Behaviour in Structured P2P Networks." Science & Technology Journal 5, no. 2 (July 1, 2017): 110–15. http://dx.doi.org/10.22232/stj.2017.05.02.07.

Full text
Abstract:
P2P (peer-to-peer) overlays have attracted many researchers due to increase in Internet based P2P applications. A P2P overlay is a distributed system in which the independent nodes participate at their will to share resources in distributed manner. P2P overlays are designed for wired based communication systems but today P2P applications are becoming popular in wireless networks even in multi-hop wireless networks. Routing mechanism in P2P overlays is based on IP infrastructure and many protocols are deployed successfully for efficient and fair P2P applications. However, there are many challenges in designing and deployment of efficient and fair protocols for the P2P overlays. These overlays suffer from many challenges such as dynamic overlay management, lack of robust trust model, counterfeit content distribution, free riding, poor resource search scalability, security, etc. The churn rate of nodes (join and leave of nodes) in the P2P overlay makes overlay management and resource searching more challenging. The free riding nature of the nodes in a P2P overlay is undesirable and it creates unfairness in the P2P overlay. There are several mechanisms proposed such as Eigen Trust model, tit-for-tat policy, point-based incentive policy, Page Rank policy, layered taxation, advertisement of incentive, etc. for encouraging fairness in the P2P overlays. I have presented in-depth survey over free riding behaviour, its effect, and existing mechanisms to reduce free riding in structured P2P overlays.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Peer-to-Peer (P2P) Overlay"

1

Francesquini, Emilio de Camargo. "Hermes: um arcabouço para a programação de aplicações P2P." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-09062007-172437/.

Full text
Abstract:
Hermes é um arcabouço para a programação de aplicações P2P. Com ele, pode-se criar diversos tipos de aplicações distribuídas, sem se preocupar com a camada de comunicação. O Hermes não é uma implementação de uma rede de sobreposição P2P, e sim uma camada acima das implementações já existentes. O desenvolvedor da aplicação fica isolado da implementação da rede de sobreposição utilizada. Esse isolamento é feito de forma tal que não há limitações quanto à arquitetura de rede utilizada pela implementação, seja ela centralizada, descentralizada, distribuída estruturada ou distribuída não-estruturada. Entre os serviços oferecidos pelo Hermes estão: troca de mensagens, busca, comunicação em grupo e armazenamento distribuído. Geralmente, no início do desenvolvimento de uma aplicação distribuída, tem-se poucas informações sobre o seu tamanho final ou perfil de utilização. O Hermes possibilita ao desenvolvedor da aplicação adiar, até o momento da efetiva implantação do sistema, a decisão sobre qual arquitetura de rede ou qual implementação de rede de sobreposição são as mais apropriadas para suas necessidades. Possibilita também, quando o perfil de utilização muda com o tempo, a troca da implementação utilizada por uma outra que se adeque mais ao novo perfil sem alterações no código da aplicação.
Hermes is a framework for P2P application programming. Using it, one can create several kinds of distributed applications without worrying about the underlying network. Hermes is not a P2P overlay network implementation, but a shell envolving existing implementations. The application developer is isolated from the implementation of the overlay network in use. This isolation is done in a way that poses no limitations on the network architecture used, which may be centralized, decentralized, structured or unstructured. Amongst the services offered by Hermes are: message exchange, search, group communication, and distributed storage. In the early stages of the development of a distributed application, information as to its final size or utilization profile is often unknown. Hermes gives the application developer the possibility of delaying, until the actual moment of system deployment, the decision as to which network architecture or which overlay network implementation is the most appropriate. It also gives the developer the choice, when utilization profile changes over time, of replacing the network implementation with one more suitable to the application needs, without changes on the application code.
APA, Harvard, Vancouver, ISO, and other styles
2

FAIRBANKS, MICHAEL STEWART. "MINIMIZING CONGESTION IN PEER-TO-PEER NETWORKS UNDER THE PRESENCE OF GUARDED NODES." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1147362818.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Celebi, Remzi. "Design And Implementation Of A P2p Contracting Overlay." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610819/index.pdf.

Full text
Abstract:
Today, with widespread use of Internet in many areas, the common procedures frequently encountered in business life such as contracting and negotiation need to be automated. The distributed structure of the Internet and the difficulty of resources dispersed on one center makes such a system to have a distributed architecture . In this study, for first time, automatization of a contracting form through business processes was proposed and was carried out. A peer to peer process contracting overlay what we call Peer-Con is developed. The system is an extension of Java Agent Development Framework (JADE) and uses IEEE Foundation for Intelligent Physical Agents (FIPA) Agent Communication Language (ACL) standard. Cost aware flexible representation of process capabilities
description of an operator to decide on whether given capabilities turnout to an agreement or not and self organization of peer connectivity for better contracting performance are distinguishing features of the system. The system can easily be adapted to different domains while the core functionality remains the same. Practical use of Peer-Con is shown by two applications from different domains
Driving Route Calculation on Web Maps and Digital Signal Processing Module (DSPM) product planning domain.
APA, Harvard, Vancouver, ISO, and other styles
4

Baumung, Peter. "P2P-basierte Gruppenkommunikation in drahtlosen Ad-hoc-Netzen." Karlsruhe Univ.-Verl. Karlsruhe, 2008. http://d-nb.info/990446468/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abbas, Syed Muhammad, and Christopher Henricsson. "A Simulation Framework for Efficient Search in P2P Networks with 8-Point HyperCircles." Thesis, Jönköping University, Jönköping University, Jönköping University, JTH, Computer and Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-7404.

Full text
Abstract:

This report concerns the implementation of a simulation framework to evaluate an emerging peer-to-peer network topology scheme using 8-point hypercircles, entitled HyperCircle. This topology was proposed in order to alleviate some of the drawbacks of current P2P systems evolving in an uncontrolled manner, such as scalability issues, network overload and long search times. The framework is supposed to be used to evaluate the advantages of this new topology. The framework has been built on top of an existing simulator software solution, the selection of which was an important part of the development. Weighing different variables such as scalability and API usability, the selection fell on OverSim, an open-source discreet-event simulator based on OMNET++.

After formalizing the protocol for easier implementation, as well as extending it for better performance, implementation followed using C++ with OverSim’s API and simulation library. Implemented as a module (alongside other stock modules providing their own protocols such as Chord and Kademlia), it can be used in OverSim to simulate a user-defined network using one of the simulation routine applications provided (or using a custom application written by the user). For the purposes of this thesis, the standard application KBRTestApp was used; an application sending test messages between randomly selected nodes, while adding and removing nodes at specific time intervals. The adding and removing of nodes can be configured with probability parameters.

Tentative testing shows that this implementation of the HyperCircle protocol has a certain performance gain over the OverSim implementations of the Chord and Kademlia protocols, measurable in the time it takes a message to get from sender to recipient. Further testing is outside the scope of this thesis.

APA, Harvard, Vancouver, ISO, and other styles
6

Chowdhury, Farida. "Structured peer-to-peer overlays for NATed churn intensive networks." Thesis, University of Stirling, 2015. http://hdl.handle.net/1893/23038.

Full text
Abstract:
The wide-spread coverage and ubiquitous presence of mobile networks has propelled the usage and adoption of mobile phones to an unprecedented level around the globe. The computing capabilities of these mobile phones have improved considerably, supporting a vast range of third party applications. Simultaneously, Peer-to-Peer (P2P) overlay networks have experienced a tremendous growth in terms of usage as well as popularity in recent years particularly in fixed wired networks. In particular, Distributed Hash Table (DHT) based Structured P2P overlay networks offer major advantages to users of mobile devices and networks such as scalable, fault tolerant and self-managing infrastructure which does not exhibit single points of failure. Integrating P2P overlays on the mobile network seems a logical progression; considering the popularities of both technologies. However, it imposes several challenges that need to be handled, such as the limited hardware capabilities of mobile phones and churn (i.e. the frequent join and leave of nodes within a network) intensive mobile networks offering limited yet expensive bandwidth availability. This thesis investigates the feasibility of extending P2P to mobile networks so that users can take advantage of both these technologies: P2P and mobile networks. This thesis utilises OverSim, a P2P simulator, to experiment with the performance of various P2P overlays, considering high churn and bandwidth consumption which are the two most crucial constraints of mobile networks. The experiment results show that Kademlia and EpiChord are the two most appropriate P2P overlays that could be implemented in mobile networks. Furthermore, Network Address Translation (NAT) is a major barrier to the adoption of P2P overlays in mobile networks. Integrating NAT traversal approaches with P2P overlays is a crucial step for P2P overlays to operate successfully on mobile networks. This thesis presents a general approach of NAT traversal for ring based overlays without the use of a single dedicated server which is then implemented in OverSim. Several experiments have been performed under NATs to determine the suitability of the chosen P2P overlays under NATed environments. The results show that the performance of these overlays is comparable in terms of successful lookups in both NATed and non-NATed environments; with Kademlia and EpiChord exhibiting the best performance. The presence of NATs and also the level of churn in a network influence the routing techniques used in P2P overlays. Recursive routing is more resilient to IP connectivity restrictions posed by NATs but not very robust in high churn environments, whereas iterative routing is more suitable to high churn networks, but difficult to use in NATed environments. Kademlia supports both these routing schemes whereas EpiChord only supports the iterating routing. This undermines the usefulness of EpiChord in NATed environments. In order to harness the advantages of both routing schemes, this thesis presents an adaptive routing scheme, called Churn Aware Routing Protocol (ChARP), combining recursive and iterative lookups where nodes can switch between recursive and iterative routing depending on their lifetimes. The proposed approach has been implemented in OverSim and several experiments have been carried out. The experiment results indicate an improved performance which in turn validates the applicability and suitability of ChARP in NATed environments.
APA, Harvard, Vancouver, ISO, and other styles
7

Cavalcanti, de Castro Marcel. "Enhancing P2P Systems over Wireless Mesh Networks." Doctoral thesis, Karlstads universitet, Avdelningen för datavetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-8691.

Full text
Abstract:
Due to its ability to deliver scalable and fault-tolerant solutions, applications based on the peer-to-peer (P2P) paradigm are used by millions of users on the internet. Recently, wireless mesh networks (WMNs) have attracted a lot of interest from both academia and industry, because of their potential to provide flexible and alternative broadband wireless internet connectivity. However, due to various reasons such as unstable wireless link characteristics and multi-hop forwarding operation, the performance of current P2P systems is rather low in WMNs. This dissertation studies the technological challenges involved while deploying P2P systems over WMNs. We study the benefits of location-awareness and resource replication to the P2P overlay while targeting efficient resource lookup in WMNs. We further propose a cross-layer information exchange between the P2P overlay and the WMN in order to reduce resource lookup delay by augmenting the overlay routing table with physical neighborhood and resource lookup history information. Aiming to achieve throughput maximization and fairness in P2P systems, we model the peer selection problem as a mathematical optimization problem by using a set of mixed integer linear equations. A study of the model reveals the relationship between peer selection, resource replication and channel assignment on the performance of P2P systems over WMNs. We extend the model by formulating the P2P download problem as chunk scheduling problem. As a novelty, we introduce constraints to model the capacity limitations of the network due to the given routing and channel assignment strategy. Based on the analysis of the model, we propose a new peer selection algorithm which incorporates network load information and multi-path routing capability. By conducting testbed experiments, we evaluate the achievable throughput in multi-channel multi-radio WMNs. We show that the adjacent channel interference (ACI) problem in multi-radio systems can be mitigated, making better use of the available spectrum. Important lessons learned are also outlined in order to design practical channel and channel bandwidth assignment algorithms in multi-channel multi-radio WMNs.
APA, Harvard, Vancouver, ISO, and other styles
8

Rosa, Diego Moreira da. "Suporte a cooperação em sistemas de gerenciamento de redes utilizando tecnologias peer-to-peer." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2007. http://hdl.handle.net/10183/12008.

Full text
Abstract:
O gerenciamento das redes de comunicações modernas frequentemente requer que operadores de diferentes domínios administrativos interajam uns com os outros de modo a realizar uma tarefa de gerenciamento de maneira cooperativa. Nesse contexto, pode-se observar que há distribuição tanto na execução das ações como na tomada das decisões pelos operadores participantes da sessão de gerenciamento. As soluções tradicionais de gerenciamento de redes praticamente não oferecem suporte algum ao gerenciamento baseado na cooperação entre humanos, pois foram concebidas levando em consideração um único domínio administrativo sendo gerenciado por um único operador ou por um grupo de operadores pertencentes a uma mesma organização. Visando solucionar esse problema, é introduzido nesse trabalho o uso de tecnologias peer-to-peer (P2P) em soluções de gerenciamento de redes de modo a permitir o gerenciamento baseado na cooperação entre humanos. Nessa abordagem, operadores de rede usam ferramentas híbridas que, ao mesmo tempo, gerenciam os seus domínios locais e fazem parte de um sistema P2P de gerenciamento. A proposta de gerenciamento apresentada foi implementada através de uma ferramenta chamada ManP2P, a qual combina funcionalidades de gerenciamento de redes e trabalho cooperativo.
Modern networks not rarely require human operators from different administrative domains to interact with one another in order to accomplish a management task in a cooperative fashion. In this scenario one observes that not only management actions are executed in a distributed way, but also the management decisions are cooperatively taken by all autonomous operators participating in a management session. Traditional management solutions fail to support human centered cooperative management because they were conceived considering a single administrative domain being managed by a single operator or by a group of operators belonging to the same organization. In order to address this issue, we introduce in this paper the use of peer-to-peer (P2P) technologies in network management solutions to enable human-centered cooperative management. In this approach, network operators use hybrid tools that both manage their local domains and are peers of an overlay management system. We have implemented the proposed management approach through a tool called ManP2P, which combines network management and groupware functionalities.
APA, Harvard, Vancouver, ISO, and other styles
9

Pinheiro, Marcos Cesar Madruga Alves. "Uma arquitetura P2P baseada na hierarquia do endere?amento IP com roteamento unificado." Universidade Federal do Rio Grande do Norte, 2006. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15177.

Full text
Abstract:
Made available in DSpace on 2014-12-17T14:55:03Z (GMT). No. of bitstreams: 1 MarcosCMAP.pdf: 634837 bytes, checksum: 4a0393d7f7dbe297fda66b1ed1859c99 (MD5) Previous issue date: 2006-02-20
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
Entre as diversas abordagens para se aproveitar os recursos computacionais ociosos existentes nas folhas da Internet, ou seja, nas m?quinas dos usu?rios, as redes peer-to-peer (P2P) v?m ganhando destaque especial nos ?ltimos anos devido principalmente ? sua escalabilidade, desempenho e toler?ncia ? falhas. As arquiteturas P2P atuais, entretanto, ainda apresentam alguns problemas como a sobrecarga nos n?s devido ? realiza??o do roteamento de mensagens, o n?mero elevado de n?s reconfigurados devido ? mudan?as de topologia da rede, a exist?ncia de tr?fego de roteamento dentro das redes das organiza??es que n?o ? destinado a nenhuma de suas m?quinas e ? aus?ncia de rela??o entre a proximidade dos n?s na rede P2P e a proximidade desses n?s na rede IP. Embora algumas arquiteturas considerem essas dist?ncias na rede IP, o fazem atrav?s de m?todos que requerem a troca de informa??es constantemente. Nesse trabalho n?s propomos uma arquitetura P2P para resolver os problemas citados. Essa arquitetura ? composta por tr?s partes. A primeira parte consiste em uma arquitetura P2P b?sica, chamada SGrid, que mant?m a rela??o dos n?s na rede P2P com suas posi??es na rede IP e atribui regi?es de chaves adjacentes para n?s de uma mesma organiza??o. A segunda parte consiste em um protocolo chamado NATal (Routing and NAT application layer) que estende a arquitetura b?sica para retirar dos n?s a fun??o de roteamento de mensagens. A terceira parte consiste de um tipo especial de n?, chamado LSP (Lightware Super-Peer), que ? o respons?vel pela manuten??o das tabelas de roteamento P2P. Al?m da descri??o da arquitetura proposta e da especifica??o dos protocolos SGrid e NATal, esse trabalho apresenta o simulador desenvolvido para validar a arquitetura e um m?dulo para ser utilizado em roteadores Linux que implementa o protocolo Natal
APA, Harvard, Vancouver, ISO, and other styles
10

Mani, Mehdi. "Stratégies d'overlay de service : d'une architecture centalisée vers le Pair-à-Pair." Paris 6, 2008. http://www.theses.fr/2008PA066188.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Peer-to-Peer (P2P) Overlay"

1

Kolberg, Mario. "Employing Multicast in P2P Overlay Networks." In Handbook of Peer-to-Peer Networking, 861–74. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-09751-0_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Zheng, Shu-Ming Shi, and Jing Zhu. "SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT." In Peer-to-Peer Systems II, 170–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45172-3_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Goudarzi Nemati, Alireza, Tomoya Enokido, and Makoto Takizawa. "A Multi-Source Streaming Model for Mobile Peer-to-Peer (P2P) Overlay Networks." In Network-Based Information Systems, 122–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-85693-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shen, Haiying. "Load Balancing in Peer-to-Peer Systems." In Handbook of Research on Scalable Computing Technologies, 163–90. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-661-7.ch008.

Full text
Abstract:
Structured peer-to-peer (P2P) overlay networks like Distributed Hash Tables (DHTs) map data items to the network based on a consistent hashing function. Such mapping for data distribution has an inherent load balance problem. Thus, a load balancing mechanism is an indispensable part of a structured P2P overlay network for high performance. The rapid development of P2P systems has posed challenges in load balancing due to their features characterized by large scale, heterogeneity, dynamism, and proximity. An efficient load balancing method should flexible and resilient enough to deal with these characteristics. This chapter will first introduce the P2P systems and the load balancing in P2P systems. It then introduces the current technologies for load balancing in P2P systems, and provides a case study of a dynamism-resilient and proximity-aware load balancing mechanism. Finally, it indicates the future and emerging trends of load balancing, and concludes the chapter.
APA, Harvard, Vancouver, ISO, and other styles
5

Barth, Antje, Michael Kleis, Andreas Klenk, Benoit Radier, Sanaa Elmoumouhi, Georg Carle, and Mikael Salaun. "Context Dissemination in Peer-to-Peer Networks." In Developing Advanced Web Services through P2P Computing and Autonomous Agents, 69–90. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-973-6.ch005.

Full text
Abstract:
In recent years, peer-to-peer overlay networks have become a popular communication paradigm with the potential to further change communication fundamentally in the future. Overlays allow communication abstraction but suffer from one inherent problem: The overlay is unaware of the context of a service or the context of a service consumer. The concept of context-awareness emerged out of the research done within the area of ubiquitous computing. Context-aware computing is one key technology to enable services and applications in the communication environment to adapt their behaviour based on the knowledge of environmental (contextual) information, thereby enhancing the system’s ability to become ever more responsive to the needs of the end-user or application domain. In this chapter we first introduce context and context architectures in general. In the remainder of the chapter we focus on the question: How can highly distributed context information be located and retrieved regarding small-scale as well as large-scale networks, addressing the topics of inter-domain management and scalability of context architectures?
APA, Harvard, Vancouver, ISO, and other styles
6

"Scalable and Secure P2P Overlay Networks." In Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, 830–61. Auerbach Publications, 2005. http://dx.doi.org/10.1201/9780203323687-52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Cheng-Zhong, Aharon Brodie, Haiying Shen, and Weisong Shi. "Scalable and Secure P2P Overlay Networks." In Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. Auerbach Publications, 2005. http://dx.doi.org/10.1201/9780203323687.ch46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zheng, Xianghan, and Vladimir Oleshchuk. "Security Enhancement of Peer-to-Peer Session Initiation." In Threats, Countermeasures, and Advances in Applied Information Security, 281–308. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0978-5.ch015.

Full text
Abstract:
Today, Peer-to-Peer SIP based communication systems have attracted much attention from both the academia and industry. The decentralized nature of P2P might provide the distributed peer-to-peer communication system without help of the traditional SIP server. However, the decentralization features come to the cost of the reduced manageability and create new concerns. Until now, the main focus of research was on the availability of the network and systems, while few attempts are put on protecting privacy. In this chapter, we investigate on P2PSIP security issues and introduce two enhancement solutions: central based security and distributed trust security, both of which have their own advantages and disadvantages. After that, we study appropriate combination of these two approaches to get optimized protection. Our design is independent of the DHT (Distributed Hash Table) overlay technology. We take the Chord overlay as the example, and then, analyze the system in several aspects: security & privacy, number-of the hops, message flows, etc.
APA, Harvard, Vancouver, ISO, and other styles
9

Haridi, Seif, and Sameh El-Ansary. "An Overview of Structured P2P Overlay Networks." In Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks. Auerbach Publications, 2005. http://dx.doi.org/10.1201/9780203323687.ch39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Qiao, Ying, Shah Asaduzzaman, and Gregor V. Bochmann. "Peer-to-Peer Platforms for High-Quality Web Services." In Developing Advanced Web Services through P2P Computing and Autonomous Agents, 158–77. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-973-6.ch009.

Full text
Abstract:
This chapter presents a clustered peer-to-peer system as a resource organization structure for web-service hosting platforms. Where service quality, such as response time and service availability, are provided with assurance. The peer-to-peer organization allows integration of autonomous resources into a single platform in a scalable manner. In clustered peer-to-peer systems, nodes are organized into clusters based on some proximity metric, and a distributed hash table overlay is created among the clusters. This organization enables lightweight techniques for load balancing among different clusters, which is found to be essential for providing response time guarantees. Service availability is provided by replicating a service instance in multiple nodes in a cluster. A decentralized load balancing technique called diffusive load balancing is presented in the context of clustered peer-to-peer systems and evaluated for effectiveness and performance.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Peer-to-Peer (P2P) Overlay"

1

Zhang, Qi, Marco Piumatti, and Sandeep K. Singhal. "Private Peer-to-Peer Overlay for Real-Time Monitoring of a Deployed Internet-Scale Peer-to-Peer Overlay." In Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007). IEEE, 2007. http://dx.doi.org/10.1109/p2p.2007.27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Qi, Marco Piumatti, and Sandeep K. Singhal. "Private Peer-to-Peer Overlay for Real-Time Monitoring of a Deployed Internet-Scale Peer-to-Peer Overlay." In Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007). IEEE, 2007. http://dx.doi.org/10.1109/p2p.2007.4343487.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kovacevic, Aleksandra, Nicolas Liebau, and Ralf Steinmetz. "Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search." In 2007 7th International Conference on Peer-to-Peer Computing. IEEE, 2007. http://dx.doi.org/10.1109/p2p.2007.18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cheng, Bow-Nan, Murat Yuksel, and Shivkumar Kalyanaraman. "Virtual Direction Routing for overlay networks." In 2009 IEEE Ninth International Conference on Peer-to-Peer Computing (P2P). IEEE, 2009. http://dx.doi.org/10.1109/p2p.2009.5284516.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Frey, Davide, and Amy L. Murphy. "Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks." In 2008 Eighth International Conference on Peer-to-Peer Computing (P2P). IEEE, 2008. http://dx.doi.org/10.1109/p2p.2008.30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jimenez, Raul, Flutra Osmani, and Bjorn Knutsson. "Sub-second lookups on a large-scale Kademlia-based overlay." In 2011 IEEE International Conference on Peer-to-Peer Computing (P2P). IEEE, 2011. http://dx.doi.org/10.1109/p2p.2011.6038665.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wolinsky, D. I., P. St. Juste, P. O. Boykin, and R. Figueiredo. "Addressing the P2P Bootstrap Problem for Small Overlay Networks." In 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P). IEEE, 2010. http://dx.doi.org/10.1109/p2p.2010.5569960.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gross, Christian, Dominik Stingl, Bjorn Richerzhagen, Andreas Hemel, Ralf Steinmetz, and David Hausheer. "Geodemlia: A robust peer-to-peer overlay supporting location-based search." In 2012 IEEE Twelfth International Conference on Peer-to-Peer Computing (P2P). IEEE, 2012. http://dx.doi.org/10.1109/p2p.2012.6335806.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hofstätter, Quirin, Stefan Zöls, Maximilian Michel, Zoran Despotovic, and Wolfgang Kellerer. "Chordella - A Hierarchical Peer-to-Peer Overlay Implementation for Heterogeneous, Mobile Environments." In 2008 Eighth International Conference on Peer-to-Peer Computing (P2P). IEEE, 2008. http://dx.doi.org/10.1109/p2p.2008.42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shafaat, Tallat M., Ali Ghodsi, and Seif Haridi. "Handling Network Partitions and Mergers in Structured Overlay Networks." In Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007). IEEE, 2007. http://dx.doi.org/10.1109/p2p.2007.42.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Peer-to-Peer (P2P) Overlay"

1

Song, H., X. Jiang, R. Even, D. Bryan, and Y. Sun. Peer-to-Peer (P2P) Overlay Diagnostics. RFC Editor, May 2016. http://dx.doi.org/10.17487/rfc7851.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Peer-to-Peer (P2P) Overlay' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography