Premium
Efficient techniques and tools for intra‐domain traffic engineering
Author(s) -
Fortz Bernard,
Ümit Hakan
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.00769.x
Subject(s) - computer science , shortest path problem , path vector protocol , private network to network interface , constrained shortest path first , routing protocol , heuristic , routing (electronic design automation) , link state routing protocol , equal cost multi path routing , domain (mathematical analysis) , computer network , distributed computing , mathematical optimization , k shortest path routing , mathematics , theoretical computer science , graph , artificial intelligence , mathematical analysis
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 costs subject to the traffic demands and the protocol constraints. However, determining a link weight combination that meets a network operator's objectives is a difficult task. In this paper, we study the link weight optimization problem in intra‐domain networks. This problem is proved to be NP‐hard with hard protocol constraints, e.g., a flow is evenly distributed along the shortest paths between its origin and destination nodes. We present two fast heuristic approaches to generate efficient link metrics for intra‐domain routing. Some promising experimental results are reported.