Distributed construction of resource-efficient overlay tree by approximating MST

This work presents a distributed protocol called RESMO for constructing an overlay tree to support video streaming applications. RESMO reduces network resource usage by approximating minimum spanning tree and achieves low end-to-end latency between the sender and each receiver at the same time. The resulting overlay is a compromise between overlay minimum spanning tree and shortest path tree. We evaluated the tree constructed by RESMO through simulations, and found that RESMO gives significant improvement over existing protocols in terms of link stress, relative delay penalty and resource usage.