Applications of meta-heuristics to traffic engineering in IP networks

Abstract

Intra-domain routing protocols are based on shortest path first (SPF) routing, where shortest paths are calculated between each pair of nodes (routers) using pre-assigned link weights, also referred to as link metric. These link weights can be modified by network administrators in accordance with the routing policies of the network operator. The operator's objective is usually to minimize traffic congestion or minimize total routing cost subject to the traffic demands and the protocol constraints. However, determining a link weights combination that best suits the network operator's requirements is a difficult task.This paper provides a survey of meta-heuristic approaches to traffic engineering, focusing on local search approaches and extensions to the basic problem taking into account changing demands and robustness issues with respect to network failures.

Monte Carlo Search Algorithms for Network Traffic Engineering

“…Genetic algorithms were also proposed to solve this problem [21,8]. The reader is referred to the surveys [22,1] for more details and references about the existing meta-heuristics approaches proposed to solve this splittable variant. Most of the previous meta-heuristics were tested on networks of small/moderate size and do not consider the unsplittable case or QoS constraints such as the delay.…”

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

“…Except for some special cases [38] there is no complete description of routing configurations which can be realized as shortest‐paths, but [7, 8, 10, 13, 14, 16,17) study some necessary conditions. For more extensive reviews on the subject, we refer to the surveys of Alt \documentclass{article}\usepackage{mathrsfs, amsmath, amssymb}\pagestyle{empty}\begin{document}\begin{align*} \mathcal{i}\end{align*}\end{document}n et al [3], Bley et al [11] and Fortz [21].…”