This paper presents a fast and non-greedy interference minimizing routing algorithm (IMRA) for dynamic routing of bandwidth guaranteed LSPs (label switched paths). The algorithm operates on-line by handling requests that arrive one by one without the need for a priori knowledge of traffic characteristics except the information on the ingress-egress pairs. Our proposed algorithm combines three criteria: minimization of interference, saving of residual link bandwidth, and optimal usage of network capacity. The most important feature is the fast path computation to achieve short response time, which is a crucial factor for on-line routing algorithms. IMRA's complexity is low, consequently scalable for large networks and suitable for on-line routing. Experiments under dynamic (short-lived) LSP requests show better performance than existing non-greedy routing algorithms, while consuming lower computation effort.
['K. Hendling', 'Thomas Losert', 'Wolfgang Huber', 'Martin Jandl']
Interference minimizing bandwidth guaranteed on-line routing algorithm for traffic engineering