Gozar: NAT-friendly peer sampling with one-hop distributed NAT traversal

Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) cause most existing gossiping protocols to break down, as nodes cannot establish direct connections to nodes behind NATs (private nodes). In addition, most of the existing NAT traversal algorithms for establishing connectivity to private nodes rely on third party servers running at a well-known, public IP addresses. In this paper, we present Gozar, a gossip-based peer sampling service that: (i) provides uniform random samples in the presence of NATs, and (ii) enables direct connectivity to sampled nodes using a fully distributed NAT traversal service, where connection messages require only a single hop to connect to private nodes. We show in simulation that Gozar preserves the randomness properties of a gossip-based peer sampling service. We show the robustness of Gozar when a large fraction of nodes reside behind NATs and also in catastrophic failure scenarios. For example, if 80% of nodes are behind NATs, and 80% of the nodes fail, more than 92% of the remaining nodes stay connected. In addition, we compare Gozar with existing NAT-friendly gossip-based peer sampling services, Nylon and ARRG. We show that Gozar is the only system that supports one-hop NAT traversal, and its overhead is roughly half of Nylon's.

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

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

[3]  Amir H. Payberah,et al.  Sepidar: Incentivized Market-Based P2P Live-Streaming on the Gradient Overlay Network , 2010, 2010 IEEE International Symposium on Multimedia.

[4]  Saikat Guha,et al.  Characterization and measurement of TCP traversal through NATs and firewalls , 2005, IMC '05.

[5]  Bryan Ford,et al.  State of Peer-to-Peer (P2P) Communication across Network Address Translators (NATs) , 2008, RFC.

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

[7]  Johan A. Pouwelse,et al.  Modeling and analyzing the effects of firewalls and NATs in P2P swarming systems , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

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

[9]  Márk Jelasity,et al.  Epidemic-style proactive aggregation in large overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[10]  Bryan Ford,et al.  Peer-to-Peer Communication Across Network Address Translators , 2005, USENIX Annual Technical Conference, General Track.

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

[12]  BabaogluOzalp,et al.  Gossip-based aggregation in large dynamic networks , 2005 .

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

[14]  Jonathan D. Rosenberg,et al.  Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols , 2010, RFC.

[15]  Jim Dowling,et al.  P2P VoD using the self-organizing gradient overlay network , 2010, SOAR '10.

[16]  Peter Tiño,et al.  Adapting to NAT timeout values in P2P overlay networks , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[17]  Marco Mellia,et al.  Revealing skype traffic: when randomness plays with you , 2007, SIGCOMM 2007.

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

[19]  Ray Hunt,et al.  NAT Traversal Techniques in Peer-to-Peer Networks , 2008 .

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

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

[22]  Dan Wing,et al.  Session Traversal Utilities for NAT (STUN) , 2020, RFC.

[23]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2001, 2001 International Conference on Dependable Systems and Networks.

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

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

[26]  Jianping Pan,et al.  The impact of NAT on BitTorrent-like P2P systems , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

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

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

[29]  Amir H. Payberah,et al.  gradienTv: market-based P2P live media streaming on the gradient overlay , 2010, DAIS'10.

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

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