Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 22. Network Layer: Routing

Similar presentations


Presentation on theme: "Chapter 22. Network Layer: Routing"— Presentation transcript:

1 Chapter 22. Network Layer: Routing
Delivery Forwarding Unicast routing protocols Multicast routing protocols Spring 2010 Communication Networks, KWU

2 Communication Networks, KWU
Autonomous Systems A group of networks/routers under the authority of a single administration Intradomain routing Interdomain routing Spring 2010 Communication Networks, KWU

3 Popular Routing Protocols
Spring 2010 Communication Networks, KWU

4 Communication Networks, KWU
RIP Routing Information Protocol Distance vector routing Sharing knowledge about the entire autonomous system Sharing only with neighbors Sharing at regular intervals Routing table Destination Hop Count Next Router Other information 7 5 4 6 Spring 2010 Communication Networks, KWU

5 Distance Vector Routing
Spring 2010 Communication Networks, KWU

6 RIP: Initial Routing Tables
Spring 2010 Communication Networks, KWU

7 RIP: Updating Routing Table (Router A)
Spring 2010 Communication Networks, KWU

8 RIP: Final Routing Tables
Spring 2010 Communication Networks, KWU

9 Updating Routing Table: Example
Spring 2010 Communication Networks, KWU

10 Communication Networks, KWU
OSPF Open Shortest Path First Link state routing Sharing knowledge about the neighborhood Sharing with every other router Sharing when there is a change LSA (Link State Advertisement) Each router floods (distributes) LSAs to share information about their neighbors Link state database Every router receives LSAs from every other router Every router has exactly the same link state database Routing table Every router uses the (Dijkstra) shortest path algorithm to construct the routing table Spring 2010 Communication Networks, KWU

11 Communication Networks, KWU
Link State Routing Spring 2010 Communication Networks, KWU

12 Communication Networks, KWU
OSPF: Link Cost Spring 2010 Communication Networks, KWU

13 OSPF: Link Cost in Dijkstra Algorithm
Spring 2010 Communication Networks, KWU

14 Communication Networks, KWU
OSPF: LSA and LSD Spring 2010 Communication Networks, KWU

15 Communication Networks, KWU
OSPF: Flooding Spring 2010 Communication Networks, KWU

16 OSPF: Shortest Path Calculation (1)
Spring 2010 Communication Networks, KWU

17 OSPF: Shortest Path Caculation (2)
Spring 2010 Communication Networks, KWU

18 OSPF: Shortest Path Caculation (3)
Spring 2010 Communication Networks, KWU

19 OSPF: Shortest Path Caculation (4)
Spring 2010 Communication Networks, KWU


Download ppt "Chapter 22. Network Layer: Routing"

Similar presentations


Ads by Google