Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Optimization of the shortest-path routing with equal-cost multi-path load balancing

Författare:
Publiceringsår: 2006
Språk: Engelska
Sidor: 9-12
Publikation/Tidskrift/Serie: 2006 International Conference on Transparent Optical Networks
Volym: 3
Dokumenttyp: Konferensbidrag
Förlag: IEEE Press

Sammanfattning

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 equal-cost multi-path (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 shortest-path 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

Disputation

Nyckelord

  • Technology and Engineering
  • resource allocation
  • integer programming
  • IP networks
  • combinatorial mathematics
  • routing protocols

Övriga

2006-06-18/2006-06-22
Nottingham, UK
Published
Yes
  • ISBN: 1-4244-0235-2

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen