Dynamic Routing Protocols Why Dynamic Routing Protocols? –Each router acts independently, based on information in its router forwarding table –Dynamic.

Slides:



Advertisements
Similar presentations
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
Advertisements

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Chapter 5 – TCP/IP: Routing – Part 2 Dr. V.T. Raja Oregon State University.
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
Routing Fundamentals and Subnetting
Unicast Routing Protocols: RIP, OSPF, and BGP
© 2009 Pearson Education, Inc. Publishing as Prentice Hall More on TCP/IP Module A Updated January 2009 Raymond Panko’s Business Data Networks and Telecommunications,
Chapter 5 – TCP/IP: Routing – Part 2 Dr. V.T. Raja Oregon State University.
Routing.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Routing in the Internet Internal Routing Protocols.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
Distance Vector Routing Protocols Distance Vector Routing.
Chapter 8 Routing. Introduction Look at: –Routing Basics (8.1) –Address Resolution (8.2) –Routing Protocols (8.3) –Administrative Classification (8.4)
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Dr. John P. Abraham Professor University of Texas Pan American Internet Routing and Routing Protocols.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
CS 4396 Computer Networks Lab
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Routing and Routing Protocols Routing Protocols Overview.
Introduction to Dynamic Routing Protocol
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
1 Routing. 2 Routing is the act of deciding how each individual datagram finds its way through the multiple different paths to its destination. Routing.
1 3-Oct-15 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
More on TCP/IP Module A Panko’s Business Data Networks and Telecommunications, 6th edition Copyright 2007 Prentice-Hall May only be used by adopters of.
Module A Panko and Panko Business Data Networks and Telecommunications, 8 th Edition © 2011 Pearson Education, Inc. Publishing as Prentice Hall.
10/8/2015CST Computer Networks1 IP Routing CST 415.
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 13 Routing Protocols (RIP, OSPF, BGP)
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
Page 110/27/2015 A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols.
CCNA 1 v3.0 Module 10 Routing Fundamentals and Subnets.
1 1-Dec-15 S Ward Abingdon and Witney College Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
1 12-Jan-16 OSI network layer CCNA Exploration Semester 1 Chapter 5.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Routing Protocols COSC 541 Data Commun. System & Networks Yue Dou.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
1 INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is referred.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
1. 2  An autonomous system is a region of the Internet that is administered by a single entity.  Examples of autonomous regions are:  UVA’s campus.
Cisco 2 - Routers Perrine modified by Brierley Page 13/21/2016 Chapter 4 Module 6 Routing & Routing Protocols.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
Computer Networks Routing Algorithms.
CMPT 371 Data Communications and Networking Routing in the Internet
COMP 3270 Computer Networks
More on TCP/IP Module A Copyright 2004 Prentice Hall Panko’s Business Data Networking and Telecommunications, 5th edition.
Introduction To Networking
Module A Updated January 2009
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Routing.
Dynamic Routing Protocols
After 3.2 Revised
Routing Fundamentals and Subnets
Dynamic Routing Protocols
Working at a Small-to-Medium Business or ISP – Chapter 6
COMPUTER NETWORKS CS610 Lecture-41 Hammad Khalid Khan.
Distance Vector Routing
Routing.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

Dynamic Routing Protocols Why Dynamic Routing Protocols? –Each router acts independently, based on information in its router forwarding table –Dynamic routing protocols allow routers to share information in their router forwarding tables Router Forwarding Table Data

Routing Information Protocol (RIP) Routing Information protocol (RIP) is the simplest dynamic routing protocol –Each router broadcasts its entire routing table frequently –Broadcasting makes RIP unsuitable for large networks Routing Table

Routing Information Protocol (RIP) RIP is the simplest dynamic routing protocol –Broadcasts go to hosts as well as to routers –RIP interrupts hosts frequently, slowing them down; Unsuitable for large networks Routing Table

Routing Information Protocol (RIP) RIP is Limited –RIP routing table has a field to indicate the number of router hops to a distant host –The RIP maximum is 15 hops –Farther networks are ignored –Unsuitable for very large networks Hop

Routing Information Protocol Is a Distance Vector Protocol –“New York” starts, announces itself with a RIP broadcast –“Chicago” learns that New York is one hop away –Passes this on in its broadcasts New YorkChicagoDallas 1 hop NY is 1

Routing Information Protocol Learning Routing Information –“Dallas” receives broadcast from Chicago –Already knows “Chicago” is one hop from Dallas –So New York must be two hops from Dallas –Places this information in its routing table New YorkChicagoDallas 1 hop NY is 1 NY is 2

Routing Information Protocol Slow Convergence –Convergence is getting correct routing tables after a failure in a router or link –RIP converges very slowly –May take minutes –During that time, many packets may be lost

Routing Information Protocol Encapsulation –Carried in data field of UDP datagram Port number is 520 –UDP is unreliable, so RIP messages do not always get through –A single lost RIP message does little or no harm UDP Header UDP Data Field RIP Message

OSPF Routing Protocol Link State Protocol –Link is connection between two routers –OSPF routing table stores more information about each link than just its hop count: cost, reliability, etc. –Allows OSPF routers to optimize routing based on these variables Link

OSPF Routers Network is Divided into Areas –Each area has a designated router Area Designated Router

OSPF Routers When a router senses a link state change –Sends this information to the designated router Area Designated Router Notice of Link State Change

OSPF Routers Designed Router Notifies all Routers –Within its area Area Designated Router Notice of Link State Change

OSPF Routers Efficient –Only routers are informed (not hosts) –Usually only updates are transmitted, not whole tables Area Designated Router Notice of Link State Change

OSPF Fast Convergence –When a failure occurs, a router transmits the notice to the designated router –Designated router send the information back out to other routers immediately

OSPF Encapsulation –Carried in data field of IP packet Protocol value is 89 –IP is unreliable, so OSPF messages do not always get through –A single lost OSPF message does little or no harm IP Header IP Data Field OSPF Message

Selecting RIP or OSPF Within a network you control, it is your choice –Your network is an autonomous system –Select RIP or OSPF based on your needs –Interior routing protocol

Selecting RIP or OSPF RIP is fine for small networks –Easy to implementing –15 hops is not a problem –Broadcasting, interrupting hosts are not too important

Selecting RIP or OSPF OSPF is Scalable –Works with networks of any size –Management complexities are worth the cost in large networks

Border Gateway Protocol (BGP) To connect different autonomous systems –Must standardize cross-system routing information exchanges –BGP is most popular today –Gateway is the old name for router –Exterior routing protocol Autonomous System Autonomous System BGP

Border Gateway Protocol (BGP) Distance vector approach –Number of hops to a distant system is stored in the router forwarding table Normally only sends updates Autonomous System Autonomous System BGP

Border Gateway Protocol (BGP) Encapsulation –BGP uses TCP for delivery –Reliable –TCP is only for one-to-one connections –If have several external routers, must establish a TCP and BGP connection to each Autonomous System Autonomous System BGP