Constructing Delay-Bounded Multicast Trees in Computer Networks

@article{Wuu2001ConstructingDM,
  title={Constructing Delay-Bounded Multicast Trees in Computer Networks},
  author={Lih-Chyau Wuu and Longsong Lin and Shing-Chyi Shiao},
  journal={J. Inf. Sci. Eng.},
  year={2001},
  volume={17},
  pages={507-524}
}
In this paper we propose a distributed protocol for constructing delay-bounded minimum-cost multicast trees in computer networks. The proposed protocol does not require knowledge of the complete network topology. Furthermore, it is unnecessary to know how many nodes are in the networks and which nodes are group members in advance. It is shown, through analysis and simulation on a class of random graphs, that our protocol only uses O(n) messages in the best case, where n is the number of nodes… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
5 Citations
30 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Two distributed algorithms for multicasting multimedia information,

  • V. P. Kompella, J. C. Pasquale, G. C. Polyzos
  • The Second International Conference on Computer…
  • 1993
Highly Influential
4 Excerpts

Efficient distributed multicast tree construction in high-speed networks,

  • L. C. Wuu, L. S. Lin, S. C. Shiao
  • International Conference on Next Decades of High…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…