✦ LIBER ✦
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
✍ Scribed by Anna Hać; Kelei Zhou
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 246 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1055-7148
No coin nor oath required. For personal study only.
✦ Synopsis
This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree;
(3) dynamic multicast tree status which is maintained by updating the existing multicast tree when nodes in the network request to join or leave.