Thumbnail
Access Restriction
Subscribed

Author Zhang, Yiming ♦ Liu, Ling
Sponsorship IEEE ♦ IEEE Comput. Soc. Tech. Committee on Data Eng ♦ IEEE Computer Society
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1989
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Graph theory ♦ Topology ♦ Network topology ♦ Object recognition ♦ Maintenance engineering ♦ Upper bound ♦ Distributed processing ♦ regular graphs ♦ Distributed networks ♦ network topology ♦ distributed hash tables
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.
Description Author affiliation :: Georgia Institute of Technology, Atlanta
Author affiliation :: National University of Defense Technology, Changsha
ISSN 10414347
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-09-01
Publisher Place U.S.A.
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Volume Number 24
Issue Number 9
Size (in Bytes) 1.47 MB
Page Count 14
Starting Page 1556
Ending Page 1569


Source: IEEE Xplore Digital Library