A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Minimum-cost QoS multicast and unicast routing in communication networks
2003
IEEE Transactions on Communications
In this paper, we study the minimum-cost quality-ofservice multicast and unicast routing problems in communication networks. For the multicast problem, we present an efficient approximation algorithm to find a balance between a minimum-cost multicast tree and a minimum-delay multicast tree, with a provably good performance under the condition that link delay and link cost are identical. For the unicast problem, we present an efficient primal-dual heuristic algorithm to find a path which
doi:10.1109/tcomm.2003.811420
fatcat:bwzetijfs5atra3rh7yfpjehoq