1 / 31

Routing Protocols (RIP, OSPF, BGP)

Routing Protocols (RIP, OSPF, BGP). CONTENTS. INTRA-DOMAIN AND INTER-DOMAIN ROUTING RIP OSPF BGP. INTRA-DOMAIN AND INTER-DOMAIN ROUTING. Figure 13-1. Popular routing protocols. Inter-domain. Intra-domain. Figure 13-2. Autonomous systems.

lmarcum
Download Presentation

Routing Protocols (RIP, OSPF, BGP)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Routing Protocols (RIP, OSPF, BGP)

  2. CONTENTS • INTRA-DOMAIN AND INTER-DOMAIN • ROUTING • RIP • OSPF • BGP

  3. INTRA-DOMAIN AND INTER-DOMAIN ROUTING

  4. Figure 13-1 Popular routing protocols Inter-domain Intra-domain

  5. Figure 13-2 Autonomous systems

  6. 1. Distance Vector Routing

  7. Figure 13-3 Example of updating a routing table

  8. Figure 13-4 Initial routing tables in a small autonomous system

  9. Figure 13-5 Final routing tables for the previous figure

  10. Figure 13-12 Hop count

  11. Instability

  12. Solution for Instability 1. Defining Infinity 2. Split horizon

  13. 3. Split Horizon and Poison reverse “ Do not use this value; what I know about this route comes from you”

  14. 2. Link State Routing OSPF:(Open Shortest Path First)

  15. Link State Routing:- Building Routing Tables 1. Creation of the states of the links by each node, called the Link state packet (LSP). :- node identity, list of links, sequence no and age 2. Flooding of LSP to every other router 3. Formation of a shortest path tree for each node. :- Dijkstra Algorithm 4. Calculation of a routing table based on the shortest path tree

  16. Figure 13-18 Areas in an autonomous system

  17. Types of links

  18. Figure 13-20 Point-to-point link

  19. Figure 13-21 Transient link

  20. Figure 13-22 Stub link

  21. Figure 13-23 Example of an internet

  22. Figure 13-24 Graphical representation of an internet

  23. Figure 13-26 Router link

  24. 3. Path Vector Routing BGP: (Border Gateway Protocol)

  25. Initialization • Sharing • Updating • Loop prevention • Policy routing • Optimum path

  26. BGP: (Border Gateway Protocol) • Types of autonomous • 1. Stub AS • :-data cannot pass through a stub AS • :- Only one connection to another AS • 2. Multi-homed AS • :- More than one connection to other AS • :- data cannot pass through a stub AS • 3. Transit AS • BCP Attribute:- • Well Known • Mandatory 2. Discretionary • Optional • Transitive 2. Non Transitive • BGP Session

  27. Congestion Control • Data Traffic:- • Traffic Descriptor • Avg. Data Rate • Peak Data Rate • Max. Burst Size • Traffic Profiles • CBR ( Constant BR) • VBR ( Variable BR) • Bursty Data

  28. Network Performance

  29. Congestion Control Categories

More Related