User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

Avoiding transient loops during the convergence of link-state routing protocols

Primary tabs

download
  • Open access
  • PDF
  • 240.88 K
François, Pierre [UCL] Bonaventure, Olivier [UCL]

When using link-state protocols such as OSPF or IS-IS, forwarding loops can occur transiently when the routers adapt their forwarding tables as a response to a topological change. In this paper, we present a mechanism that lets the network converge to its optimal forwarding state without risking any transient loops and the related packet loss. The mechanism is based on an ordering of the updates of the forwarding tables of the routers. Our solution can be used in the case of a planned change in the state of a set of links and in the case of unpredictable changes when combined with a local protection scheme. The supported topology changes are link transitions from up to down, down to up, and updates of link metrics. Finally, we show by simulations that sub-second loop-free convergence is possible on a large Tier-1 ISP network.

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès libre
Publication date 2005
Language Anglais
Conference "24th Annual Joint Conference of the IEEE Computer and Communications Societies", Miami, USA (du 13/03/2005 au 17/03/2005)
issn 1063-6692
e-issn 1558-2566
Affiliation UCL - SST/ICTM/INGI - Pôle en ingénierie informatique
Keywords 1162
Links
Bibliographic reference François, Pierre ; Bonaventure, Olivier. Avoiding transient loops during the convergence of link-state routing protocols.24th Annual Joint Conference of the IEEE Computer and Communications Societies (Miami, USA, du 13/03/2005 au 17/03/2005).
Permanent URL http://hdl.handle.net/2078.1/135533