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

dc.affiliation.dptoUC3M. Departamento de Ingeniería Telemáticaes
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Network Technologieses
dc.contributor.authorCuevas Rumín, Rubén
dc.contributor.authorCuevas Rumín, Ángel
dc.contributor.authorCabellos-Aparicio, Albert
dc.contributor.authorJakab, Lorand
dc.contributor.authorGuerrero López, María Carmen
dc.date.accessioned2015-02-11T11:00:02Z
dc.date.available2015-02-11T11:00:02Z
dc.date.issued2010-08
dc.description.abstractIn 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%.en
dc.description.sponsorshipThis 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.en
dc.description.statusPublicado
dc.format.extent15
dc.format.mimetypeapplication/pdf
dc.identifier.bibliographicCitationComputer Networks 54 (2010) 12, pp. 2071-2085en
dc.identifier.doihttp://dx.doi.org/10.1016/j.comnet.2010.03.022
dc.identifier.issn1389-1286
dc.identifier.publicationfirstpage2071
dc.identifier.publicationissue12
dc.identifier.publicationlastpage2085
dc.identifier.publicationtitleComputer Networksen
dc.identifier.publicationvolume54es
dc.identifier.urihttps://hdl.handle.net/10016/20031
dc.identifier.uxxiAR/0000007180
dc.language.isoeng
dc.publisherElsevieren
dc.relation.projectIDComunidad de Madrid. S2009/TIC-1468/MEDIANETes
dc.rights© 2010 Elsevieren
dc.rights.accessRightsopen access
dc.subject.ecienciaTelecomunicacioneses
dc.subject.otherp2pen
dc.subject.otherRelayen
dc.subject.otherNATen
dc.subject.otherASen
dc.subject.otherSimulationen
dc.subject.otherMeasurementsen
dc.titleA collaborative P2P Scheme for NAT Traversal Server discovery based on topological informationen
dc.typeresearch article*
dc.type.hasVersionAM*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
collaborative_CN_2010_ps.pdf
Size:
1.36 MB
Format:
Adobe Portable Document Format