Applications of meta-heuristics to traffic engineering in IP networks

• Published in: International transactions in operational research Vol. 18; no. 2; pp. 131 - 147
• Main Author: Fortz, Bernard
• Format: Journal Article
• Language: English
• Published: Oxford, UK Blackwell Publishing Ltd 01.03.2011; Pergamon; Wiley
• Subjects: Computer Science; Internet Protocol; internet traffic engineering; meta-heuristics; Operations Research; Routing; shortest path routing; Studies; Traffic congestion; Traffic control
• ISSN: 0969-6016; 1475-3995
• DOI: 10.1111/j.1475-3995.2010.00776.x

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.