A load balancing-supported ID management method for Constant Degree DHTs

ID management method is the foundation to implement and maintain DHT overlays, especially for Constant Degree DHTs based on de Bruijn and Kautz, because their topologies are not incrementally expandable and using bit-shifting route schema etc. However, corresponding researches on Constant Degree DHTs are scarce, and realized Constant Degree DHTs usually use pure centralized or distributed ID management methods simply, thus cannot guarantee overlay's balance with low cost both in theory and practice. Analyzing the universal tree structures of Constant Degree diagraph, we propose an ID management method based on the internal structure Routing Forest, which regularly aggregates local balancing information to guide new nodes' joining for overall balance. The experimental results validate, with low maintenance and routing message overhead, node IDs' length differ by at most 2 in system, thus the load balancing is efficiently ensured.