Title :
Real-time multicast routing with optimal network cost
Author :
Jia, X. ; Cao, J. ; Jia, W.
Author_Institution :
Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong
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
Keywords :
computational complexity; delays; real-time systems; telecommunication channels; telecommunication network routing; NP-complete problem; delay; minimal network cost; minimum spanning tree heuristic; optimal network cost; optimal overall network cost; real-time applications; real-time multicast routing; shortest network delay; time constraint; Application software; Bandwidth; Computer science; Cost function; Delay effects; Multicast algorithms; Multicast protocols; Real time systems; Routing; Time factors;
Conference_Titel :
Real-Time Computing Systems and Applications, 1996. Proceedings., Third International Workshop on
Conference_Location :
Seoul
Print_ISBN :
0-8186-7626-4
DOI :
10.1109/RTCSA.1996.554960
