An Evaluation of EpiChord in OverSim

  • Jamie Furness
  • Farida ChowdhuryEmail author
  • Mario Kolberg
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 284)


EpiChord is a Distributed Hash Table (DHT) algorithm which supports data storage/retrieval in large scale distributed systems. It removes the typical O(logn)-state-per-node restriction imposed by the majority of other DHT topologies by employing a reactive routing state maintenance strategy that amortizes network maintenance costs into lookup queries. Under ideal condition, EpiChord’s lookup performance can approach O(1) hops – with maintenance costs comparable to traditional multi-hop DHTs. This paper presents an implementation of EpiChord in OverSim, and validates the performance of our model against the performance reported in the original EpiChord paper. We also present some adjustments to the algorithm to remove a discrepancy and then compare our modified results with the original ones. Finally, we present additional results showing the EpiChord algorithm is stable over time and performs well for larger networks.


Average Path Length Distribute Hash Table Cache Entry Intensive Workload Lookup Performance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    K. Dhara, Y. Guo, M. Kolberg, X. Wu, Overview of structured peer-to-peer overlay algorithms, in Handbook of Peer-to-Peer Networking (Springer, 2009)Google Scholar
  2. 2.
    B. Leong, B. Liskov, E.D. Demaine, EpiChord: parallelizing the chord lookup algorithm with reactive routing state management, in 12th International Conference on Networks 2004 (ICON 2004), Singapore, Nov 2004Google Scholar
  3. 3.
    J. Furness, F. Chowdhury, M. Kolberg, EpiChord model for OverSim,
  4. 4.
    I. Baumgart, B. Heep, S. Krause, OverSim: a flexible overlay network simulation framework, in 10th IEEE Global Internet Symposium (GI ’07), May 2007, Anchorage, Alaska, USAGoogle Scholar
  5. 5.
    The SSFNet project, [Online] Available: Accessed 01 Aug 2012
  6. 6.
    J. Furness, M. Kolberg, Considering complex search techniques in DHTs under churn, in 2011 I.E. Consumer Communications and Networking Conference (CCNC), IEEE, 2011Google Scholar
  7. 7.
    L. Monnerat, C. Amorim, D1HT: A distributed one hop hash table, in 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006Google Scholar
  8. 8.
    A. Gupta, B. Liskov, R. Rodrigues, Efficient routing for peer-to-peer overlays, in 1st Symposium on Networked Systems Design and Implementation (NSDI), 2004Google Scholar
  9. 9.
    J. Buford, A. Brown, M. Kolberg, Analysis of an active maintenance algorithm for an O(1)-Hop overlay, in IEEE Globecom 2007, Washington DC, USAGoogle Scholar
  10. 10.
    J. Li, J. Stribling, R. Morris, M.F. Kaashoek, Bandwidth-efficient management of DHT routing tables, in Symposium on Networked System Design and Implementation (NSDI), 2005Google Scholar
  11. 11.
    I. Gupta, K. Birman, P. Linga, A. Demers, R. van Renesse, Kelips: building an efficient and stable P2P DHT through increased memory and background overhead, in 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03), 2003, Berkeley, CA, USAGoogle Scholar
  12. 12.
    I. Stoica, R. Morris, D. Karger, M. Frans Kaashoek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, in Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM ’01), ACM, 2001Google Scholar
  13. 13.
    PeerSim P2P Simulator, Accessed 05 Jan 2013
  14. 14.
    P2Psim, A simulator for peer-to-peer (P2P) protocols,
  15. 15.
    K. Shudo, Y. Tanaka, S. Sekiguchi, Overlay weaver: an overlay construction toolkit. Comput. Commun. 31(2), 402–412 (2007)CrossRefGoogle Scholar
  16. 16.
    PlanetSim: An overlay network simulation framework,
  17. 17.
    The Network Simulator – ns-2,
  18. 18.
    A. Brown, M. Kolberg, Tools for peer-to-peer network simulation. Internet-Draft Version 00, IETF, 2006Google Scholar
  19. 19.
    S. Naicken, A. Basu, B. Livingston, S. Rodhetbhai, A survey of peer-to-peer network simulators, in The 7th Annual Postgraduate Symposium, Liverpool, 2006Google Scholar
  20. 20.
    D. Stingl, C. Groß, J. Rückert, L. Nobach, S. Kovacevic, R. Steinmetz. PeerfactSim.KOM: a simulation framework for peer-to-peer systems, in International Conference on High Performance Computing & Simulation (HPCS), 2011Google Scholar
  21. 21.
    S. Sioutas, K. Tsichlas, G. Papaloukopoulos, Y. Manolopoulos, E. Sakkopoulos. A novel Distributed P2P Simulator Architecture: D-P2P-Sim, in ACM International Conference on Information and Knowledge Management (CIKM), Hong Kong, 2009Google Scholar
  22. 22.
    F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, Towards a common API for structured peer-to-peer overlays. Peer-to-Peer Syst. II 2735, 33–44 (2003)CrossRefGoogle Scholar
  23. 23.
    J. Li, J. Stribling, F. Kaashoek, R. Morris, T. Gil, A performance vs. cost framework for evaluating DHT design tradeoffs under churn, in INFOCOM, 2005Google Scholar
  24. 24.
    F. Chowdhury, M. Kolberg, Performance evaluation of EpiChord under high churn, in The proceedings of the 8th ACM Performance Monitoring, Measurement and Evaluation of Heterogeneous Wireless and Wired Networks (PM2HW2N) Workshop, Barcelona, 2013Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jamie Furness
    • 1
  • Farida Chowdhury
    • 1
    Email author
  • Mario Kolberg
    • 1
  1. 1.Computing Science and MathematicsUniversity of StirlingStirlingScotland

Personalised recommendations