DKS (N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications

In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network characterized by three parameters: N the maximum number of nodes that can be in the network; k the search arity within the network and f the degree of fault-tolerance. Once these parameters are instantiated, the resulting network has several desirable properties. The first property, which is the main contribution of this paper, is that there is no separate procedure for maintaining routing tables; instead, any out-of-date or erroneous routing entry is eventually corrected onthe-fly thereby, eliminating unnecessary bandwidth consumption. The second property is that each lookup request is resolved in at most logk(N) overlay hops under normal operations. Third, each node maintains only (k − 1) logk(N) + 1 addresses of other nodes for routing purposes. Fourth, new nodes can join and existing nodes can leave a...

• Type: Conference
• Year: 2003
• Where: CCGRID
• Authors: Luc Onana Alima, Sameh El-Ansary, Per Brand, Seif Haridi
• Keywords: CCGRID 2003, Cluster Computing, Erroneous Routing Entry, Overlay Network, Unnecessary Bandwidth Consumption