Change search
ReferencesLink to record
Permanent link

Direct link
Loop-free link-state routing
2007 (English)In: Proceedings: 16th International Conference on Computer Communications and Networks : Honolulu, Hawaii, 13 - 16 August 2007, Piscataway, NJ: IEEE Communications Society, 2007, 905-911 p.Conference paper (Refereed)
Abstract [en]

Improving the robustness of today's intra-domain link-state networks is of increasing importance. This is because it is becoming commonplace for such networks to carry telephony, on-demand video and other kinds of real-time traffic. Since user requirements on real-time traffic are exacting, it is essential that the network is able to respond rapidly to network errors. A way of reaching fast reaction times in response to network errors is to precompute fail-over paths that can be utilized immediately when an error is detected. The fail-over path is thereafter in use until the network has converged, handling traffic that would otherwise have been lost due to the error. During convergence (when new paths are calculated) there is a caveat that needs to be avoided -the formation of temporary loops. Temporary loops can form naturally during convergence in link-state networks and can unfortunately prevent traffic from reaching a fail-over path. Traffic can therefore be lost even though a fail-over path is in place. We present an algorithm that can be used in conjunction with link-state routing, to ensure that temporary loops do not form during convergence. The algorithm improves on previous loop-free algorithms for link-state routing by reducing the number of state transitions necessary before a router can update its routing table to a new, guaranteed to exist, path for a wide variety of topological configurations.

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Communications Society, 2007. 905-911 p.
, International Conference on Computer Communications and Networks. Proceedings, ISSN 1095-2055
Research subject
Dependable Communication and Computation Systems
URN: urn:nbn:se:ltu:diva-31509DOI: 10.1109/ICCCN.2007.4317933ScopusID: 40949164799Local ID: 5b41b780-80bd-11dc-965a-000ea68e967bISBN: 1-424-41250-1OAI: diva2:1004743
International Conference on Computer Communications and Networks : 13/08/2007 - 16/08/2007
Validerad; 2007; 20071022 (ysko)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

fulltext(296 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 296 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Fransson, PierreCarr-Motyckova, Lenka

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

ReferencesLink to record
Permanent link

Direct link