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

Quality of service routing algorithms for bandwidth-delay constrained applications

Authors Yang, Yi
Issue Date 2001
Summary The advent of technologies like Multi-Protocol Label Switching (MPLS) and Differentiated Services (Diffserv) has enabled traffic engineering (TE) within the Internet to support multimedia applications like Voice over IP (VoIP). 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 thesis, we classify and discuss existing routing algorithms. We study the performance of several bandwidth-constrained algorithms in supporting VoIP trunks. We then present bandwidth-delay constrained routing algorithms that use knowledge of the ingress-egress node pairs in the network to reduce the rejection rates for setting up new paths. Simulation is used to evaluate the algorithms and compare their performance against 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.
Note Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2001
Subjects
Language English
Format Thesis
Access
Files in this item:
File Description Size Format
th_redirect.html 341 B HTML