We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Efficient techniques and tools for intra-domain traffic engineering.
- Authors
Fortz, Bernard; Ümit, Hakan
- 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 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.
- Subjects
NETWORK routing protocols; OPEN Shortest Path First (Computer network protocol); IS-IS (Computer network protocol); TRAFFIC engineering; NETWORK routers; COMBINATORIAL optimization; HEURISTIC algorithms
- Publication
International Transactions in Operational Research, 2011, Vol 18, Issue 3, p359
- ISSN
0969-6016
- Publication type
Article
- DOI
10.1111/j.1475-3995.2010.00769.x