This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n18http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://localhost/temp/predkladatel/
n8http://purl.org/net/nknouf/ns/bibtex#
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/subjekt/
n13http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26220%2F12%3APU98599%21RIV13-MSM-26220___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26220%2F12%3APU98599%21RIV13-MSM-26220___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
This paper discusses internetworking and how routes are discovered and used with one of the most commonly used routing protocol Open Shortest Path First (OSPF). The limitation of this protocol is that the algorithm does not take actual link load into consideration. OSPF is not traffic aware. This paper suggests using an alternate costing strategy to avoid this problem. The alternate strategy considers link load as an additional parameter for a final metric calculation. An integer value is assigned for the load of a link as the additive component of metric. Metric significantly affects the selection of links in the shortest path first. Since the link load is a dynamic variable, Exponential Weighted Moving Average is used for the proposed method of metric additive calculation. This paper discusses internetworking and how routes are discovered and used with one of the most commonly used routing protocol Open Shortest Path First (OSPF). The limitation of this protocol is that the algorithm does not take actual link load into consideration. OSPF is not traffic aware. This paper suggests using an alternate costing strategy to avoid this problem. The alternate strategy considers link load as an additional parameter for a final metric calculation. An integer value is assigned for the load of a link as the additive component of metric. Metric significantly affects the selection of links in the shortest path first. Since the link load is a dynamic variable, Exponential Weighted Moving Average is used for the proposed method of metric additive calculation.
dcterms:title
OSPF Alternate Costing Strategy OSPF Alternate Costing Strategy
skos:prefLabel
OSPF Alternate Costing Strategy OSPF Alternate Costing Strategy
skos:notation
RIV/00216305:26220/12:PU98599!RIV13-MSM-26220___
n13:predkladatel
n14:orjk%3A26220
n3:aktivita
n19:S
n3:aktivity
S
n3:dodaniDat
n10:2013
n3:domaciTvurceVysledku
n11:9368264 Krkoš, Radko n11:8272719
n3:druhVysledku
n17:D
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
157222
n3:idVysledku
RIV/00216305:26220/12:PU98599
n3:jazykVysledku
n15:eng
n3:klicovaSlova
OSPF, metric, link load
n3:klicoveSlovo
n7:OSPF n7:metric n7:link%20load
n3:kontrolniKodProRIV
[DFCC46180CF8]
n3:mistoKonaniAkce
Praha
n3:mistoVydani
Prague
n3:nazevZdroje
2012 International Conference on Telecommunication Systems, Modeling and Analysis (ICTSM2012)
n3:obor
n16:JA
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n10:2012
n3:tvurceVysledku
Novotný, Vít Mácha, Tomáš Krkoš, Radko
n3:typAkce
n18:WRD
n3:zahajeniAkce
2012-05-24+02:00
s:numberOfPages
5
n8:hasPublisher
České vysoké učení technické v Praze
n21:isbn
978-0-9820958-6-7
n20:organizacniJednotka
26220