Fast but economical: A simulative comparison of structured peer-to-peer systems

8th EURO-NF Conference on Next Generation Internet, NGI 2012 - Proceedings

Volumn , Issue , 2012, Pages 87-94

  Baumgart, Ingmar ^a   Heep, Bernhard ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DE BRUIJN; KADEMLIA; LOOKUPS; NETWORK SIZE; OPTIMAL PARAMETER; OPTIMAL PROTOCOLS; OVERLAY SIMULATION; OVERLAY TOPOLOGIES; PARAMETER SET; PEER TO PEER; ROUTING LATENCY; ROUTING TABLE; STRUCTURED OVERLAYS; STRUCTURED PEER-TO-PEER; STRUCTURED PEER-TO-PEER SYSTEM;

OPTIMIZATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84866698881     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NGI.2012.6252169     Document Type: Conference Paper

References (21)

1. I. Baumgart, B. Heep, and S. Krause, "OverSim: A Flexible Overlay Network Simulation Framework," in Proceedings of 10th IEEE Global Internet Symposium (GI '07) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA, May 6-12, 2007, pp. 79-84.
2. I. Baumgart, B. Heep, C. Hübsch, and A. Brocco, "OverArch: A common architecture for structured and unstructured overlay networks," in Proceedings of the 15th IEEE Global Internet Symposium in conjunction with IEEE INFOCOM 2012, Orlando, FL, USA, Mar. 2012.
3. D. Loguinov, J. Casas, and X. Wang, "Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience," IEEE/ACM Trans. Netw., vol. 13, no. 5, pp. 1107-1120, Oct. 2005.
4. K. P. Gummadi, R. Gummadi, S. D. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity," in Proceedings of the ACM SIGCOMM '03 conference, Karlsruhe, Germany, 2003, pp. 381-394.
5. D. Stutzbach and R. Rejaie, "Improving Lookup Performance Over a Widely-Deployed DHT," in Proc. 25th IEEE International Conference on Computer Communications INFOCOM 2006, Barcelona, Catalunya, Spain, Apr. 2006, pp. 1-12.
6. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris, "Designing a DHT for low latency and high throughput," in Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI '04), San Francisco, California, USA, Mar. 2004.
7. E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes," IEEE Communications Survey and Tutorial, vol. 7, pp. 72-93, 2005.
8. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," in ATEC '04: Proceedings of the annual conference on USENIX Annual Technical Conference, Boston, MA, USA, Jun./Jul. 27-2, 2004.
9. J. Li, J. Stribling, R. Morris, M. F. Kaashoek, and T. M. Gil, "A performance vs. cost framework for evaluating DHT design tradeoffs under churn," in 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), vol. 1, Miami, FL, USA, Mar. 13-17, 2005, pp. 225-236.
10. N. I. Damm, D. Fahrenholtz, and V. Turau, "On Fluctuation Resilience of Second Generation Distributed Hash Tables," in Kommunikation in Verteilten Systemen (KiVS 2007), T. Braun, G. Carle, and B. Stiller, Eds., 2007, pp. 105-110.
11. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: a scalable peer-to-peer lookup protocol for Internet applications," IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17-32, Feb. 2003.
12. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, "Exploiting network proximity in distributed hash tables," in International Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy, Jun. 3-7, 2002, pp. 52-55.
13. M. F. Kaashoek and D. R. Karger, "Koorde: A Simple Degree-Optimal Distributed Hash Table," in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), vol. 2735/2003, Berkeley, CA, USA, 2003, pp. 98-107.
14. A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems," in Middleware 2001 : Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, vol. 2218/2001, Heidelberg, Germany, Nov. 12-16, 2001, pp. 329-350.
15. M. Castro, P. Druschel, and Y. C. Hu and Antony Rowstron, "Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks," Microsoft Research, Redmond, WA, Tech. Rep. MSR-TR-2002-82, 2002.
16. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," EECS Department, University of California, Berkeley, CA, USA, Tech. Rep. UCB/CSD-03-1299, Dec. 2003.
17. P. Maymounkov and D. Mazières, "Kademlia: A Peer-to-Peer Information System Based on the XOR Metric," in Peer-to-Peer Systems: First International Workshop (IPTPS 2002). Revised Papers, vol. 2429/2002, Cambridge, MA, USA, Mar. 7-8, 2002, pp. 53-65.
18. A.-T. Gai and L. Viennot, "Broose: a Practical Distributed Hashtable based on the De-Bruijn Topology," in Fourth International Conference on Peer-to-Peer Computing (P2P 2004), Zurich, Switzerland, Aug. 2004.
19. D. Stutzbach and R. Rejaie, "Understanding Churn in Peer-to-Peer Networks," in IMC '06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, Rio de Janeiro, Brazil, Oct. 25-27, 2006, pp. 189-202.
20. M. Steiner, T. En-Najjary, and E. W. Biersack, "Long Term Study of Peer Behavior in the KAD DHT," IEEE/ACM Transactions on Networking, vol. 17, no. 6, pp. 1371-1384, Oct. 2009.
21. C. Jennings, B. B. Lowekamp, E. Rescorla, S. A. Baset, and H. Schulzrinne, "Resource location and discovery (reload)," IETF Internet-Draft, work in progress, draft-ietf-p2psip-base-18, Aug. 2011.