HTML Microdata document

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

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

Namespace Prefixes

Prefix	IRI
dbpedia-de	http://de.dbpedia.org/resource/
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n5	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
prov	http://www.w3.org/ns/prov#
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Path-vector_routing_protocol
rdfs:label: Path-vector routing protocol Pfadvektorprotokoll
rdfs:comment: A path-vector routing protocol is a network routing protocol which maintains the path information that gets updated dynamically. Updates that have looped through the network and returned to the same node are easily detected and discarded. This algorithm is sometimes used in Bellman–Ford routing algorithms to avoid "Count to Infinity" problems. It is different from the distance vector routing and link state routing. Each entry in the routing table contains the destination network, the next router and the path to reach the destination. Exterior Gateway Protocol (EGP) does not use path vectors. Ein Pfadvektorprotokoll ist ein Routing-Protokoll für Computernetzwerke, welches für die einzelnen Elemente (Pfade) jeweils den Vektor mitführt, den dieses Element bei der Ausbreitung durch das Netzwerk genommen hat. Durch den Vektor kann ein Pfad leicht als Schleife erkannt werden, wenn das empfangende System bereits Bestandteil des Vektors ist. Hierdurch werden Unendlichkeitsprobleme vermieden.
dcterms:subject: dbc:Routing_protocols
dbo:wikiPageID: 2421243
dbo:wikiPageRevisionID: 1070876581
dbo:wikiPageWikiLink: dbr:Bellman–Ford_algorithm dbc:Routing_protocols dbr:Distance_vector_routing dbr:Link-state_routing_protocol dbr:Autonomous_system_(Internet) dbr:Border_Gateway_Protocol dbr:Open_Shortest_Path_First dbr:Routing_protocol dbr:Link_state_routing dbr:Exterior_Gateway_Protocol
owl:sameAs: n5:days wikidata:Q1666535 dbpedia-de:Pfadvektorprotokoll
dbp:wikiPageUsesTemplate: dbt:Compu-network-stub dbt:Unreferenced_stub dbt:Short_description
dbp:auto: yes
dbp:date: December 2009
dbo:abstract: A path-vector routing protocol is a network routing protocol which maintains the path information that gets updated dynamically. Updates that have looped through the network and returned to the same node are easily detected and discarded. This algorithm is sometimes used in Bellman–Ford routing algorithms to avoid "Count to Infinity" problems. It is different from the distance vector routing and link state routing. Each entry in the routing table contains the destination network, the next router and the path to reach the destination. Border Gateway Protocol (BGP) is an example of a path vector protocol. In BGP, the autonomous system boundary routers (ASBR) send path-vector messages to advertise the reachability of networks. Each router that receives a path vector message must verify the advertised path according to its policy. If the message complies with its policy, the router modifies its routing table and the message before sending the message to the next neighbor. It modifies the routing table to maintain the autonomous systems that are traversed in order to reach the destination system. It modifies the message to add its AS number and to replace the next router entry with its identification. Exterior Gateway Protocol (EGP) does not use path vectors. It has three phases: 1. * Initiation 2. * Sharing 3. * Updating Of note, BGP is commonly referred to as an External Gateway Protocol (EGP) given its role in connecting Autonomous Systems (AS). Communication protocols within AS are therefore referred to as Internal Gateway Protocols (IGP) which contain OSPF and IS-IS among others. This being said, BGP can be used within an AS, which typically occurs within very large organizations such as Facebook or Microsoft. Ein Pfadvektorprotokoll ist ein Routing-Protokoll für Computernetzwerke, welches für die einzelnen Elemente (Pfade) jeweils den Vektor mitführt, den dieses Element bei der Ausbreitung durch das Netzwerk genommen hat. Durch den Vektor kann ein Pfad leicht als Schleife erkannt werden, wenn das empfangende System bereits Bestandteil des Vektors ist. Hierdurch werden Unendlichkeitsprobleme vermieden.
prov:wasDerivedFrom: wikipedia-en:Path-vector_routing_protocol?oldid=1070876581&ns=0
dbo:wikiPageLength: 2173
foaf:isPrimaryTopicOf: wikipedia-en:Path-vector_routing_protocol

Subject Item: dbr:Path_vector_routing_protocol
dbo:wikiPageWikiLink: dbr:Path-vector_routing_protocol
dbo:wikiPageRedirects: dbr:Path-vector_routing_protocol

Subject Item: dbr:Border_Gateway_Protocol
dbo:wikiPageWikiLink: dbr:Path-vector_routing_protocol

Subject Item: dbr:Routing_protocol
dbo:wikiPageWikiLink: dbr:Path-vector_routing_protocol

Subject Item: dbr:Path_vector_protocol
dbo:wikiPageWikiLink: dbr:Path-vector_routing_protocol
dbo:wikiPageRedirects: dbr:Path-vector_routing_protocol

Subject Item: dbr:Path_vector
dbo:wikiPageWikiLink: dbr:Path-vector_routing_protocol
dbo:wikiPageRedirects: dbr:Path-vector_routing_protocol

Subject Item: wikipedia-en:Path-vector_routing_protocol
foaf:primaryTopic: dbr:Path-vector_routing_protocol