Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arad, C., Dowling, J., Haridi, S.: Developing, simulating, and deploying peer-to-peer systems using the kompics component model. In: COMSWARE 2009: Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE, pp. 1–9. ACM, New York (2009)
Berthou, G., Dowling, J.: P2p vod using the self-organizing gradient overlay network. In: SOAR 2010: Proceeding of the Second International Workshop on Self-Organizing Architectures, pp. 29–34. ACM, New York (2010)
Bonfiglio, D., Mellia, M., Meo, M., Rossi, D., Tofanelli, P.: Revealing skype traffic: when randomness plays with you. SIGCOMM Comput. Commun. Rev. 37(4), 37–48 (2007)
Drost, N., Ogston, E., van Nieuwpoort, R.V., Bal, H.E.: Arrg: real-world gossiping. In: HPDC 2007: Proceedings of the 16th International Symposium on High Performance Distributed Computing, pp. 147–158. ACM, New York (2007)
DAcunto, L., Meulpolder, M., Rahman, R., Pouwelse, J.A., Sips, H.J.: Modeling and analyzing the effects of firewalls and nats in p2p swarming systems. In: Proceedings IPDPS 2010 (HotP2P 2010). IEEE, Los Alamitos (April 2010)
DAcunto, L., Pouwelse, J.A., Sips, H.J.: A measurement of nat and firewall characteristics in peer-to-peer systems. In: Wolters, L., Gevers, T., Bos, H. (eds.) Proc. 15-th ASCI Conference, pp. 1–5. Advanced School for Computing and Imaging (ASCI), P.O. Box 5031, 2600 GA Delft, The Netherlands (2009)
Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.-M.: Lightweight probabilistic broadcast. In: DSN 2001: Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS), pp. 443–452. IEEE Computer Society, Washington, DC, USA (2001)
Ford, B., Srisuresh, P., Kegel, D.: Peer-to-peer communication across network address translators. CoRR, abs/cs/0603074 (2006)
Ganesh, A.J., Kermarrec, A.-M., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers 52, 2003 (2003)
Guha, S., Francis, P.: Characterization and measurement of tcp traversal through nats and firewalls. In: IMC 2005: Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement, p. 18. USENIX Association, Berkeley (2005)
Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: Estimating latency between arbitrary internet end hosts. In: SIGCOMM Internet Measurement Workshop (2002)
Hunt, R., Phuoc, H.C., McKenzie, A.: Nat traversal techniques in peer-to-peer networks (2008)
Mahy, R., Rosenberg, J., Huitema, C.: Turn - traversal using relay nat (September 2005), http://tools.ietf.org/id/draft-rosenberg-midcom-turn-08.txt
Jelasity, M., Montresor, A., Babaoglu, O.: T-Man: Gossip-based fast overlay topology construction. Computer Networks 53(13), 2321–2339 (2009)
Jelasity, M., Liu, H., Kermarrec, A.-M., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004)
Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: ICDCS 2004: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), pp. 102–109. IEEE Computer Society, Washington, DC, USA (2004)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. 25(3), 8 (2007)
Kermarrec, A.-M., Pace, A., Quema, V., Schiavoni, V.: Nat-resilient gossip peer sampling. In: ICDCS 2009: Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems, pp. 360–367. IEEE Computer Society, Washington, DC, USA (2009)
LeitĂŁo, J., van Renesse, R., Rodrigues, L.: Balancing gossip exchanges in networks with firewalls. In: Proceedings of the 9th International Workshop on Peer-to-Peer Systems (IPTPS 2010), San Jose, CA, U.S.A (2010) (to appear)
Liu, Y., Pan, J.: The impact of NAT on BitTorrent-like P2P systems. In: IEEE Ninth International Conference on Peer-to-Peer Computing, P2P 2009, pp. 242–251 (2009)
Payberah, A.H., Dowling, J., Rahimian, F., Haridi, S.: gradienTv: Market-based P2P Live Media Streaming on the Gradient Overlay. In: Eliassen, F., Kapitza, R. (eds.) DAIS 2010. LNCS, vol. 6115, pp. 212–225. Springer, Heidelberg (2010)
Payberah, A.H., Dowling, J., Rahimian, F., Haridi, S.: Sepidar: Incentivized market-based p2p live-streaming on the gradient overlay network. International Symposium on Multimedia, vol. 0, pp. 1–8 (2010)
Price, R., Tino, P.: Adapting to NAT timeout values in P2P overlay networks. In: 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), pp. 1–6. IEEE, Los Alamitos (2010)
Rosenberg, J.: Interactive connectivity establishment (ice): A methodology for network address translator (nat) traversal for offer/answer protocols (January 2007), http://tools.ietf.org/html/draft-ietf-mmusic-ice-13
Rosenberg, J., Mahy, R., Mathews, P., Wing, D.: Rfc 5389: Session traversal utilities for nat (stun) (2008)
Roverso, R., El-Ansary, S., Haridi, S.: Natcracker: Nat combinations matter. In: ICCCN 2009: Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks, pp. 1–7. IEEE Computer Society, Washington, DC, USA (2009)
Sacha, J., Dowling, J., Cunningham, R., Meier, R.: Discovery of stable peers in a self-organising peer-to-peer gradient topology. In: Eliassen, F., Montresor, A. (eds.) DAIS 2006. LNCS, vol. 4025, pp. 70–83. Springer, Heidelberg (2006)
Voulgaris, S., Gavidia, D., Van Steen, M.: Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management 13, 2005 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Payberah, A.H., Dowling, J., Haridi, S. (2011). Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal. In: Felber, P., Rouvoy, R. (eds) Distributed Applications and Interoperable Systems. DAIS 2011. Lecture Notes in Computer Science, vol 6723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21387-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-21387-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21386-1
Online ISBN: 978-3-642-21387-8
eBook Packages: Computer ScienceComputer Science (R0)