| dbo: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)
|
| dbo:thumbnail
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 4107 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| 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)
|
| rdfs:label
|
- Bucle de enrutamiento (es)
- Routing loop (en)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:depiction
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
