Shuffling with a Croupier: Nat-Aware Peer-Sampling
2012 (English)In: Proceedings of the 2012 32nd IEEE International Conference on Distributed Computing Systems (ICDCS 2012) / [ed] Lisa O'Conner, IEEE Computer Society, 2012, 102-111 p.Conference paper (Refereed)
Despite much recent research on peer-to-peer (P2P) protocols for the Internet, there have been relatively few practical protocols designed to explicitly account for Network Address Translation gateways (NATs). Those P2P protocols that do handle NATs circumvent them using relaying and hole-punching techniques to route packets to nodes residing behind NATs. In this paper, we present Croupier, a peer sampling service (PSS) that provides uniform random samples of nodes in the presence of NATs in the network. It is the first NAT-aware PSS that works without the use of relaying or hole-punching. By removing the need for relaying and hole-punching, we decrease the complexity and overhead of our protocol as well as increase its robustness to churn and failure. We evaluated Croupier in simulation, and, in comparison with existing NAT-aware PSS', our results show similar randomness properties, but improved robustness in the presence of both high percentages of nodes behind NATs and massive node failures. Croupier also has substantially lower protocol overhead.
Place, publisher, year, edition, pages
IEEE Computer Society, 2012. 102-111 p.
Gossip peer sampling, NAT, P2P networks
IdentifiersURN: urn:nbn:se:kth:diva-92085DOI: 10.1109/ICDCS.2012.19ISI: 000309229600011ScopusID: 2-s2.0-84866901273OAI: oai:DiVA.org:kth-92085DiVA: diva2:511993
The 32nd IEEE International Conference on Distributed Computing Systems (ICDCS), Macau, China, June 2012
QC 201211212012-03-272012-03-262012-11-21Bibliographically approved