Distance-vector Routing Protocol
978-613-1-63154-2
6131631549
68
2010-06-29
29,00 €
eng
https://images.our-assets.com/cover/230x230/9786131631542.jpg
https://images.our-assets.com/fullcover/230x230/9786131631542.jpg
https://images.our-assets.com/cover/2000x/9786131631542.jpg
https://images.our-assets.com/fullcover/2000x/9786131631542.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A distance-vector routing protocol is one of the two major classes of routing protocols used in packet-switched networks for computer communications, the other major class being the link-state protocol. A distance-vector routing protocol uses the Bellman-Ford algorithm to calculate paths. Examples of distance-vector routing protocols include RIPv1 and 2 and IGRP. EGP and BGP are not pure distance-vector routing protocols, because a distance-vector protocol calculates routes based only on link costs whereas in BGP, for example, the local route preference value takes priority over the link cost. A distance-vector routing protocol requires that a router informs its neighbors of topology changes periodically and, in some cases, when a change is detected in the topology of a network. Compared to link-state protocols, which require a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead.
https://www.morebooks.de/books/hu/published_by/alphascript-publishing/2/products
Adat kommunikáció, hálózatok
https://www.morebooks.de/store/hu/book/distance-vector-routing-protocol/isbn/978-613-1-63154-2