Optimization of the shortestpath routing with equalcost multipath load balancing
(2006) In 2006 International Conference on Transparent Optical Networks 3. p.129 Abstract
 In this paper we address the problem of routing optimization in IP networks. We assume that traffic is routed along the shortest paths computed with respect to administrative link metrics. Metrics are distributed in a network by open shortest path first (OSPF) or a similar routing protocol. If it happens that the shortest path is not unique then equalcost multipath (ECMP) load balancing principle is applied. It means that the demand traffic destined to specific node is split among all the shortest paths to that node. The problem considered here is to determine the shortestpath routing pattern satisfying traffic demands, and to find appropriate link metrics while link capacities are not exceeded. Besides that many traffic engineering... (More)
 In this paper we address the problem of routing optimization in IP networks. We assume that traffic is routed along the shortest paths computed with respect to administrative link metrics. Metrics are distributed in a network by open shortest path first (OSPF) or a similar routing protocol. If it happens that the shortest path is not unique then equalcost multipath (ECMP) load balancing principle is applied. It means that the demand traffic destined to specific node is split among all the shortest paths to that node. The problem considered here is to determine the shortestpath routing pattern satisfying traffic demands, and to find appropriate link metrics while link capacities are not exceeded. Besides that many traffic engineering criterias can be used as objective function of the problem, we assume that the residual capacity volume is maximized. In this paper we formulate the problem as a mixed integer programme (MIP) and propose some combinatorial separation cuts for the problem and give an effective method for deriving such cuts (Less)
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/record/1429630
 author
 Dzida, M; Zagozdzon, M; Pioro, Michal ^{LU} and Tomaszewski, A
 organization
 publishing date
 2006
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 keywords
 resource allocation, integer programming, IP networks, combinatorial mathematics, routing protocols
 in
 2006 International Conference on Transparent Optical Networks
 volume
 3
 pages
 12  9
 publisher
 IEEEInstitute of Electrical and Electronics Engineers Inc.
 external identifiers

 Scopus:34250630604
 ISBN
 1424402352
 DOI
 10.1109/ICTON.2006.248387
 language
 English
 LU publication?
 yes
 id
 1a1419a9b06c459ca4e21f4d0bf02093 (old id 1429630)
 date added to LUP
 20090623 13:34:51
 date last changed
 20161013 04:38:23
@misc{1a1419a9b06c459ca4e21f4d0bf02093, abstract = {In this paper we address the problem of routing optimization in IP networks. We assume that traffic is routed along the shortest paths computed with respect to administrative link metrics. Metrics are distributed in a network by open shortest path first (OSPF) or a similar routing protocol. If it happens that the shortest path is not unique then equalcost multipath (ECMP) load balancing principle is applied. It means that the demand traffic destined to specific node is split among all the shortest paths to that node. The problem considered here is to determine the shortestpath routing pattern satisfying traffic demands, and to find appropriate link metrics while link capacities are not exceeded. Besides that many traffic engineering criterias can be used as objective function of the problem, we assume that the residual capacity volume is maximized. In this paper we formulate the problem as a mixed integer programme (MIP) and propose some combinatorial separation cuts for the problem and give an effective method for deriving such cuts}, author = {Dzida, M and Zagozdzon, M and Pioro, Michal and Tomaszewski, A}, isbn = {1424402352}, keyword = {resource allocation,integer programming,IP networks,combinatorial mathematics,routing protocols}, language = {eng}, pages = {129}, publisher = {ARRAY(0xa803bf0)}, series = {2006 International Conference on Transparent Optical Networks}, title = {Optimization of the shortestpath routing with equalcost multipath load balancing}, url = {http://dx.doi.org/10.1109/ICTON.2006.248387}, volume = {3}, year = {2006}, }