Back to Search Start Over

Applications of meta-heuristics to traffic engineering in IP networks

Authors :
Bernard Fortz
Graphes et Optimisation Mathématique [Bruxelles] (GOM)
Université libre de Bruxelles (ULB)
Fortz, Bernard
Source :
International Transactions in Operational Research, International Transactions in Operational Research, Wiley, 2011, 18 (2), pp.131--147, International transactions in operational research, 18 (2
Publication Year :
2010
Publisher :
Wiley, 2010.

Abstract

Intra-domain routing protocols are based on shortest path first (SPF) routing, where shortest paths arecalculated between each pair of nodes (routers) using pre-assigned link weights, also referred to as linkmetric. These link weights can be modified by network administrators in accordance with the routingpolicies of the network operator. The operator’s objective is usually to minimize traffic congestion orminimize 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 difficulttask.This paper provides a survey of meta-heuristic approaches to traffic engineering, focusing on local searchapproaches and extensions to the basic problem taking into account changing demands and robustnessissues with respect to network failures.<br />FLWIN<br />info:eu-repo/semantics/published

Details

ISSN :
09696016 and 14753995
Volume :
18
Database :
OpenAIRE
Journal :
International Transactions in Operational Research
Accession number :
edsair.doi.dedup.....39fda9a293c1d9a12cb14d79844f2f9b
Full Text :
https://doi.org/10.1111/j.1475-3995.2010.00776.x