Autonomic interference avoidance with extended shortest path algorithm

Authors:
Yong Cui;Hao Che;Constantino Lagoa;ZhiMei Zheng
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Engineering, University of Texas, Arlington;Department of Electrical Engineering, Pennsylvania State University, PA;Department of Computer Science and Technology, Tsinghua University, Beijing, China
Venue:
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Year:
2006

Citing 7
Cited 0

Virtual Flow Deviation: Dynamic Routing of Bandwidth Guaranteed Connections

QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
A New Class of Online Minimum-Interference Routing Algorithms

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Dynamic Online Routing Algorithm for MPLS Traffic Engineering

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Tree based MPLS routing

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Hybrid traffic engineering: the least path interference algorithm

SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Profile-based routing and traffic engineering

Computer Communications
MPLS advantages for traffic engineering

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

The self-optimization of network resource utilization is one of the important goals for Internet Traffic Engineering. To achieve this goal, many label switched path selection solutions are proposed. However, there are two drawbacks in these solutions. First, they are computationally expensive because they identify the critical links based on the maxflow algorithm. Second, they do not consider the self-demand of the current request when trying to avoid the interference. In this paper, we propose a novel Autonomic Interference Avoidance (AIA) algorithm, which autonomically selects the path with the least interference with the future requests, to overcome these shortcomings. First, AIA identifies the critical links in the shortest paths found by the Shortest Path First (SPF) algorithm, instead of the computationally expensive maxflow algorithm. Second, we introduce the competitive principle to take into account the self-demand of the current request as well as the network status. Therefore, AIA achieves both high resource efficiency and low computation complexity.