module10-rip

module10-rip - Dynamic Routing Protocols I RIP Relates to...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Dynamic Routing Protocols I RIP Relates to Lab 4. The first module on dynamic routing protocols. This module provides an overview of routing, introduces terminology (interdomain, intradomain, autonomous system),
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface of a router (packet forwarding) ? 2. How to find and setup a route ? We already discussed the packet forwarding part There are two approaches for calculating the routing tables: Static Routing Dynamic Routing: Routes are calculated by a routing protocol
Background image of page 2
3 IP Routing TCP Network Interfaces IP Input Queue IP Output: Calculate Next Hop Router ICMP routing daemon Process IP Options For me ? UDP route comman d netstat comman d routing table I C M P R e d ir c t S ou rce outing N O : if f o r w a in g n b le YES
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Autonomous Systems An autonomous system is a region of the Internet that is administered by a single entity. Examples of autonomous regions are: UVA’s campus network MCI’s backbone network Regional Internet Service Provider Routing is done differently within an autonomous system ( intradomain routing ) and between autonomous system (interdomain routing ).
Background image of page 4
5 Autonomous Systems (AS) Ethernet Router Ethernet Ethernet Router Router Ethernet Ethernet Ethernet Router Router Router Autonomous System 2 Autonomous System 1
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Interdomain and Intradomain Routing Intradomain Routing Routing within an AS Ignores the Internet outside the AS Protocols for Intradomain routing are also called Interior Gateway Protocols or IGP’s . Popular protocols are RIP (simple, old) OSPF (better) Interdomain Routing Routing between AS’s Assumes that the Internet consists of a collection of interconnected AS’s Normally, there is one dedicated router in each AS that handles interdomain traffic. Protocols for interdomain routing are also called Exterior Gateway Protocols or EGP’s. Routing protocols: EGP BGP (more recent)
Background image of page 6
7 Components of a Routing Algorithm A procedure for sending and receiving reachability information about network to other routers A procedure for calculating optimal routes Routes are calculated using a shortest path algorithm: Goal : Given a network were each link is assigned a cost. Find the path with the least cost between two networks with minimum cost. A procedures for reacting to and advertising topology changes
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 Approaches to Shortest Path Routing There are two basic routing algorithms found on the Internet. 1. Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends periodically a list of routing updates to its neighbors.
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/05/2012 for the course CS 458 taught by Professor Staff during the Fall '08 term at UVA.

Page1 / 36

module10-rip - Dynamic Routing Protocols I RIP Relates to...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online