Real-time multicast routing with optimal network cost

Authors:
X. Jia;J. Cao;W. Jia
Affiliations:
-;-;-
Venue:
RTCSA '96 Proceedings of the Third International Workshop on Real-Time Computing Systems Application
Year:
1996

Citing 0
Cited 1

Adding multicast capabilities to wireless multi-hop token-passing protocols: extending the RT-WMP

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multicast routing for real-time applications has two important requirements: minimal network cost and shortest network delay. It is always 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 source to any destination exceed a 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.