Today's Lecture Routing model IntraDomain Routing 2021/2/8 16
Today’s Lecture Routing Model IntraDomain Routing 2021/2/8 16
Intra-domain Routing Protocols Based on unreliable datagram delivery Distance vector Routing Information Protocol (RIP), based on Bellman-Ford Every node advertises its cost towards all the other nodes in the network to its neighbors Link state Open shortest Path First(OSPF), based on Dijkstra k Every node advertises its cost towards its neighbors in the network to all the other nodes 2021/2/8
Intra-domain Routing Protocols Based on unreliable datagram delivery Distance vector Routing Information Protocol (RIP), based on Bellman-Ford Every node advertises its cost towards all the other nodes in the network to its neighbors Link state Open Shortest Path First (OSPF), based on Dijkstra Every node advertises its cost towards its neighbors in the network to all the other nodes 2021/2/8 17