A real-time multicast routing algorithm for multimedia applications

被引：21

作者：

Jia, XH

Pissinou, N

Makki, K ^{[1
]}

机构：

[1] Univ SW Louisiana, Ctr Telecommun Studies, ECE Dept, Lafayette, LA 70508 USA

[2] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong

[3] Univ SW Louisiana, Ctr Adv Comp Studies, Louisiana 70508, LA USA

来源：

COMPUTER COMMUNICATIONS | 1997年 / 20卷 / 12期

关键词：

multicast routing; minimal Steiner tree; real-time communications; real-time multicast routing;

D O I：

10.1016/S0140-3664(97)00095-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Multicast routing in real-time applications has two important requirements: minimal network cost and shortest network delay. It is very difficult to meet one requirement without compromising the other. This paper presents a real-time multicast routing algorithm which minimizes overall network cost without letting the delay from a source to any destination exceed a real-time constraint. The multicast routing with optimal overall network cost is an NP-complete problem. Our algorithm is based on the idea of the minimum spanning tree heuristic. Simulations have been done to compare the routing generated by our algorithm with those by other major algorithms. (C) 1997 Elsevier Science B.V.

引用

页码：1098 / 1106

页数：9

共 16 条

[1]

Ahn S., 1993, Proceedings. 18th Conference on Local Computer Networks (Cat. No.93TH0582-7), P327, DOI 10.1109/LCN.1993.591240

[2]

AMMAR SY, 1993, IEEE INFOCOM 93, P98

[3] ROUTING TO MULTIPLE DESTINATIONS IN COMPUTER-NETWORKS [J].