|Autor:||I. Baumgart, B. Heep||Links:||DownloadSlidesBibtex|
|Quelle:||Proceedings of the 8th Euro-NF Conference on Next Generation Internet (NGI 2012), Karlskrona, Sweden, Juni 2012|
In the past many proposals for structured peer-to-peer protocols have been published. They differ in properties like overlay topology, routing table maintenance and message forwarding alternatives. Furthermore each protocol exhibits various parameters e.g. to adjust routing table size or stabilization intervals, making it difficult to choose an optimal protocol and parameter set for a given scenario (e.g. churn rate, number of nodes). For this purpose we developed the overlay simulation framework OverSim and implemented six well known structured overlay protocols. In this paper we first compare these protocols among each other. Furthermore we study several recursive and iterative routing variants and show the effect of routing table redundancy and lookup parallelism on routing latency and bandwidth costs. For each overlay protocol we identify an optimal parameter set for a typical peer-to-peer scenario. Finally we show how overlay protocols adapt to variations in churn rate and network size. Our results show considerable advantages of the protocols Kademlia and Bamboo, while De Bruijn based protocols reveal a lack of stability under churn.