Real-time multicast routing with optimal network cost

R
RTCSA
1996
Third International Workshop on Real-Time Computing Systems Application (RTCSA'96)
Abstract - Real-time multicast routing with optimal network cost

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by X. Jia Articles by J. Cao Articles by W. Jia

Third International Workshop on Real-Time Computing Systems Application (RTCSA'96)

Seoul, Korea

October 30-November 01

ISBN: 0-8186-7626-4

	ASCII Text	x
	X. Jia, J. Cao, W. Jia, "Real-time multicast routing with optimal network cost," Real-Time Computing Systems and Applications, International Workshop on, pp. 49, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996.

	BibTex	x
	@article{ 10.1109/RTCSA.1996.554960, author = {X. Jia and J. Cao and W. Jia}, title = {Real-time multicast routing with optimal network cost}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {1996}, isbn = {0-8186-7626-4}, pages = {49}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1996.554960}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - Real-time multicast routing with optimal network cost SN - 0-8186-7626-4 SP EP A1 - X. Jia, A1 - J. Cao, A1 - W. Jia, PY - 1996 KW - telecommunication channels; real-time multicast routing; optimal network cost; real-time applications; minimal network cost; shortest network delay; delay; time constraint; optimal overall network cost; NP-complete problem; minimum spanning tree heuristic VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

X. Jia, Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong

J. Cao, Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong

W. Jia, Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.1996.554960

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.

Index Terms:

telecommunication channels; real-time multicast routing; optimal network cost; real-time applications; minimal network cost; shortest network delay; delay; time constraint; optimal overall network cost; NP-complete problem; minimum spanning tree heuristic

Citation:

X. Jia, J. Cao, W. Jia, "Real-time multicast routing with optimal network cost," rtcsa, pp.49, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.