Optimization of resilient IP networks with shortest path routing
(2007) 6th International Workshop on the Design of Reliable Communication Networks DRCN 2007- Abstract
- In the paper we address traffic engineering problems related to optimization of routing in IP networks applying destination-based shortest path routing (SPR) of the OSPF type. An SPR routing pattern is determined by a system of (administrative) weights defined over the set of IP links: the routes for IP forwarding are determined as the shortest paths computed locally at the nodes using the current link weights. When the shortest path from a certain node (node v, say) to a particular destination (destination t, say) is not unique, the traffic routed from node v to destination t is split equally among all links outgoing from v that belong to the shortest paths to destination t, i.e., according to the Equal Cost Multiple-Paths (ECMP) rule.... (More)
- In the paper we address traffic engineering problems related to optimization of routing in IP networks applying destination-based shortest path routing (SPR) of the OSPF type. An SPR routing pattern is determined by a system of (administrative) weights defined over the set of IP links: the routes for IP forwarding are determined as the shortest paths computed locally at the nodes using the current link weights. When the shortest path from a certain node (node v, say) to a particular destination (destination t, say) is not unique, the traffic routed from node v to destination t is split equally among all links outgoing from v that belong to the shortest paths to destination t, i.e., according to the Equal Cost Multiple-Paths (ECMP) rule. The basic problem considered in this paper consists in finding a resilient link weight system generating a routing scheme that satisfies given traffic demands and does not lead to link overloads both in the normal network state of operation and in all considered failure states when certain IP links are failed. We assume that if a failure occurs then the weight system is modified by assigning infinite weights to the failed links, and not altering the weights of the remaining, operating links. We consider the traffic engineering goal related to minimization, over all failure states, of the maximal link overload. We formulate the considered problem as a mixed integer programme (MIP) and propose a heuristic algorithm based on the tabu search meta-heuristic. The efficiency of the proposed weight optimization method is illustrated by means of a numerical study. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1024474
- author
- Dzida, Mateusz ; Zagozdzon, Michal and Pioro, Michal LU
- organization
- publishing date
- 2007
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- to be added
- host publication
- [Host publication title missing]
- pages
- 6 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 6th International Workshop on the Design of Reliable Communication Networks DRCN 2007
- conference location
- La Rochelle, France
- conference dates
- 2007-10-07 - 2007-10-10
- external identifiers
-
- scopus:63249133009
- ISBN
- 978-1-4244-3824-2
- DOI
- 10.1109/DRCN.2007.4762270
- language
- English
- LU publication?
- yes
- id
- 43cd7407-b49b-460d-8b2f-4fa66215939e (old id 1024474)
- date added to LUP
- 2016-04-04 11:42:15
- date last changed
- 2022-01-29 22:20:17
@inproceedings{43cd7407-b49b-460d-8b2f-4fa66215939e,
abstract = {{In the paper we address traffic engineering problems related to optimization of routing in IP networks applying destination-based shortest path routing (SPR) of the OSPF type. An SPR routing pattern is determined by a system of (administrative) weights defined over the set of IP links: the routes for IP forwarding are determined as the shortest paths computed locally at the nodes using the current link weights. When the shortest path from a certain node (node v, say) to a particular destination (destination t, say) is not unique, the traffic routed from node v to destination t is split equally among all links outgoing from v that belong to the shortest paths to destination t, i.e., according to the Equal Cost Multiple-Paths (ECMP) rule. The basic problem considered in this paper consists in finding a resilient link weight system generating a routing scheme that satisfies given traffic demands and does not lead to link overloads both in the normal network state of operation and in all considered failure states when certain IP links are failed. We assume that if a failure occurs then the weight system is modified by assigning infinite weights to the failed links, and not altering the weights of the remaining, operating links. We consider the traffic engineering goal related to minimization, over all failure states, of the maximal link overload. We formulate the considered problem as a mixed integer programme (MIP) and propose a heuristic algorithm based on the tabu search meta-heuristic. The efficiency of the proposed weight optimization method is illustrated by means of a numerical study.}},
author = {{Dzida, Mateusz and Zagozdzon, Michal and Pioro, Michal}},
booktitle = {{[Host publication title missing]}},
isbn = {{978-1-4244-3824-2}},
keywords = {{to be added}},
language = {{eng}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Optimization of resilient IP networks with shortest path routing}},
url = {{http://dx.doi.org/10.1109/DRCN.2007.4762270}},
doi = {{10.1109/DRCN.2007.4762270}},
year = {{2007}},
}