Link State Protocols Based on Dijkstra's Shortest path algorithm Avoids loops Routers monitor the state of their outgoing links Routers broadcast the state of their links within the as Every node knows the status of all links and can calculate all routes using difjkstra's algorithm Nonetheless, nodes only send packet to the next node along the route with the packets destination address. The next node will look-up the address in the routing table Example: Open Shortest Path First (oSPF) commonly used in the internet Link State protocols typically generate less"control traffic than Distance-vectorEytan Modiano Slide 17 Link State Protocols • Based on Dijkstra’s Shortest path algorithm – Avoids loops – Routers monitor the state of their outgoing links – Routers broadcast the state of their links within the AS – Every node knows the status of all links and can calculate all routes using dijkstra’s algorithm Nonetheless, nodes only send packet to the next node along the route with the packets destination address. The next node will look-up the address in the routing table • Example: Open Shortest Path First (OSPF) commonly used in the internet • Link State protocols typically generate less “control” traffic than Distance-vector