Paper Info
Title
Bandwidth-delay constrained routing algorithms
Abstract
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.
Year
DOI
Venue
2003
10.1016/S1389-1286(03)00199-3
Computer Networks
Keywords
DocType
Volume
bandwidth constraint,MPLS,Bandwidth–delay constrained routing,delay constraint,Multi-Protocol Label Switching,Traffic engineering,Quality of service routing,ingress-egress node pair,Maximum flow,existing algorithm,multimedia application,Differentiated Services,new path,bandwidth requirement,MPLS path
Journal
42
Issue
ISSN
Citations 
4
Computer Networks
9
PageRank 
References 
Authors
0.59
16
4
Name
Order
Citations
PageRank
Yi Yang1304.22
Lei Zhang216413.21
Jogesh Muppala377479.12
Samuel T. Chanson41019109.88