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 language | English |
|---|---|
| Title of host publication | Proceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA |
| Publisher | IEEE |
| Pages | 49-56 |
| Publication status | Published - 1996 |
| Event | Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications - Seoul, South Korea Duration: 30 Oct 1996 → 1 Nov 1996 |
Conference
| Conference | Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications |
|---|---|
| City | Seoul, South Korea |
| Period | 30/10/96 → 1/11/96 |
Fingerprint
Dive into the research topics of 'Real-time multicast routing with optimal network cost'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver