Depth-Latency Tradeoffs in Multicast Tree Algorithms

@article{Helmick2007DepthLatencyTI,
  title={Depth-Latency Tradeoffs in Multicast Tree Algorithms},
  author={Michael T. Helmick and Fred S. Annexstein},
  journal={21st International Conference on Advanced Information Networking and Applications (AINA '07)},
  year={2007},
  pages={555-564}
}
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding the degree. In this paper, we study the problem of determining a degree-bounded directed spanning tree of minimum average-latency in a complete graph where the inter-node latencies… CONTINUE READING