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

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.

[1]  Yunhao Liu,et al.  AnySee: Peer-to-Peer Live Streaming , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[3]  A. Rukhin,et al.  Statistical Testing of Random Number Generators , 1999 .

[4]  Seif Haridi,et al.  Symmetric Replication for Structured Peer-to-Peer Systems , 2005, DBISP2P.

[5]  Padhraic Smyth,et al.  Analysis and Visualization of Network Data using JUNG , 2005 .

[6]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[7]  Mary K. Vernon,et al.  Characterizing the query behavior in peer-to-peer file sharing systems , 2004, IMC '04.

[8]  Tein-Yaw Chung,et al.  Architecture and Implementation of Cluster-based Peer-to-Peer Topology and Its Application in Search , 2006 .

[9]  Miguel Castro,et al.  One ring to rule them all: service discovery and binding in structured peer-to-peer overlay networks , 2002, EW 10.

[10]  David Mazières,et al.  OASIS: Anycast for Any Service , 2006, NSDI.

[11]  Seif Haridi,et al.  DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[12]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[13]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[14]  Bharat K. Bhargava,et al.  PROMISE: peer-to-peer media streaming using CollectCast , 2003, MULTIMEDIA '03.

[15]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[16]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[17]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[18]  Ian Clarke,et al.  Protecting Free Expression Online with Freenet , 2002, IEEE Internet Comput..

[19]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[20]  Robbert van Renesse,et al.  Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol , 2004, IPTPS.

[21]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[22]  Sheng-De Wang,et al.  Jelly: a dynamic hierarchical P2P overlay network with load balance and locality , 2004, 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings..