![]() Enter the number of nodes: 4 Enter the cost matrix: 0 3 5 99 3 0 99 1 5 4 0 2 99 1 2 0 State value for router 1 is node 1 via 1 Distance0 node 2 via 2 Distance3 node 3 via 3 Distance5 node 4 via 2 Distance4 State value for router 2 is node 1 via 1 Distance3 node 2 via 2 Distance0 node 3 via 4 Distance3 node 4 via 4 Distance1 State value for router 3 is node 1 via 1 Distance5 node 2 via 4 Distance3 node 3 via 3 Distance0 node 4 via 4 Distance2 State value for router 4 is node 1 via 2 Distance4 node 2 via 2 Distance1 node 3 via 3 Distance2 node 4 via 4 Distance0. 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. ![]() Examples of distance-vector routing protocols include Routing Information Protocol Version 1 & 2, RIPv1 and RIPv2 and IGRP. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |