Enabling routing control in a DHT
IEEE Journal on Selected Areas in Communications
Internet-based Virtual Computing Environment: Beyond the data center as a computer
Future Generation Computer Systems
| Hi-index | 0.00 |
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.