In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Abstract—In this paper, we propose and evaluate two distributed protocols for finding low-cost broadcast and multicast trees in wireless networks. The constructed trees can then...
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fek...
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...