About: Routing loop     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/c/5mDMXSkfcX

A routing loop is a common problem with various types of networks, particularly computer networks. They are formed when an error occurs in the operation of the routing algorithm, and as a result, in a group of nodes, the path to a particular destination forms a loop. In the simplest version, a routing loop of size two, node A thinks that the path to some destination (call it C) is through its neighbouring node, node B. At the same time, node B thinks that the path to C starts at node A.

AttributesValues
rdfs:label
  • Bucle de enrutamiento (es)
  • Routing loop (en)
rdfs:comment
  • Un Bucle de enrutamiento o routing Loop ocurre cuando los encaminadores o routers disponen de una información acerca de la red y en lugar de enviar el tráfico a su destino, se pasan los paquetes entre ellos creyendo que el otro enrutador sabrá el camino. * Datos: Q7371625 (es)
  • A routing loop is a common problem with various types of networks, particularly computer networks. They are formed when an error occurs in the operation of the routing algorithm, and as a result, in a group of nodes, the path to a particular destination forms a loop. In the simplest version, a routing loop of size two, node A thinks that the path to some destination (call it C) is through its neighbouring node, node B. At the same time, node B thinks that the path to C starts at node A. (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Drawing2rlp.jpg
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
thumbnail
has abstract
  • Un Bucle de enrutamiento o routing Loop ocurre cuando los encaminadores o routers disponen de una información acerca de la red y en lugar de enviar el tráfico a su destino, se pasan los paquetes entre ellos creyendo que el otro enrutador sabrá el camino. En los diseños de redes complejas pueden producirse bucles o loops de enrutamiento. Los enrutadores transmiten a sus vecinos actualizaciones constantes, si un enrutador A recibe de B una actualización de una red que ha caído, este transmitirá dicha información a todos sus vecinos incluido al enrutador B quien primeramente le informó de la novedad, a su vez el enrutador B volverá a comunicar que la red se ha caído al enrutador A formándose un bucle interminable. * Datos: Q7371625 (es)
  • A routing loop is a common problem with various types of networks, particularly computer networks. They are formed when an error occurs in the operation of the routing algorithm, and as a result, in a group of nodes, the path to a particular destination forms a loop. In the simplest version, a routing loop of size two, node A thinks that the path to some destination (call it C) is through its neighbouring node, node B. At the same time, node B thinks that the path to C starts at node A. Thus, whenever traffic for C arrives at either A or B, it will loop endlessly between A and B, unless some mechanism exists to prevent that behaviour. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git147 as of Sep 06 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software