Routing Protocols (RIP, OSPF, BGP).

Slides:



Advertisements
Similar presentations
© 2007 Cisco Systems, Inc. All rights reserved.ICND2 v1.0—3-1 Medium-Sized Routed Network Construction Reviewing Routing Operations.
Advertisements

Chapter 11 Unicast Routing Protocols
Routing So how does the network layer do its business?
Unicast Routing Protocols: RIP, OSPF, and BGP
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
TCP/IP Protocol Suite1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Chapter 14 Routing Protocols (RIP, OSPF, and BGP)
Delivery, Forwarding and
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.
Computer Networks22-1 Chapter 22. Network Layer: Delivery, Forwarding, and Routing 21.1 Delivery 21.2 Forwarding 21.3 Unicast Routing Protocols 21.4 Multicast.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 13 Routing Protocols (RIP, OSPF, BGP)
1 Chapter 14 Routing Protocols (RIP, OSPF, and BGP) Chapter 14 Routing Protocols (RIP, OSPF, and BGP) Mi-Jung Choi Dept. of Computer Science and Engineering.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Lecture 17 November 8Intra-domain routing November 13Internet routing 1 November 15Internet routing 2 November 20End-to-end protocols 1 November 22End-to-end.
22.1 Chapter 22 Routing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
1 Kyung Hee University Chapter 11 Unicast Routing Protocols (RIP, OSPF, and BGP)
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Ch 22. Routing Direct and Indirect Delivery.
1 INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is referred.
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
22.1 Network Layer Delivery, Forwarding, and Routing.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
TRANSPORT LAYER BY, Parthasarathy.g.
Chapter 4: Network Layer
Chapter 14 Routing Protocols (RIP, OSPF, and BGP)
Networking CS 3470, Section 1 Sarah Diesburg
Routing BY, P.B.SHANMATHI.
Routing Protocols (RIP, OSPF, and BGP)
(How the routers’ tables are filled in)
9 Network Layer Part VI Computer Networks Tutun Juhana
Routing Information Protocol (RIP)
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Chapter 4: Network Layer
COMP 3270 Computer Networks
TODAY’S TENTATIVE AGENDA
Distance Vector Routing
Delivery, Forwarding, and Routing
Intra-Domain Routing Jacob Strauss September 14, 2006.
Routing: Distance Vector Algorithm
Net 323 D: Networks Protocols
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Net 323 D: Networks Protocols
UNIT III ROUTING.
(How the routers’ tables are filled in)
Link state routing In link state routing, if each node in the domain has the entire topology of the domain list of nodes and links, how they are connected.
Delivery, Forwarding, and Routing
Chapter 13 Routing Protocols (RIP, OSPF, and BGP)
UNICAST ROUTING PROTOCOLS
Department of Computer and IT Engineering University of Kurdistan
CS 3700 Networks and Distributed Systems
Chapter 11 Unicast Routing Protocols (RIP, OSPF, and BGP)
COMPUTER NETWORKS CS610 Lecture-42 Hammad Khalid Khan.
Chapter 4: Network Layer
CS 3700 Networks and Distributed Systems
Chapter 4: Network Layer
Chapter 4: Network Layer
Chapter 22. Network Layer: Routing
Communication Networks
Delivery, Forwarding, and Routing
Communication Networks
Computer Networks Protocols
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 21 Networking and Internetworking Devices.
Presentation transcript:

Routing Protocols (RIP, OSPF, BGP)

CONTENTS INTRA-DOMAIN AND INTER-DOMAIN ROUTING RIP OSPF BGP

INTRA-DOMAIN AND INTER-DOMAIN ROUTING

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

Figure 13-2 Autonomous systems

1. Distance Vector Routing

Figure 13-3 Example of updating a routing table

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

Final routing tables for the previous figure

Figure 13-12 Hop count

Instability

Solution for Instability 1. Defining Infinity 2. Split horizon

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

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

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

Areas in an autonomous system Figure 13-18 Areas in an autonomous system

Types of links

Figure 13-20 Point-to-point link

Figure 13-21 Transient link

Figure 13-22 Stub link

Figure 13-23 Example of an internet

Graphical representation of an internet Figure 13-24 Graphical representation of an internet

Figure 13-26 Router link

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

Initialization Sharing Updating Loop prevention Policy routing Optimum path

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

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

Network Performance

Congestion Control Categories