Distance-vector Routing Protocol: Routing protocol, Packet- switched network, Computer communication, Link- state protocol, Bellman- Ford algorithm, Routing Information Protocol - Softcover

Softcover

ISBN 10: 6131631549 ISBN 13: 9786131631542

Verlag: OmniScriptum, 2026

Inhaltsangabe

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.

Details zur Ausgabe

• Verlag: OmniScriptum
• Erscheinungsdatum: 2026
• Sprache: Englisch
• ISBN 10: 6131631549
• ISBN 13: 9786131631542
• Einband: Taschenbuch
• Anzahl der Seiten: 68
• Herausgeber: Horst Kristen Nehemiah
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Presses Academiques Francophones; customerservice@vdm-vsg.de; ; Brivibas gatve 197; Riga; 1039; Lettland