A robust routing plan to optimize throughput in core networks

Authors:
Ali Tizghadam;Alberto Leon-Garcia
Affiliations:
University of Toronto, Electrical and Computer Engineering Department;University of Toronto, Electrical and Computer Engineering Department
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 7
Cited 4

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Finding the k Shortest Paths

SIAM Journal on Computing
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Profile-Based Routing: A New Framework for MPLS Traffic Engineering

COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Network robustness and graph topology

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications

Comparison of network criticality, algebraic connectivity, and other graph metrics

Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners
Survival value of communication networks

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Autonomic traffic engineering for network robustness

IEEE Journal on Selected Areas in Communications
Robust network planning in nonuniform traffic scenarios

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.