Real-time multicast routing with optimal network cost

X. Jia, Jiannong Cao, W. Jia

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA
PublisherIEEE
Pages49-56
Number of pages8
Publication statusPublished - 1 Dec 1996
Externally publishedYes
EventProceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications - Seoul, Korea, Republic of
Duration: 30 Oct 19961 Nov 1996

Conference

ConferenceProceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications
Country/TerritoryKorea, Republic of
CitySeoul
Period30/10/961/11/96

ASJC Scopus subject areas

  • Computer Science(all)

Cite this