Shuffling with a Croupier: Nat-Aware Peer-Sampling

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.

[1]  Géza Schay.  Introduction to probability with statistical applications , 2007 .

[2]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[3]  Jim Dowling,et al.  Usurp: distributed NAT traversal for overlay networks , 2011, DAIS'11.

[4]  Benjamin Van Roy,et al.  Consensus Propagation , 2005, IEEE Transactions on Information Theory.

[5]  João Leitão,et al.  Balancing gossip exchanges in networks with firewalls , 2010, IPTPS.

[6]  Christian Huitema,et al.  STUN - Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs) , 2003, RFC.

[7]  Seif Haridi,et al.  NATCracker: NAT Combinations Matter , 2009, 2009 Proceedings of 18th International Conference on Computer Communications and Networks.

[8]  Amir H. Payberah,et al.  Gozar: NAT-friendly peer sampling with one-hop distributed NAT traversal , 2011, DAIS'11.

[9]  Jim Dowling,et al.  Developing, simulating, and deploying peer-to-peer systems using the Kompics component model , 2009, COMSWARE '09.

[10]  Márk Jelasity,et al.  T-Man: Gossip-based fast overlay topology construction , 2009, Comput. Networks.

[11]  Jim Dowling,et al.  Discovery of Stable Peers in a Self-organising Peer-to-Peer Gradient Topology , 2006, DAIS.

[12]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[13]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[14]  Guillaume Pierre,et al.  Adam2: Reliable Distribution Estimation in Decentralised Environments , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[15]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[16]  Anne-Marie Kermarrec,et al.  NAT-resilient Gossip Peer Sampling , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[17]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[18]  Henri E. Bal,et al.  ARRG: real-world gossiping , 2007, HPDC '07.

[19]  H. Sips,et al.  A Measurement of NAT & Firewall Characteristics in Peer to Peer Systems , 2009 .

[20]  Bo Li,et al.  Inside the New Coolstreaming: Principles, Measurements and Performance Implications , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[21]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[22]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[23]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.