About: Loop-Free Link-State Routing

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Loop-Free Link-State Routing Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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. 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. (en)
Title	Loop-Free Link-State Routing Loop-Free Link-State Routing (en)
skos:prefLabel	Loop-Free Link-State Routing Loop-Free Link-State Routing (en)
skos:notation	RIV/61989592:15310/07:00004621!RIV12-GA0-15310___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA201/05/0079)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Motyčková, Lenka
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Palackého v Olomouci / Přírodovědecká fakulta
http://linked.open...dnocenehoVysledku	431439
http://linked.open...ai/riv/idVysledku	RIV/61989592:15310/07:00004621
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Computer networks, routing, link-state, algorithm (en)
http://linked.open.../riv/klicoveSlovo	link-state algorithm routing Computer networks
http://linked.open...ontrolniKodProRIV	[75D7E3565D9E]
http://linked.open...v/mistoKonaniAkce	Honolulu
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	Computer Communications and Networks
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Formal concept analysis of indeterminate and large data: theory, methods, and applications
http://linked.open...UplatneniVysledku	2007
http://linked.open...iv/tvurceVysledku	Carr-Motyčková, Lenka Fransson, Pierre
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2007-08-13 (xsd:date)
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE Computer Society Press
https://schema.org/isbn	978-1-4244-1250-1
http://localhost/t...ganizacniJednotka	15310

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 78 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software