CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.

Slides:



Advertisements
Similar presentations
RIP V1 W.lilakiatsakun.
Advertisements

The subnet /28 has been selected to be further subnetted to support point-to-point serial links. What is the maximum number of serial links.
RIP V2 CCNP S1(5), Chapter 4.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
RIP – Routing Information Protocol Syeda Momina Tabish MIT - 7.
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
Routing and Routing Protocols
Routing.
RIP. A PPROACHES TO S HORTEST P ATH R OUTING There are two basic routing algorithms found on the Internet. 1. Distance Vector Routing Each node knows.
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.
Each computer and router interface maintains an ARP table for Layer 2 communication The ARP table is only effective for the broadcast domain (or LAN)
Interior Gateway Protocols: RIP & OSPF
Introduction to Routing and Routing Protocols By Ashar Anwar.
Routing Information Protocol (RIP). Intra-and Interdomain Routing An internet is divided into autonomous systems. An autonomous system (AS) is a group.
M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator Routing.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Sybex CCENT Chapter 8: IP Routing Instructor & Todd Lammle.
1 Chapter Overview Routing Principles Building Routing Tables.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
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.
Cisco – Chapter 11 Routers All You Ever Wanted To Know But Were Afraid to Ask.
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.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
TCP/IP Illustracted Vol1. 제목 : IP Routing ( 수 ) 한 민 규
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 6 Delivery and Routing of IP Packets.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
CS4550 Computer Networks II IP : internet protocol, part 2 : packet formats, routing, routing tables, ICMP read feit chapter 6.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
Objectives After completing this chapter you will be able to: Understand how routers operate Describe Distance Vector and Link State Algorithms Describe.
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.
Routing and Routing Protocols
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
TCP/IP Illustracted Vol1. 제목 : IP Routing ( 수 ) 한 민 규
1 Version 3.1 Module 6 Routed & Routing Protocols.
 RIP — A distance vector interior routing protocol  IGRP — The Cisco distance vector interior routing protocol (not used nowadays)  OSPF — A link-state.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
University of the Western Cape Chapter 12: Routing Protocols Interior and Exterior Routing Protocols Aleksandar Radovanovic.
RIP Routing Protocol. 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.
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.
Malathi Veeraraghavan (originals by Jörg Liebeherr) 1 Link State Routing Algorithm Use a routing protocol to collect the whole network topology Obtain.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Chapter 6 Delivery & Forwarding of IP Packets
Routing Information Protocol (RIP)
Routing and Routing Protocols: Routing Static
COMP 3270 Computer Networks
Chapter 6 – Routing.
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Routing.
Internet Control Message Protocol (ICMP)
Chapter 6 Delivery & Forwarding of IP Packets
Chapter 3: Dynamic Routing
Routing and Routing Protocols: Routing Static
Routing Protocols and Concepts – Chapter 5
Routing Protocols and Concepts – Chapter 5
Routing Protocols and Concepts – Chapter 5
Routing Protocols and Concepts – Chapter 5
Routing.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina

2/12/20042 IP Routing Forward datagrams generated either on local host or on some other hosts toward their ultimate destination Static routing: when network is small, single connection point to other networks, no redundant route existent Dynamic routing: use routing daemon to run routing protocol in order to communicate with other routers

2/12/20043 Routing Principles IP performs three steps when searching its routing table 1. Search for a matching host address 2. Search for a matching network address 3. Search for a default entry

2/12/20044 Initialize a Routing Table Three ways to create routing table entries Created by default when an interface is configured Added by route command Created by an ICMP redirect

2/12/20045 route Command Explicitly add or remove routing table entry from configuration files at bootstrap time

2/12/20046 ICMP Redirect Error Sent by a router to sender of an IP datagram when the datagram should have been sent to a different router Used only when the host has a choice of routers to send its datagram to

2/12/20047 ICMP Redirect type(5)code(0-3) checksum router IP address that should be used IP header + first 8 bytes of original datagram data

2/12/20048 ICMP Router Solicitation type(10)code(0) checksum unused (sent as 0)

2/12/20049 ICMP Router Advertisement type(9)code(0) checksum router address [1] preference level [1] router address [2] preference level [2] … number of addresses address entry size(2) lifetime

2/12/ Routing Protocols Executed by routing daemon to communicate routing information with other routers Two types of routing protocols Distance-vector protocols Link-state protocols

2/12/ Distance-vector Protocols Maintain a vector of distances Each router updates its routing table based on vector of distances received from neighbors Example: RIP

2/12/ Link-state Protocols Each router maintains a complete routing table of the network Example: OSPF

2/12/ Routing Information Protocol (RIP) Most widely used routing protocol Carried in UDP datagrams

2/12/ RIP Message Format command(1-6)version(1) (must be 0) bit IP address (must be 0)address family(2) (must be 0) metric(1-16) (up to 24 more routes) 20 bytes

2/12/ RIP Metrics RIP uses hop count as its metric If there are multiple paths, router chooses the one with smallest hop count, and ignores other paths

2/12/ RIP Operation Initialization Request received Response received Regular routing updates Triggered updates

2/12/ Problems with RIP Has no knowledge about subnet addressing Take long time to stabilize after a router or link failure Maximum of metric limits network size No security protection

2/12/ RIP Version 2 Fix some deficiencies of RIP Support multiple domain Include subnet mask Some simple authentication scheme added

2/12/ RIP-2 Message Format command(1-6)version(2) routing domain bit IP address route tagaddress family(2) 32-bit subnet mask 32-bit next-hop IP address metric(1-16) (up to 24 more routes) 20 bytes

2/12/ Next Class Routing protocols: OSPF, BGP UDP Read TI Ch. 10, 11