FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs

The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures of DHT schemes. Many proposed DHT schemes are based on traditional interconnection topologies, one being the Kautz graph, which is a static topology with many good properties such as optimal diameter, optimal fault-tolerance, and low congestion. In this paper, we propose FISSIONE: the first effective DHT scheme based on Kautz graphs. FISSIONE is constant degree, O(log N) diameter, and (1 + o(1))-congestion-free. FISSIONE shows that a DHT scheme with constant degree and constant congestion can still achieve O(log N) diameter, which is better than the lower bound /spl Omega/(N/sup 1/d/) conjectured before. The average degree of FISSIONE is 4, the diameter is less than 2 log N, and the maintenance message cost is less than 3 log N. The average routing path length is about log N and is shorter than CAN or Koorde with the same degree when the peer-to-peer network is large-scale. FISSIONE can achieve good load balance, high performance, and low congestion and these properties are carefully evaluated by formal proofs or simulations in the paper.