The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - Sept. (2012 vol.24)
pp: 1556-1569
Yiming Zhang , National University of Defense Technology, Changsha
Ling Liu , Georgia Institute of Technology, Atlanta
ABSTRACT
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.
INDEX TERMS
Routing, Topology, Network topology, Object recognition, Buildings, Maintenance engineering, Upper bound, regular graphs, Distributed networks, network topology, distributed hash tables
CITATION
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
REFERENCES
[1] I. Stoica et al., "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications," IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, Feb. 2003.
[2] S. Ratnasamy et al., "A Scalable Content Addressable Network," Proc. ACM SIGCOMM '01, pp. 149-160, 2001.
[3] J. Xu, A. Kumar, and X. Yu, "On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks," IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 151-163, Jan. 2004.
[4] D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A Scalable and Dynamic Emulation of the Butterfly," Proc. ACM Symp. Principles of Distributed Computing (PODC '02), pp. 183-192, 2002.
[5] P. Fraigniaud and P. Gauron, "D2B: A De Bruijn Based Content Addressable Network," Theoretical Computer Science, vol. 355, no. 1, pp. 65-79, Jan. 2006.
[6] F. Kaashoek and D. Karger, "Koorde: A Simple Degree-optimal Distributed Hash Table," Proc. Second Int'l Workshop Peer-to-Peer Systems (IPTPS '03), pp. 98-107, 2003.
[7] D. Li, X. Lu, and J. Wu, "FissionE: A Scalable Constant Degree and Low Congestion DHT Scheme Based on Kautz Graphs," Proc. IEEE INFOCOM '05, pp. 1677-1688, 2005.
[8] D. Guo, J. Wu, H. Chen, and X. Luo, "Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree," Proc. IEEE INFOCOM '07, pp. 821-829, 2007.
[9] H. Shen, C. Xu, and G. Chen, "Cycloid: A Scalable Constant-Degree P2P Overlay Network," Performance Evaluation, vol. 63, no. 3, pp. 195-216, 2005.
[10] M.A. Fiol, J.L.A. Yebra, and I. Alegre, "Line Digraph Iterations and the (d, k) Digraph Problem," IEEE Trans. Computers, vol. 33, no. 5, pp. 400-403, May 1984.
[11] M.A. Fiol and A.S. Llado, "The Partial Line Digraph Technique in the Design of Large Interconnection Networks," IEEE Trans. Computers, vol. 41, no. 7, pp. 848-857, July 1992.
[12] P. Tvrdik, "Kautz Necklaces," Technical Report 94-08, LIP ENSL, 69364 Lyon, France, Mar. 1994.
[13] P. Tvrdik, "Factoring and Scaling Kautz Digraphs," Technical Report 94-15, LIP ENSL, 69364 Lyon, France, Apr. 1994.
[14] A. Kumar, S. Merugu, J. Xu, and X. Yu, "Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network," Proc. IEEE Int'l Conf. Network Protocols (ICNP), pp. 258-267, 2003.
[15] B.Y. Zhao et al., "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
[16] Y. Zhang, "DLG-Kautz Implementation," technical report, http://www.kylinx.com/PapersDLG_impl.pdf ., Apr. 2010.
[17] D. Guo, H. Chen, Y. Liu, and X. Li, "BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks," Proc. IEEE INFOCOM (Mini-Symp.), 2008.
[18] Y. Zhang, X. Lu, and D. Li, "SKY: Efficient Peer-to-Peer Networks Based on Distributed Kautz Graphs," Science in China Series F, vol. 52, no. 4, pp. 588-601, Apr. 2009.
[19] G.S. Manku, "Routing Networks for Distributed Hash Tables," Proc. ACM Symp. Principles of Distributed Computing (PODC '03), pp. 133-142, 2003.
[20] D. Loguinov, J. Casas, and X. Wang, "Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience," IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 1107-1120, Oct. 2005.
[21] M. Naor and U. Wieder, "Novel Architectures for P2P Applications: The Continuous-Discrete Approach," ACM Trans. Algorithms, vol. 3, no. 3,article 34, 2007.
[22] M. Adler, E. Halperin, R.M. Karp, and V.V. Vazirani, "A Stochastic Process on the Hypercube with Applications to Peer-to-Peer Networks," Proc. ACM Symp. Theory of Computing (STOC '03), pp. 575-584, 2003.
[23] X. Wang and D. Loguinov, "Load-Balancing Performance of Consistent Hashing: Asymptotic Analysis of Random Node Join," ACM Trans. Networking, vol. 15, no. 4, pp. 892-905, Aug. 2007.
[24] K. Kenthapadi and G. Manku, "Decentralized Algorithms Using Both Local and Random Probes for P2P Load Balancing," Proc. Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA '05), pp. 135-144, 2005.
[25] G.S. Manku, M. Bara, and P. Raghavan, "Symphony: Distributed Hashing in a Small World," Proc. Conf. USENIX Symp. Internet Technologies and Systems (USITS '03), 2003.
[26] S.i Dolev and R.I. Kat, "HyperTree for Self-Stabilizing Peer-to-Peer Systems," Distributed Computing, vol. 20, no. 5, pp. 375-388, 2008.
[27] http:/owlet-code.sourceforge.net/, 2012.
[28] Y. Zhang, "Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs," Technical Report NUDT-CS-20101117, NUDT, http://www.kylinx.com/PapersDLG_tech.pdf , Nov. 2010.
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool