A Robust Routing Plan to Optimize Throughput in Core Networks

An algorithm for finding a robust routing plan in core networks that takes into consideration network topology, available capacity, traffic demand, and quality of service (QoS) requirements is presented.

Abstract

This paper presents an algorithm for finding a robust routing plan in core networks that takes into consideration network topology, available capacity, traffic demand, and quality of service (QoS) requirements. The algorithm addresses the difficult problem in routing and traffic engineering of optimal path selection. Our approach is inspired by the concept of "between-ness" from graph theory, from which we introduce quantitative metrics for link and path criticality. Paths are ranked according to path criticality and the algorithm tries to avoid placing flows on the most critical paths, maximizes throughput over the short term in the presence of QoS constraints, and attempts to increase the bandwidth of the critical paths for future use. The proposed approach shows promise relative to previous proposals in simulations on benchmark and experimental networks.