Multicast in DKS (N, k, f) overlay networks

Abstract

In [1] a family of DHT-based infrastructures, termed DKS(N,k,f), with a number of desirable properties is presented. In the current paper, we show how multicast is DKS(N,k,f) overlay networks. Each multicast group is represented by an instance of DKS(N,k,f), which is created and maintained exactly as the underlying overlay network. Multicast messages are efficiently disseminated thanks to a correcting broadcast algorithm that allow each multicast message to be delivered exactly once to all application layer proccesses despite the presence of erroneous routing information.