Issue No.09 - Sept. (2012 vol.24)
Yiming Zhang , National University of Defense Technology, Changsha
Ling Liu , Georgia Institute of Technology, Atlanta
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.258
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.
Routing, Topology, Network topology, Object recognition, Buildings, Maintenance engineering, Upper bound, regular graphs, Distributed networks, network topology, distributed hash tables
Yiming Zhang, Ling Liu, "Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 9, pp. 1556-1569, Sept. 2012, doi:10.1109/TKDE.2011.258