Design and evaluation of interconnecting structured peer-to-peer networks with a hierarchical topology

El tráfico en Internet está evolucionando continuamente. En el siglo XX, la mayor parte del tráfico en Internet soportado por los Proveedores de Servicios de Internet (ISP’s en terminología anglosajona) estaba relacionado con el tráfico web. Sin embargo, actualmente, el tráfico en Internet ha evolucionado drásticamente. La mayor parte del tráfico en Internet es tráfico Peer-to-Peer. Este cambio cambia completamente la situación en comparación con el siglo anterior, de ahí la relevancia del paradigma de las redes Peer-to-Peer. La adopción de las redes Peer-to-Peer está principalmente motivada por su uso en aplicaciones de compartición de ficheros pero la aplicación de las redes Peer-to-Peer no está sólo limitada al paradigma de compartición de ficheros. De hecho, las redes Peer-to-Peer son adecuadas para el desarrollo de cualquier servicio o aplicación distribuida ya que permiten almacenar información de manera distribuida entre un conjunto de nodos. Además, también permiten recuperar esa información cuando sea necesario. Una aplicación relevante basada en redes Peer-to-Peer es Skype la cual permite un servicio de VoIP entre varios millones de personas. Sin embargo, la interoperabilidad entre diferentes redes Peer-to-Peer no ha sido resuelta todavía. Cada red Peer-to-Peer define su propio mecanismo y su propio formato de paquete. Por lo tanto, sería deseable definir algún mecanismo que permita el intercambio de información entre diferentes redes Peer-to-Peer. Esta Tesis define un mecanismo que permite el intercambio de información entre diferentes redes Peer-to-Peer estructuradas, concretamente redes overlay basadas en DHT’s (Distributed Hash Tables). Este mecanismo está basado en un formato común de paquete, que asegura la interoperabilidad entre diferentes redes overlay, y en una arquitectura jerárquica. Esta arquitectura jerárquica está compuesta por dos niveles de jerarquáa. El nivel más bajo de la jerarquía está compuesto por las diferentes redes overlay que desean estar interconectadas. Cada una de estas redes overlay puede usar cualquier DHT, no existe ninguna restricción al respecto. Al menos un super-peer existe en cada una de estas redes overlay del nivel inferior; además, estos super-peer también participan en el nivel superior. Al nivel superior se le conoce como Red de Interconexión y está compuesto sólo por una red overlay. Su función es similar al servicio de DNS pero en el área de las redes Peer-to-Peer. En la Red de Interconexión se guarda la información de localización de cada uno de los super-peers y también el dominio o la overlay a la que representan. Por lo tanto, si un recurso de otra red quiere ser recuperado, un peer tiene que reenviar la petición a su super-peer. El super-peer consulta a la Red de Interconexión para localizar al super-peer que se hace cargo de la red destino donde se encuentra el recurso deseado y una vez que se localizar al super-peer, se le reenvía la petición. Finalmente, el super-peer en la red destino buscar el recurso deseado y lo envía de vuelta al peer que originó la petición. La arquitectura propuesta ha sido estudiada analíticamente para asegurar que el rendimiento es razonable en comparación con otras redes Peer-to-Peer. Además, la propuesta es validada con una herramienta de simulación para asegurar que las asunciones en el modelo analítico no afectan en un escenario más general. Finalmente, una implementación real sobre un entorno controlado es mostrada para demostrar la aplicabilidad y viabilidad de la propuesta. Los escenarios para las simulaciones y la verificación de la implementación han sido diseñados con especial cuidado para tener unas condiciones lo más cercanas posibles a escenarios reales.---------------------------------------------------------------------------------------------------------------------The traffic in the Internet is evolving continuously. In the 20th century, the most traffic supported by Internet Service Providers (ISP’s) was related with web traffic. However, nowadays, the traffic in the Internet has evolved drastically; now, most of the traffic in the Internet is Peer-to-Peer traffic. This fact changes completely the situation in comparison with the end of the previous century, thus the relevance of the Peer-to-Peer paradigm nowadays is evident. The adoption of Peer-to-Peer overlay networks was firstly motivated for its usage in file-sharing applications but the applicability of Peer-to-Peer overlay networks is not only limited to this kind of applications. In fact, Peer-to-Peer overlay networks are suitable for the development of any distributed application or service since they allow the allocation and retrieval of information in a distributed fashion among a set of nodes. However, each overlay network has its own structure and mechanisms to distribute the information among all nodes. Additionally, each Peer-to-Peer overlay network implementation usually defines its own packet format. Therefore, the interoperability among different overlay networks is not possible. This Thesis defines a mechanism to allow the exchange of information among different structured Peer-to Peer overlay networks, concretely DHT (Distributed Hash Table) overlay networks. This mechanism is based on both a common packet format, which assures the interoperability among different overlay networks, and on a hierarchical architecture. This hierarchical architecture has two levels of hierarchy. The lower level of the hierarchy is composed by the different overlay networks that want to be interconnected. Each one of these overlay networks can use any DHT overlay network with no restrictions. In addition, each overlay network in the lower level has at least one special peer, called super-peer. These super-peers are attached to the top level. This top level is named Interconnection Overlay and it is composed by just one overlay network. The purpose of super-peers is to route the queries among different overlay networks and they use the Interconnection Overlay to achieve this objective. In this Interconnection Overlay, the location information of each one of the superpeers and the overlay network represented by them are stored. Therefore, super-peers can forward the queries with the information stored in the Interconnection Overlay. If a resource placed in other overlay network wants to be obtained, a peer has to forward the query to its super-peer. The super-peer gets from the Interconnection Overlay the information about the super-peer that takes care of the destination overlay network and forwards this request. Finally, the super-peer in the destination overlay network looks for the desired resource and once is retrieved the answer is sent back to the requester. The proposed architecture is mathematically analysed to obtain is performance in term of hops and number of overlay routing entries in peers. Furthermore, the proposal is validated with a simulation tool to assure that the assumptions in the analytical model have been enough accurate. Finally, a real implementation over a controlled environment demonstrates the applicability and viability of the proposal and allows removing many of the original assumptions. The scenarios for the simulation analysis and the evaluation of the implementation have been designed carefully in order to define conditions as similar as possible to the real world

Analysis of searching mechanisms in hierarchical p2p based overlay networks

Proceedings of: The 6th Annual Mediterranean Ad Hoc Networking Workshop (Med Hoc Net 2007. (Corfu, Greece), June 2007This work presents a study of searching mechanisms in Peer-to-Peer (p2p) networks. The aim of this research line is to analyse cross-searching mechanisms that will allow the hierarchical interconnection of p2p networks. A set of relevant metrics for interconnection scenarios are defined to evaluate scalability, robustness and routing latency.This work has been partially supported by the European Union under the IST Content (FP6-2006-IST-507295) project and by the Madrid regional government under the Biogridnet (CAM, S-0505/TIC-0101) project.Publicad

Benefits of an Implementation of H-P2PSIP

[Paper presented at:] Second International Conference on Advances in P2P Systems. AP2PS 2010. October 25-30, Florence (Italy)In this paper, we report on the results of experiments with an implementation of H-P2PSIP, which allows the exchange of information among different DHTs (Distributed Hash Tables) making use of a hierarchical architecture. This paper validates our previous H-P2PSIP proposal in an environment with a real TCP/IP stack close to a real scenario. The results show how the benefits of this real H-P2PSIP implementation in terms of routing performance (number of hops), delay and routing state (number of routing entries) are better than a flat DHT overlay network and how the exchange of information among different DHT overlay networks is feasible.This work has been supported by the FP7 TREND Grant (agreement No. 257740) and by the Regional Government of Madrid under the MEDIANET project (CAM, S2009/TIC-1468).European Community's Seventh Framework ProgramPublicad

Benefits on using H-P2PSIP in mobile environments

Proceeding of: VIII Jornadas de Ingeniería Telemática (JITEL '09), Universidad Politécnica de Cartagena, Cartagena, Murcia, 15-17 de septiembre de 2009The use of peer-to-peer technologies is increasing everyday and the improvement of mobility technologies is a reality. Now, it is expected that peer-to-peer applications run on mobile devices, but the conjunction of these two technologies is an open research issue. The user mobility impacts on the churn suffered by peer-to-peer networks and consequently it impacts on their performance. Therefore, some mechanisms are necessary to minimize this undesirable effect. Our proposal tries to solve this problem by using a Hierarchical P2PSIP architecture where different overlays are used for different peer mobility behaviours and they are interconnected between them through an interconnection overlay. In this way it is possible for peers that share the same behaviour to choose a certain protocol or to optimize some functionality that suits best with their mobility situation, while maintaining connectivity with all peers.This research work is being supported by the European Commission under the IST Content Network of Excellence3 (FP6-2006-IST-038423), by the Regional Government of Madrid under the BioGridNet4 project (CAM, S-0505/TIC- 0101) and by the Ministry of Science and Innovation under the CONPARTE project (MEC, TEC2007-67966-C03-03/TCM).No publicad

Multicast traffic aggregation in MPLS-based VPN networks

This article gives an overview of the current practical approaches under study for a scalable implementation of multicast in layer 2 and 3 VPNs over an IP-MPLS multiservice network. These proposals are based on a well-known technique: the aggregation of traffic into shared trees to manage the forwarding state vs. bandwidth saving trade-off. This sort of traffic engineering mechanism requires methods to estimate the resources needed to set up a multicast shared tree for a set of VPNs. The methodology proposed in this article consists of studying the effect of aggregation obtained by random shared tree allocation on a reference model of a representative network scenario.Publicad

Off-line incentive mechanism for long-term P2P backup storage

This paper presents a micro-payment-based incentive mechanism for long-term peer-to-peer storage systems. The main novelty of the proposed incentive mechanism is to allow users to be off-line for extended periods of time without updating or renewing their information by themselves. This feature is enabled through a digital cheque, issued by the user, which is later employed by the peers to get a gratification for storing the user's information when the user is off-line. The proposed P2P backup system also includes a secure and lightweight data verification mechanism. Moreover, the proposed incentive also contributes to improve the availability of the stored information and the scalability of the whole system. The paper details the verification and cheque-based incentive mechanisms in the context of a P2P backup service and analyzes its scalability and security properties. The system is furthermore validated by means of simulation, proving the effectiveness of the proposed incentive.This work has been funded by the Regional Government of Madrid under the MEDIANET project (S2009/TIC-1468) and has also received funding from the Ministry of Science and Innovation of Spain, under the QUARTET project (TIN2009-13992-C02-01).Publicad

Validation of H-P2PSIP, a scalable solution for interoperability among different overlay networks

This paper reports the results of experiments from an implementation of H-P2PSIP, a hierarchical overlay architecture based on the ongoing work in the IETF P2PSIP Working Group. This architecture allows the exchange of information among different independent overlay networks through the use of a two-layer architecture based on super-peers and hierarchical identifiers. The validation of this proposal is based on a Linux based real implementation where we have used four different scenarios with 1,000 peers in order to perform different experiments. We have obtained results for different parameters such as routing performance (number of hops), delay, routing state (number of overlay routing entries) and bandwidth consumption.This research was supported in part by the European Commission Seventh Framework Programme under grant agreement n 25774 (TREND Network of Excellence), Comunidad de Madrid grant S-2009/TIC-1468 (MEDIANET project) and Spanish MICINN grant TEC2011-29688-C02-02 (eeCONTENT project).Publicad

Analysis of relod.net, a basic implementation of the RELOAD protocol for peer-to-peer networks

Actas de: XI Jornadas de Ingeniería Telemática (JITEL 2013) celebradas en Granada, 28-30 Octubre 2013. La web del evento es: http://dtstc.ugr.es/jitel2013/#The P2PSIP Working Group is chartered to develop protocols and mechanisms for the use of SIP in distributed environments, thus minimizing the need for centralized servers. Under this premise, the RELOAD protocol was created, whose design was generalized to accept other applications with similar requirements, and which is currently in process of standardization by the IETF. In this paper, we present a basic implementation and an analysis of this protocol proposed standard, given the great interest displayed in recent years by the scientific and business community in issues related to peerto- peer networks. Later, we conduct several experiments in order to validate its correct operation in real scenarios and provide feedback in relation with the current specificationThis research was supported in part by the Comunidad de Madrid grant S-2009/TIC-1468 (MEDIANET project).Publicad

Traffic engineering in multihomed sites

It is expected that IPv6 multihomed sites will obtain as many global prefixes as direct providers they have, so traffic engineering techniques currently used in IPv4 multihomed sites is no longer suitable. However, traffic engineering is required for several reasons, and in particular, for being able to properly support multimedia communications. In this paper we present a framework for traffic engineering in IPv6 multihomed sites with multiple global prefixes. Within this framework, we have included several tools such as DNS record manipulation and proper configuration of the policy table defined in RFC 3484. To provide automation in the management of traffic engineering, we analyzed the usage of two mechanisms to configure the policy table.This work has been partly supported by the European Union under the E-Next Project FP6-506869 and by the OPTINET6 project TIC-2003-09042-C03-01.Publicad

ILORIN: Identifier-locator resolution for infrastructure-less networks

This word is at: 2012 Third International Conference on the Network of the Future (NOF) took place 21-23 November in Tunis, Tunisia. web event http://www.ati.es/spip.php?article2118In order to overcome the limitations of the current Internet addressing, it is generally accepted that the Future Internet needs a separation between identifiers and network locators. Such identifier-locator split is also needed in infrastructureless networks, such as Mobile ad hoc Networks (MANETs) and Delay Tolerant Networks, since they are an integral part of the Future Internet. Despite the amount of work in infrastructurebased networks, only a few proposals have considered how to apply this identifier-locator split in infrastructure-less networks. The contribution of this paper is an identifier-locator resolution system that can work in sparse MANETs, which are prone to network partitions. Our approach is an identifier-locator association discovery system, which uses periodic beacons to exchange the resolution information, avoiding the establishment of shared state between nodes. Our system exploits the broadcast nature of the wireless medium, opportunistic encounters, and information replication to disseminate identifier-locator associations across the network. The results of our extensive experiments demonstrate that our solution outperforms the related work, achieving a higher identifier-locator association discovery rate. Index Terms—Identifier-Locator split, Resolution system, Mobile Ad Hoc Network, Delay Tolerant Network.This work has been funded by the VERDIKT Programme of the Norwegian Research Council throughthe DT-Stream project (project number 183312/S10) and the Regional Government of Madrid through the MEDIANET project (MEDIANET S2009/TIC-1468)Publicad