Flexible routing in a distributed K-ary tree: the K-Umbrella

TitleFlexible routing in a distributed K-ary tree: the K-Umbrella
Publication TypeJournal Article
Year of Publication2009
AuthorsSotiriou A-D, Kalliaras P, Mitrou N
JournalEuropean Transactions on Telecommunications
Volume20
Issue2
Pagination139–157
ISSN1541-8251
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.

URLhttp://onlinelibrary.wiley.com/doi/10.1002/ett.1246/abstract
DOI10.1002/ett.1246
Short TitleFlexible routing in a distributed K-ary tree