| Status | 已發表Published |
| Real-time multicast routing with optimal network cost | |
| Jia X.; Cao J.; Jia W. | |
| 1996-12-01 | |
| Source Publication | Proceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA
 |
| Pages | 49-56 |
| 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. |
| URL | View the original |
| Language | 英語English |
| Fulltext Access | |
| Document Type | Conference paper |
| Collection | University of Macau |
| Affiliation | City University of Hong Kong |
| Recommended Citation GB/T 7714 | Jia X.,Cao J.,Jia W.. Real-time multicast routing with optimal network cost[C], 1996, 49-56. |
| APA | Jia X.., Cao J.., & Jia W. (1996). Real-time multicast routing with optimal network cost. Proceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA, 49-56. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment