Solving bandwidth-guaranteed routing problem using routing data

TL;DR

This paper presents a traffic engineering routing algorithm that improves bandwidth-guaranteed routing by utilizing routing data and network states, achieving higher acceptance ratios and faster computation than existing algorithms.

Contribution

The paper introduces a novel routing algorithm that incorporates routing data such as probabilities and link usage, enhancing bandwidth-guaranteed routing performance.

Findings

Higher acceptance ratio compared to existing algorithms

Faster computation times demonstrated in experiments

Better overall performance in traffic engineering scenarios

Abstract

This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted demand. The novel idea is to select routes based on not only network states but also information derived from routing data such as probabilities of the ingress egress pairs and usage frequencies of the links. Experiments with respect to acceptance ratio and computation time have been conducted against various test sets. Results indicate that the proposed algorithm has better performance than the existing popular algorithms including Minimum Interference Routing Algorithm (MIRA) and Random Race based Algorithm for Traffic Engineering (RRATE).