RIP Table processing O RIP routing tables managed by application-level process called route-d(daemon) O advertisements sent in UDP packets, periodically repeated routed routed transport(UDR) transport(UDP) network(IP)tables routing tables network(P) data link data link physical physIca 4: Network Layer 4b-11
4: Network Layer 4b-11 RIP Table processing RIP routing tables managed by application-level process called route-d (daemon) advertisements sent in UDP packets, periodically repeated
RIP Table example(continued Router: giroflee eurocom fr Des七 ination Gateway Flags Ref 工 nterface 127.0.0.1 127.0.0.1 UH 0264 192.168.2 192.168.2.5 193.55.114 193.55.114.6 192.168.3 192.168.3.5 UUUU 3585031e0 gaa 224.0.0.0 193.55.114.6 01e0 defaul七 193.55.114.129 UG 0143454 o three attached class c networks lANs) o Router only knows routes to attached LANs o Default router used to" go up g Route multicast address: 224.0.0.0 o Loopback interface(for debugging 4: Network layer 4b-12
4: Network Layer 4b-12 RIP Table example (continued) Router: giroflee.eurocom.fr Three attached class C networks (LANs) Router only knows routes to attached LANs Default router used to “go up” Route multicast address: 224.0.0.0 Loopback interface (for debugging) Destination Gateway Flags Ref Use Interface -------------------- -------------------- ----- ----- ------ --------- 127.0.0.1 127.0.0.1 UH 0 26492 lo0 192.168.2. 192.168.2.5 U 2 13 fa0 193.55.114. 193.55.114.6 U 3 58503 le0 192.168.3. 192.168.3.5 U 2 25 qaa0 224.0.0.0 193.55.114.6 U 3 0 le0 default 193.55.114.129 UG 0 143454
OSPF(Open Shortest Path First) o"open": publicly available 2 D Uses link State algorithm o LS packet dissemination o Topology map at each node o Route computation using Dijkstra's algorithm D OSPF advertisement carries one entry per neighbor router O Advertisements disseminated to entire as(via flooding 4: Network Layer 4b-13
4: Network Layer 4b-13 OSPF (Open Shortest Path First) “open”: publicly available Uses Link State algorithm LS packet dissemination Topology map at each node Route computation using Dijkstra’s algorithm OSPF advertisement carries one entry per neighbor router Advertisements disseminated to entire AS (via flooding)