Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs

Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and repeated with graph-relevant concerns. In this paper, we propose the “distributed line graphs” (DLG), a universal technique for designing DHTs based on arbitrary regular graphs. Using DLG, the main features of the initial graphs are preserved, and thus people can design a new DHT by simply choosing the graph with desirable features and applying DLG to it. We demonstrate the power of DLG by illustrating four DLG-enabled DHTs based on different graphs, namely, Kautz, de Bruijn, butterfly, and hypertree graphs. The effectiveness of our proposals is demonstrated through analysis, simulation, and implementation.

[1]  Jie Wu,et al.  FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[3]  Pavel Tvrdik.  Factoring and scaling Kautz digraphs , 1994 .

[4]  Miguel Angel Fiol,et al.  The Partial Line Digraph Technique in the Design of Large Interconnection Networks , 1992, IEEE Trans. Computers.

[5]  Jiehua Zhu,et al.  National Natural Science Foundation of China (NSFC) , 2013 .

[6]  Jun Xu.  On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE Journal on Selected Areas in Communications.

[7]  Gurmeet Singh Manku,et al.  Decentralized algorithms using both local and random probes for P2P load balancing , 2005, SPAA '05.

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

[9]  Gurmeet Singh Manku,et al.  Routing networks for distributed hash tables , 2003, PODC '03.

[10]  Dmitri Loguinov,et al.  Load-Balancing Performance of Consistent Hashing: Asymptotic Analysis of Random Node Join , 2007, IEEE/ACM Transactions on Networking.

[11]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[12]  Pavel Tvrdík.  Necklaces and scalability of Kautz digraphs , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[13]  Yunhao Liu,et al.  BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[14]  Abhishek Kumar,et al.  Ulysses: a robust, low-diameter, low-latency peer-to-peer network , 2004, Eur. Trans. Telecommun..

[15]  Moni Naor,et al.  Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.

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

[17]  Miguel Angel Fiol,et al.  Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.

[18]  Pierre Fraigniaud,et al.  D2B: A de Bruijn based content-addressable network , 2006, Theor. Comput. Sci..

[19]  Shlomi Dolev,et al.  HyperTree for self-stabilizing peer-to-peer systems , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[20]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[21]  Richard M. Karp,et al.  A stochastic process on the hypercube with applications to peer-to-peer networks , 2003, STOC '03.

[22]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[23]  Yiming Zhang,et al.  SKY: efficient peer-to-peer networks based on distributed Kautz graphs , 2009, Science in China Series F: Information Sciences.

[24]  Beng Chin Ooi,et al.  Paths to stardom: calibrating the potential of a peer-based data management system , 2008, SIGMOD Conference.

[25]  Jie Wu,et al.  Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[26]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[27]  Dejan S. Milojicic,et al.  Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs , 2012 .