Flexible routing in a distributed K‐ary tree: the K‐Umbrella
Athanasios‐Dimitrios Sotiriou, Panagiotis Kalliaras, Nikolas M. Mitrou · European Transactions on Telecommunications · 2007
Abstract As peer‐to‐peer (P2P) applications become more mature and demanding, there is a need for the underlying technologies to provide more adaptive characteristics, according to the application's requirements. In this paper, we present K‐Umbrella, a K‐ary distributed hash table (DHT), which allows us to efficiently route through the use of a fixed‐size routing table. By controlling a number of parameters, our algorithm is able to trade‐off between efficiency, fault‐tolerance and decentralisation according to the application's requirements. Through a detailed analysis of our algorithms and an extensive set of simulations, we will show that our protocol is able to offer an improved alternative to current DHT algorithms. Copyright © 2007 John Wiley & Sons, Ltd.