DocumentCode :
2839792
Title :
Shuffling with a Croupier: Nat-Aware Peer-Sampling
Author :
Dowling, Jim ; Payberah, Amir H.
fYear :
2012
fDate :
18-21 June 2012
Firstpage :
102
Lastpage :
111
Abstract :
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.
Keywords :
Estimation; IP networks; Internet; Peer to peer computing; Protocols; Relays; Servers; Gossip Peer Sampling; NAT; P2P Networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems (ICDCS), 2012 IEEE 32nd International Conference on
Conference_Location :
Macau, China
ISSN :
1063-6927
Print_ISBN :
978-1-4577-0295-2
Type :
conf
DOI :
10.1109/ICDCS.2012.19
Filename :
6257983
Link To Document :
بازگشت