Path-vector routing protocol
id:
path-vector-routing-protocol-294-13894566
title:
Path-vector routing protocol
text:
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
brand slug:
wiki
category slug:
encyclopedia
description:
Routing algorithm methodology that allows dynamic updates
original url:
https://en.wikipedia.org/wiki/Path-vector_routing_protocol
date created:
date modified:
2024-03-14T10:04:41Z
main entity:
{"identifier":"Q1666535","url":"https://www.wikidata.org/entity/Q1666535"}
image:
fields total:
13
integrity:
14