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

Design of mixed MPLS/OSPF routing in IP networks

  • Mateusz Dzida
  • Michal Zagozdzon
  • Michal Pioro
  • Artur Tomaszewski
Publiceringsår: 2006
Språk: Engelska
Sidor: 55-59
Publikation/Tidskrift/Serie: Systems Science
Volym: 32
Nummer: 3
Dokumenttyp: Artikel i tidskrift
Förlag: Wroclaw University of Technology


In this paper, we address some Internet core network optimization issues related to a combination of Open Shortest Path First (OSPF) and Multi Protocol Label Switching (MPLS) routing protocols. Since MPLS can be combined with any routing protocol there has appeared an idea of coupling IP streams routed via the OSPF protocol and MPLS Label Switched Paths (LSPs) in the same network. One expected advantage behind such a combined routing is to adjust the design stage by allowing some flows to be routed via OSPF while others to be transmitted via MPLS LSPs. In the paper we discuss two routing optimization problems. In the first case, OSPF routing protocol works over logical network with generalized IP links. These links are either standard IP links or IP links established as MPLS LSPs. In the second case, we distinguish two types of demands depending on whether OSPF routing is used or packets are switched by MPLS Label Switch Routers (LSR). We present both problem formulations and discuss the question on how to effectively solve these problems.


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Labeling
  • Labels
  • Multicasting
  • Network protocols
  • Network routing
  • Optimization
  • Routing protocols
  • Standards
  • Switching circuits
  • Telecommunication networks
  • Hybrid OSPF/MPLS routing
  • IP networks optimization


  • ISSN: 0137-1223

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