Premium
Applications of meta‐heuristics to traffic engineering in IP networks
Author(s) -
Fortz Bernard
Publication year - 2011
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2010.00776.x
Subject(s) - computer science , private network to network interface , shortest path problem , traffic engineering , heuristics , constrained shortest path first , routing protocol , routing (electronic design automation) , robustness (evolution) , computer network , path vector protocol , equal cost multi path routing , routing domain , distributed computing , mathematical optimization , link state routing protocol , k shortest path routing , theoretical computer science , mathematics , graph , biochemistry , chemistry , gene , operating system
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.