Distributed algorithms for multicast tree construction

International Symposium on Control, Communications and Signal Processing, ISCCSP

Volumn , Issue , 2004, Pages 361-364

  Gatani, Luca ^a,b   Lo Re, Giuseppe ^a   Urso, Alfonso ^a  

^a ICAR CNR   (Italy)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; MULTIMEDIA SYSTEMS; NETWORK PROTOCOLS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

DISTRIBUTION ALGORITHMS; MULTICAST TRANSMISSION; STEINER TREE PROBLEM IN NETWORKS (SPN);

MULTICASTING;

EID: 3042522529     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. P. Winter, "Steiner problem in networks: A survey," Networks, vol. 17, no. 2, pp. 129-167, 1987.
2. F. Bauer and A. Varma, "Distributed algorithms for multicast path setup in data networks," IEEE/ACM Trans. on Networking, vol. 4, no. 2, pp. 181-191, 1996.
3. G. Singh and K. Vellanki, "A distributed protocol for constructing multicast tree," in Proc. IEEE Int'l Conf. on Principles of Distributed Systems, 1998, pp. 41-48.
4. V. J. Rayward-Smith and A. Clare, "On finding Steiner vertices," Networks, vol. 16, pp. 283-294, 1986.
5. A. Medin, A. Lakhina, I. Matta, and J. Byers, BRITE Universal Topology Generator User Manual, cs-pub.bu.edu/brite.
6. R. Govindan and H. Tangmunarunkit, "Heuristics for internet map discovery," in Proc. IEEE/INFOCOM 2000.
7. G. Lo Re and L. Gatani, "Distributed algorithms for multi-cast tree construction," in Proc. 15th IASTED Int'l Conf. on Parallel and Distributed Computing, 2003, pp. 531-540.