Abstract:
Most proposed DHTs have their unique maintenance mechanisms specific to the static graphs on which they are based. In this paper we propose distributed line graphs (DLG),...Show MoreMetadata
Abstract:
Most proposed DHTs have their unique maintenance mechanisms specific to the static graphs on which they are based. In this paper we propose distributed line graphs (DLG), a universal framework for building DHTs based on arbitrary constant-degree graphs. We prove that in a DLG-enabled, N-node DHT, the out-degree is d, the in-degree is between 1 and 2d, and the diameter is less than 2(logdN-logdN0+D0+1), where d, D0 and N0 represent the degree, diameter and number of nodes of the initial graph, respectively. The maintenance cost of DLG-enabled DHTs is O(logdN). We show the power of DLG technique by applying it to Kautz graphs to propose a new DHT scheme.
Date of Conference: 17-20 June 2008
Date Added to IEEE Xplore: 12 August 2008
CD:978-0-7695-3172-4
Print ISSN: 1063-6927
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
Georgia Institute of Technology, College of Computing Georgia Institute of Technology, Atlanta, USA
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
Contents National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
Georgia Institute of Technology, College of Computing Georgia Institute of Technology, Atlanta, USA
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
