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

A distributed scheme for inter-domain routing optimization

Författare:
Publiceringsår: 2007
Språk: Engelska
Sidor: 8
Dokumenttyp: Konferensbidrag
Förlag: IEEE

Sammanfattning

The goal of the paper is to present a decomposed approach to optimization of inter-domain routing in IP networks. A problem of maximizing the total amount of traffic carried in an inter-domain network is formulated as a linear programme. Using Lagrangean relaxation the problem is decomposed with respect to individual domains. A resolution method based on subgradient optimization combined with recovering of a near optimal primal solution is discussed. Effectiveness of the method for the case of synchronized local intra-domain computations is tested using two different subgradient optimization algorithms: a divergent series algorithm and a proximal bundle algorithm. The issue of implementing such a method in a distributed networkwide process of routing optimization which could be run in the control plane of the network using the existing EGP protocols is considered. Two schemes for such decomposed optimization involving only partial synchronization of local intra-domain computations are discussed.

Disputation

Nyckelord

  • Technology and Engineering
  • inter-domain routing
  • subgradient maximization
  • Traffic engineering
  • optimization
  • Lagrangean relaxation

Övriga

6th International Workshop on the Design of Reliable Commuication Networks DRCN 2007
2007-10-07/2007-10-10
La Rochelle, France
Published
Yes
  • ISBN: 978-1-4244-3824-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