Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/35679

Bandwidth-delay constrained routing algorithms

Authors Yang, Y.
Zhang, L. View this author's profile
Muppala, JK View this author's profile
Chanson, ST HKUST affiliated (currently or previously)
Issue Date 2003
Source Computer networks , v. 42, (4), 2003, JUL 15, p. 503-520
Summary The development of technologies like Multi-Protocol Label Switching (MPLS) and Differentiated Services has laid the foundation for Internet to support multimedia applications like Voice over IP. Although much work has been done on laying MPLS paths to optimize performance, most has focused on satisfying bandwidth requirements. Relatively little research has been done on laying paths with both bandwidth and delay constraints. In this paper, we present bandwidth-delay constrained routing algorithms that use knowledge of the ingress-egress node pairs in the network in reducing the rejection rates for setting up new paths. Simulation is used to evaluate the algorithms and compare their performance against some existing algorithms for bandwidth constraints that have been modified to handle delay constraints. The results show that the proposed algorithms outperform all others under a wide range of workload, topology and system parameters. (C) 2003 Elsevier Science B.V. All rights reserved.
Subjects
ISSN 1389-1286
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Find@HKUST