COS 420 Day 17. Agenda Finished Grading Individualized Projects Very large disparity in student grading No two students had same ranking for other students.

Slides:



Advertisements
Similar presentations
Karlston D'Emanuele Distance Vector Routing Protocols Notes courtesy of Mr. Joe Cordina Password Removed
Advertisements

RIP V2 CCNP S1(5), Chapter 4.
Computer Networks with Internet Technology William Stallings
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
The University of Sydney 1 Routing Architecture and Protocols NETS3303/3603 Week 6.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Nov 04, 2004CS573: Network Protocols and Standards1 IP Routing: GGP and RIP Network Protocols and Standards Autumn
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
CS335 Networking & Network Administration Tuesday, May 18, 2010.
RFC 2453 RIP 2 (Routing Information Protocol) Daher Kaiss.
COS 420 Day 16. Agenda Finish Individualized Project Please Have Grading sheets to me by Tomorrow Group Project Discussion Assignment 3 moved back to.
Routing and Routing Protocols
Routing.
COS 420 Day 13. Agenda Assignment 3 Posted Covers chapters Due March 23 2 Days till Daytona Beach Bike Week Midterm Exam is Due Today Today we will.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Routing in the Internet Internal Routing Protocols.
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.
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.
ROUTING BASICS. Why are Routers Necessary? One of the key components of the technical infrastructure of the network One of the key components of the technical.
Interior Gateway Protocols: RIP & OSPF
1 CSCI 233 Internet Protocols Class 6 Dave Roberts.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
Guide to TCP/IP, Second Edition1 Guide To TCP/IP, Second Edition Chapter 10 Routing In The IP Environment.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
CCNA Guide to Cisco Networking Chapter 8: Routing Protocols and Network Address Translation.
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
CN2668 Routers and Switches Kemtis Kunanuraksapong MSIS with Distinction MCTS, MCDST, MCP, A+
Routing and Routing Protocols Routing Protocols Overview.
1 Chapter Overview Routing Principles Building Routing Tables.
Sybex CCNA Chapter 6: IP Routing Instructor & Todd Lammle.
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
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)
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Guide to TCP/IP, Third Edition Chapter 10: Routing in the IP Environment.
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
10/19/2015CST Computer Networks1 RIP - OSPF CST 415.
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 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
Distance Vector Routing Protocols Routing Protocols and Concepts Lecture Week 4.
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.
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Routing and Routing Protocols
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
Routing Protocols Brandon Wagner.
Routing: In an Autonomous System Chapter 16. Introduction How does a router in an Autonomous System learn about other networks within its AS? –In an internet.
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.
Prof. Alfred J Bird, Ph.D., NBCT Office – Science 3rd floor – S Office Hours – Monday and Thursday.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
+ Dynamic Routing Protocols 2 nd semester
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Routing Protocols (RIP, OSPF, BGP)
OSPF (Open Shortest Path First)
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Routing.
Dynamic Routing and OSPF
Routing.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

COS 420 Day 17

Agenda Finished Grading Individualized Projects Very large disparity in student grading No two students had same ranking for other students Final Project Grades 2 A’s and 2 B’s Group Project Discussion Program Requirements DUE by Midnight Assignment 3 moved back to April 8 There may not be an assignment 5 Today we will discuss Interior Routing protocols

Project 2 Grading Meeting Timelines 10% Deliverables Programs requirements Due Today 15% Protocol Definition Due April 12 15% Working Network Application Due May 4 25% Final Paper Due April 29 25% User Manual Protocol Program requirements Technical Specifications Presentation Due May 4 10%

PART XVI ROUTING: INSIDE AN AUTONOMOUS SYSTEM (RIP, OSPF, HELLO)

Static Vs. Dynamic Interior Routes Static routes Initialized at startup Never change Typical for host Sometimes used for router Dynamic router Initialized at startup Updated by route propagation protocols Typical for router Sometimes used in host

Illustration Of Topology In Which Static Routing Is Optimal

Illustration Of Topology In Which Dynamic Routing Is Needed

Exchanging Routing Information Within An Autonomous System Mechanisms called interior gateway protocols, IGPs Choice of IGP is made by autonomous system Note: if AS connects to rest of the world, a router in the AS must use an EGP to advertise network reachability to other autonomous systems.

Example Of Two Autonomous Systems And the Routing Protocols Used

Example IGPs RIP HELLO OSPF Many Others

Routing Information Protocol (RIP) Implemented by UNIX program routed Uses hop count metric Distance-vector protocol Relies on broadcast Assumes low-delay local area network Uses split horizon and poison reverse techniques to solve inconsistencies Current standard is RIP2

Two Forms Of RIP Active Form used by routers Broadcasts routing updates periodically Uses incoming messages to update routes Passive Form used by hosts Uses incoming messages to update routes Does not send updates

Illustration Of Hosts Using Passive RIP

RIP Operation Each router sends update every 30 seconds Update contains pairs of (destination address, distance) Distance of 16 is infinity (i.e., no route)

Slow Convergence Problem (Slow Count To Infinity)

Fixing Slow Convergence Use technique know as Split-horizon update Cannot announce routes to networks from same interface you got route information from Use technique know as Poison-reverse update If a router notices a connection is down, advertise an infinity cost to that network

Rip Update Format Uses family field to support multiple protocols IP address sent in octets of address field Message travels in UDP datagram (uses UDP LEN)

Changes To RIP In Version 2 Update includes subnet mask Authentication supported Explicit next-hop information Messages can be multicast (optional) IP multicast address is

RIP2 Update Format Packet format is backward compatible Infinity still limited to 16 RIP2 can be broadcast Route Tag identifies originator

Measures Of Distance That Have Been Used Hops Zero-origin One-origin (e.g., RIP) Delay Throughput Jitter

HELLO: A Protocol That Used Delay Developed by Dave Mills Measured delay in milliseconds Used by NSFNET fuzzballs A specially configured PDP11 computer made by DEC (16-bit) 11/Fuzzball/fuzz.txt 11/Fuzzball/fuzz.txt Now historic

How HELLO Worked Participants kept track of delay between pairs of routers HELLO propagated delay information across net Route chosen to minimize total delay

Route Oscillation Effective delay depends on traffic (delay increases as traffic increases) Using delay as metric means routing traffic where delay is low Increased traffic raises delay, which means route changes Routes tend to oscillate

Why HELLO Worked HELLO used only on NSFNET backbone All paths had equal throughput Route changes damped to avoid oscillation

Open Shortest Path First (OSPF) Developed by IETF in response to vendors’ proprietary protocols Uses SPF (link-state) algorithm More powerful than most predecessors Permits hierarchical topology More complex to install and manage

OSPF Features Type of service routing Load balancing across multiple paths Networks partitioned into subsets called areas Message authentication Network-specific, subnet-specific, host-specific, and CIDR routes Designated router optimization for shared networks Virtual network topology abstracts away details Can import external routing information

OSPF Message Header

OSPF Message Types

OSPF HELLO Message Format Field descriptions on Page 311

OSPF Database Description Message Format Field descriptions on Page 311 & 312

Values In The LINK Field

OSPF Link Status Request Message Format

OSPF Link Status Update Message Format

Header Used In OSPF Link Status Advertisements Four possible formats follow Links from a router to given area Links from a router to physical net Links from a router to physical nets of a subnetted IP network Links from a router to nets at other sites

Discussion Question What are the tradeoffs connected with the issue of routing in the presence of partial information?

Summary Interior Gateway Protocols (IGPs) used within an AS Popular IGPs include RIP (distance vector algorithm) OSPF (link-state algorithm)