Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Three methods for optimizing single-shortest path routing

In English

Författare

  • M Dzida
  • M Zagozdzon
  • M Zotkiewicz
  • Mats Petter Wallander
  • Michal Pioro
  • M Duelli
  • M Menth

Summary, in English

Intra-domain routing in IP networks is based on the shortest path principle by assigning administrative weights (costs) to links. The resulting least-cost paths determine routes between pairs of routers. If several such equal-cost paths exist between a pair of routers, it may not be clear which of them is actually used to route traffic. This makes it difficult to predict the network traffic flow distribution. Therefore, the selected link costs should assure uniqueness of the shortest paths. On top of that, the link costs can be optimized with respect to some traffic objective. The resulting optimization problem, referred to as SSPP, turns out to be NP-hard. SSPP can be formulated as a mixed-integer programming problem and, as such, solved with branch-and- bound (B&B). In this paper, we consider three methods for SSPP. Two of them are exact methods based on B&B, namely branch- and-cut and constraint programming. Since the exact solutions of SSPP may require excessive computation time and may not always be effective when applied to practical networks, we also study a fast heuristic method. Finally, in a numerical study, we compare the effectiveness of the three approaches.

Publiceringsår

2008

Språk

Engelska

Sidor

61-68

Publikation/Tidskrift/Serie

[Host publication title missing]

Dokumenttyp

Konferensbidrag

Ämne

  • Computer Science
  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

The 3rd Euro NGI Conference on Next Generation Internet Networks 2008 (NGI 2008)

Conference date

2008-04-28 - 2008-04-30

Conference place

Cracow, Poland

Status

Published

Forskningsgrupp

  • Networking

ISBN/ISSN/Övrigt

  • ISBN: 1-4244-1784-8