"Disruption-free routing convergence : computing minimal link-state update ..."

François Clad (2014)

> Home

Details and statistics

DOI: —

access: open

type: Book or Thesis

metadata version: 2020-07-21

- view
  - electronic edition @ archives-ouvertes.fr (open access)
- export record
  dblp key:
  - phd/hal/Clad14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Clad14
François Clad:
Disruption-free routing convergence : computing minimal link-state update sequences. (Convergence du routage sans perturbation : calcul de séquences minimales de mises à jour d'états des liens). University of Strasbourg, France, 2014

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.