DarknetSim: a simulation framework for social overlays

Social Overlays are a candidate solution to satisfy the increasing demand for privacy-preserving social applications. In Social Overlays, also called Darknets, direct communication only exists between participants sharing a real-world trust relationship. Existing solutions, such as Freenet and GnuNet, suffer from long delays and high message overhead. The development and evaluation of alternative solutions is drastically complicated by the lack of common models and evaluation methods. In this paper, we describe a general simulation framework for Darknets as well as our implementation of the most common routing approaches. The framework contains the basic functionalities of Social Overlays and is easily extensible to include a wide range of routing algorithms. Our implementation, based on OMNet++ and INET, proves to be highly scalable in comparison to simulation frameworks for structured Peer-to-Peer systems such as OverSim. We can easily simulate realistic network sizes of a hundred thousand nodes.

[1]  Stefanie Roos,et al.  Greedy Embedding, Routing and Content Addressing for Darknets , 2013, 2013 Conference on Networked Systems.

[2]  Oskar Sandberg,et al.  Distributed Routing in Small-World Networks , 2006, ALENEX.

[3]  Ingmar Baumgart,et al.  OverSim: A scalable and flexible overlay framework for simulation and real network applications , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[4]  Christian Grothoff,et al.  Beyond Simulation: Large-Scale Distributed Emulation of P2P Protocols , 2011, CSET.

[5]  Nicholas Hopper,et al.  Membership-concealing overlay networks , 2009, CCS.

[6]  Márk Jelasity,et al.  PeerSim: A scalable P2P simulator , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[7]  Christian Grothoff,et al.  R5N: Randomized recursive routing for restricted-route networks , 2011, 2011 5th International Conference on Network and System Security.

[8]  Georgios Theodoropoulos,et al.  Evaluating Large Scale Distributed Simulation of P2P Networks , 2008, 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications.

[9]  Matteo Dell'Amico.  Mapping Small Worlds , 2007 .

[10]  Jussi Kangasharju,et al.  ChunkSim: simulating peer-to-peer content distribution , 2007, SpringSim '07.

[11]  Stefanie Roos,et al.  A contribution to analyzing and enhancing Darknet routing , 2013, 2013 Proceedings IEEE INFOCOM.

[12]  Ian Wakeman,et al.  The state of peer-to-peer network simulators , 2013, CSUR.

[13]  Stefanie Roos,et al.  Attack Resistant Network Embeddings for Darknets , 2011, 2011 IEEE 30th Symposium on Reliable Distributed Systems Workshops.

[14]  Ralf Steinmetz,et al.  PeerfactSim.KOM: A simulation framework for Peer-to-Peer systems , 2011, 2011 International Conference on High Performance Computing & Simulation.

[15]  Pedro García López,et al.  PlanetSim: A New Overlay Network Simulation Framework , 2004, SEM.

[16]  Robert Tappan Morris,et al.  A performance vs. cost framework for evaluating DHT design tradeoffs under churn , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Andrew S. Tanenbaum,et al.  Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System , 2004, Security Protocols Workshop.

[18]  Jussi Kangasharju,et al.  Explaining BubbleStorm: Resilient, Probabilistic, and Exhaustive PeertoPeer Search , 2007, SIGCOMM 2007.

[19]  Radia Perlman,et al.  An algorithm for distributed computation of a spanningtree in an extended LAN , 1985, SIGCOMM '85.

[20]  Prateek Mittal,et al.  X-Vine: Secure and Pseudonymous Routing Using Social Networks , 2011, ArXiv.

[21]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[22]  Christian Grothoff,et al.  Routing in the Dark: Pitch Black , 2007, Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007).