Instant distributed minimum diameter tree construction for scalable application layer multicast

Many research efforts on application layer multicast has been performed as an alternative group communication method because of difficulties in deployment problem of IP multicast and optimization is one of the hot topics to make efficient multicast tree. Because of high cost, adopting distributed optimization process in tree building has not been promising. This paper aims at minimizing the diameter of multicast tree with lessened overhead. We propose new algorithm called BrotherHood algorithm that can achieve efficient tree building only with positioning when new nodes join. We provide experimental results using simulation and the results show that proposed scheme performed well compared to greedy construction algorithm, which is known as best until now.