TY - JOUR
T1 - Minimum-cost QoS multicast and unicast routing in communication networks
AU - Xue, Guoliang
N1 - Funding Information:
Paper approved by P. E. Rynes, the Editor for Switching Systems of the IEEE Communications Society. Manuscript received October 10, 2000; revised February 23, 2002 and November 29, 2002. This work was supported in part by the Army Research Office (ARO) under Grant DAAD19-00-1-0377. The author is with the Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406 USA (e-mail: xue@asu.edu). Digital Object Identifier 10.1109/TCOMM.2003.811420
PY - 2003/5
Y1 - 2003/5
N2 - In this paper, we study the minimum-cost quality-of-service 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 probably 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 balances path cost and path delay, together with an error bound. The lack of a probably good performance for the second algorithm is complemented by computational results on randomly generated networks. Our algorithm finds optimal solutions in more than 80% of the cases and finds close to optimal solutions in all other cases, while using much less time.
AB - In this paper, we study the minimum-cost quality-of-service 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 probably 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 balances path cost and path delay, together with an error bound. The lack of a probably good performance for the second algorithm is complemented by computational results on randomly generated networks. Our algorithm finds optimal solutions in more than 80% of the cases and finds close to optimal solutions in all other cases, while using much less time.
KW - Communication networks
KW - Minimum-cost delay-constrained end-to-end routing
KW - Minimum-cost delay-constrained multicast trees
UR - http://www.scopus.com/inward/record.url?scp=0037701239&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037701239&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2003.811420
DO - 10.1109/TCOMM.2003.811420
M3 - Article
AN - SCOPUS:0037701239
SN - 0090-6778
VL - 51
SP - 817
EP - 824
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 5
ER -