Building a multicasting tree in a high-speed network

IEEE Concurrency

Volumn 6, Issue 4, 1998, Pages 57-67

  Tseng, Yu Chee ^a,c,d   Juang, Tony Tong Ying ^b,e,f   Du, Ming Chih ^b,d,g,h  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

^c OHIO STATE UNIVERSITY   (United States)

^d IEEE

^e NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^f UNIVERSITY OF TEXAS AT DALLAS   (United States)

^g HEWLETT PACKARD COMPANY   (United States)

^h CHUNG HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); GRAPH THEORY; MULTICASTING; OPTIMIZATION; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

MULTICASTING TREE;

MULTIPROCESSING SYSTEMS;

EID: 0032179907     PISSN: 10923063     EISSN: None     Source Type: Journal    
DOI: 10.1109/4434.736426     Document Type: Article

References (17)

1. P.K. McKinley and J.W.S. Liu, "Multicast Tree Construction in Bus-Based Networks," Comm. ACM, Vol. 33, No. 1, Jan. 1990, pp. 29-42.
2. Y. Lan and L.F. Chen, "Multicast Communication in 2-D Mesh Networks," IEEE Trans. Computing, Vol. 1, No. 1, Jan. 1994, pp. 63-68.
3. Y. Lan, "Adaptive Fault-Tolerant Multicast in Hypercube Multicomputers," IEEE Trans. Parallel and Distributed Systems, Vol. 6, No. 11, Nov. 1995, pp. 1147-1152.
4. A.C. Liang, S. Bhattacharya, W.T. Tsai, "Fault-Tolerant Multicast on Hypercube," J. Parallel and Distributed Computing, Vol. 23, No. 12, Dec. 1994, pp. 418-428.
5. J.P. Sheu and M.Y. Su, "A Multicast Algorithm for Hypercube Multiprocessors," Proc. Int'l Conf. Parallel Processing, Vol. 3, CRC Press, Boca Raton, Fia., 1992, pp. 18-22.
6. Y. Lan, A.H. Esfahanian, and L.M. Ni, "Multicast in Hypercube Multiprocessors," J. Parallel and Distributed Computing, Vol. 8, No. 1,Jan. 1990, pp. 30-41.
7. P.K. McKinley et al., "Unicast-Based Multicast Communication in Wormhole-Routed Networks," Proc. Int'l Conf. Parallel Processing, Vol. 2, CRC Press, 1992, pp. 10-19.
8. D.F. Robinson, P.K. McKinley, and B.H.C. Cheng, "Optimal Multicast Communication in Wormhole-Routed Torus Networks," IEEE Trans. Parallel and Distributed Systems, Vol. 6, No. 10, Oct. 1995, pp. 1029-1041.
9. Y.C. Tseng, O.K. Panda, and T.H. Lai, "A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels," IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 2, Feb. 1996,PP.138-150.
10. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of {NP}-Completeness, W. H. Freeman, New York, 1979.
11. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, Morgan Kaufmann, San Francisco, 1992.
12. N. Bagherzadeh, N. Nassif, and S. Latifi, "A Routing and Broadcasting Scheme on Faulty Star Graphs," IEEE Trans. Computing, Vol. 42, No. 11, Nov. 1993, pp. 1398-1403.
13. V.E. Mendia and D. Sarkar, "Optimal Broadcasting on the Star Graph," IEEE Trans. Parallel and Distributed Systems, Vol. 3, No. 4, July 1992, pp. 389-396.
14. K. Qiu, "Broadcasting on the Star and Pancake Interconnection Networks," Int'l Parallel Processing Symp., IEEE Computer Society Press, Los Alamitos, Calif., 1995, pp. 660-665.
15. Y.C. Tseng and J.P. Sheu, "Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees," IEEE Trans. Computing, Vol. 46, No. 5, May 1997, pp. 593-599.
16. K.H. Rosen, Discrete Mathematics and its Applications, McGraw-Hill, New York, 1995.
17. K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parallel and Distributed Systems, Vol. 5, No. 1,Jan. 1994, pp. 31-38.