A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay.
Anna HacKelei ZhouPublished in: Int. J. Netw. Manag. (1999)
Keyphrases
- minimum cost
- multicast tree
- np hard
- network model
- network flow
- spanning tree
- approximation algorithms
- end to end delay
- network topology
- ip networks
- network flow problem
- multicast routing
- shortest path
- network resources
- congestion control
- network coding
- delay constrained
- genetic algorithm
- single source
- quality of service
- routing algorithm
- real time
- minimum cost path
- packet loss
- multiple description coding
- end to end
- wireless mesh networks
- wireless networks
- special case
- lower bound