A collaborative P2P Scheme for NAT Traversal Server discovery based on topological information

e-Archivo Repository

Show simple item record

dc.contributor.author Cuevas Rumín, Rubén
dc.contributor.author Cuevas Rumín, Ángel
dc.contributor.author Cabellos-Aparicio, Albert
dc.contributor.author Jakab, Lorand
dc.contributor.author Guerrero López, María Carmen
dc.date.accessioned 2015-02-11T11:00:02Z
dc.date.available 2015-02-11T11:00:02Z
dc.date.issued 2010-08
dc.identifier.bibliographicCitation Computer Networks 54 (2010) 12, pp. 2071-2085
dc.identifier.issn 1389-1286
dc.identifier.uri http://hdl.handle.net/10016/20031
dc.description.abstract In the current Internet picture more than 70% of the hosts are located behind Network Address Translators (NATs). This is not a problem for the client/server paradigm. However, the Internet has evolved, and nowadays the largest portion of the traffic is due to peer-to-peer (p2p) applications. This scenario presents an important challenge: two hosts behind NATs (NATed hosts) cannot establish direct communications. The easiest way to solve this problem is by using a third entity, called Relay, that forwards the traffic between the NATed hosts. Although many efforts have been devoted to avoid the use of Relays, they are still needed in many situations. Hence, the selection of a suitable Relay becomes critical to many p2p applications. In this paper, we propose the Gradual Proximity Algorithm (GPA): a simple algorithm that guarantees the selection of a topologically close-by Relay. We present a measurement-based analysis, showing that the GPA minimizes both the delay of the relayed communication and the transit traffic generated by the Relay, being a QoS-aware and ISP-friendly solution. Furthermore, the paper presents the Peer-to-Peer NAT Traversal Architecture (P2P-NTA), which is a global, distributed and collaborative solution, based on the GPA. This architecture addresses the Relay discovery/selection problem. We have performed large-scale simulations based on real measurements, which validate our proposal. The results demonstrate that the P2P-NTA performs similarly to direct communications with reasonably large deployments of p2p applications. In fact, only 5% of the communications experience an extra delay that may degrade the QoS due to the use of Relays. Furthermore, the amount of extra transit traffic generated is only 6%. We also show that the P2P-NTA largely outperforms other proposals, where the QoS degradation affects up to more than 50% of the communications, and the extra traffic generated goes beyond 80%.
dc.description.sponsorship This work has been partially funded by the Grants MEDIANET (S2009/TIC-1466) from the Regional Government of Madrid and CON-PARTE (TEC2007-67966-C03- 03) by the Ministry of Science and Innovation of Spain.
dc.format.extent 15
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Elsevier
dc.rights © 2010 Elsevier
dc.subject.other p2p
dc.subject.other Relay
dc.subject.other NAT
dc.subject.other AS
dc.subject.other Simulation
dc.subject.other Measurements
dc.title A collaborative P2P Scheme for NAT Traversal Server discovery based on topological information
dc.type article
dc.description.status Publicado
dc.subject.eciencia Telecomunicaciones
dc.identifier.doi http://dx.doi.org/10.1016/j.comnet.2010.03.022
dc.rights.accessRights openAccess
dc.relation.projectID Comunidad de Madrid. S2009/TIC-1468/MEDIANET
dc.type.version acceptedVersion
dc.identifier.publicationfirstpage 2071
dc.identifier.publicationissue 12
dc.identifier.publicationlastpage 2085
dc.identifier.publicationtitle Computer Networks
dc.identifier.publicationvolume 54
dc.identifier.uxxi AR/0000007180
dc.affiliation.dpto UC3M. Departamento de Ingeniería Telemática
dc.affiliation.grupoinv UC3M. Grupo de Investigación: Network Technologies
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)

This item appears in the following Collection(s)

Show simple item record