The routing table Each node in the network has one or more interfaces with associated costs. The routing table tells IP packets which interface to use,

Slides:



Advertisements
Similar presentations
IP Forwarding Relates to Lab 3.
Advertisements

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
1 ELEN 602 Lecture 20 More on Routing RIP, OSPF, BGP.
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.
1 Internet Networking Spring 2006 Tutorial 3 Ad-hoc networks TBRPF (based on IETF tutorials on TBRPF)
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
CSE 461: Distance Vector Routing. Next Topic  Focus  How do we calculate routes for packets?  Routing is a network layer function  Routing Algorithms.
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Routing in the Internet Internal Routing Protocols.
CCNP Network Route OSPF Part -I OSPF: Open Shortest Path First Concept of OSPF: 1. It is a link state routing protocol. 2. There are basically only 2 ISIS.
Network Redundancy Multiple paths may exist between systems. Redundancy is not a requirement of a packet switching network. Redundancy was part of the.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
1 Routing Protocols. 2 Distributed Routing Protocols Rtrs exchange control info Use it to calculate forwarding table Two basic types –distance vector.
CS 640: Introduction to Computer Networks Aditya Akella Lecture 10 - Intra-Domain Routing.
Intra-Domain Routing D.Anderson, CMU Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)
Chapter 27 sections CS 332 Spring Link-state Routing Q: Could you go over link-state routing (like OSPF)? A: Each router constructs a graph of the.
Routing and Routing Protocols Routing Protocols Overview.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
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 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
1 Chapter Overview Routing Principles Building Routing Tables.
Routers. What is a Router? A multi-port connectivity device Can connect different types of LANs as well as WANS Works at Layer 3 – Network Layer using.
© 1999, Cisco Systems, Inc OSPF Overview RFC 2328, 2178, 1583.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Distance-vector Multicast Routing Protocol (DVMRP)
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
Routing 2 CS457 Fall 2010.
Netprog: Routing and the Network Layer1 Routing and the Network Layer (ref: Interconnections by Perlman)
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.
How to connect to the Internet 1998/12/09 KEIO University, JAPAN Mikiyo
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
1 Version 3.1 Module 6 Routed & Routing Protocols.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
ICC Module 3 Lesson 4 – Networking 1 / 9 © 2015 Ph. Janson Information, Computing & Communication Networking – Clip 6 – Internet addressing School of.
University of the Western Cape Chapter 12: Routing Protocols Interior and Exterior Routing Protocols Aleksandar Radovanovic.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.
Fundamentals of Computer Networks ECE 478/578
TCP/IP (Routing). Content DHCP And Mobile IP Internet Routing Protocol RIP (Routing Information Protocol) OSPF (Open Shortest Path First) BGP (Border.
Malathi Veeraraghavan (originals by Jörg Liebeherr) 1 Link State Routing Algorithm Use a routing protocol to collect the whole network topology Obtain.
1 Most important algorithms! Routing Algorithms Properties Shortest Path Routing Flooding Distance Vector Routing Link State routing Hierarchical routing.
Configuration for routing example
NAT – Network Address Translation
Routing Protocols (RIP, OSPF, BGP)
ICMP ICMP – Internet Control Message Protocol
COMP 3270 Computer Networks
Internet Networking recitation #4
THE NETWORK LAYER.
CS 457 – Lecture 12 Routing Spring 2012.
Routing.
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
RFC 1058 & RFC 2453 Routing Information Protocol
Viet Nguyen Jianqing Liu Yaqin Tang
ECE 544 Project3 Team member.
Figure 6.11 Configuration for Example 4
Routing.
ECE 544 Project3 Dheeraj Medikonda Ravi Chandra Godavarthi 1.
Presentation transcript:

The routing table Each node in the network has one or more interfaces with associated costs. The routing table tells IP packets which interface to use, based on the destination address. A E F C D B

The routing table All we need to do is determine the “best” interface, and configure that in the table. Right? Forwarding Table for A DestCostNext Hop A0A B4B C6E D7B E2E F5E A E F C D B The idea of “best” needs to be consistent on all routers to avoid loops. Figuring out the best route to all routers from all routers is a pain. Routers die, links are cut, people add new stuff without telling you. Try configuring this by hand.this

What routing daemon does Discovers peers (and networks, and borders, and hosts) Sends out information out about its discoveries. Collects information from other routers. Computes routes (paths) in a network (graph). Informs the kernel. A E F C D B ? ? ?

Discovering Peers Routers send broadcast “hello out there” messages out each interface, and listen to replies. In IP land, an IP address with all 1’s for it’s host part of it’s address is a broadcast message (i.e. intended to be interpreted by every host in the network) is an ip address intended for all of the hosts through

Router Name Discovering Peers the Easy Way Router A { A:1 E:1 A:2 F:1 } Router Interface Interface Address Interface Netmask A E F

Our Sockets The router-router socket. –Communication between routers about their link states. –LSU, ACK –See OSPF RFC for many more message types The router-kernel socket. –Communicates with the router’s kernel –NETLINK family specified in socket() call –Add, Delete, Change –Man netlink for other message types

Link down! What if a link goes down? We find out by not hearing from them in a while. Mark the node as down. Send out a link-state update message with an incremented sequence number. Routers will recompute routes.

Link down! A E F C D B Forwarding Table for A DestCostNext Hop A0A B4B C6E D7B E2E F5E Link A-E goes down. We want to tell B and F about this, but what’s our route to F? Solution: use DONTROUTE Sendto() flag.

Link down! A E F C D B Forwarding Table for A DestCostNext Hop A0A B4B C6E D7B E2E F5E Link A-E goes down. We want to tell B and F about this, but what’s our route to F? Solution: use DONTROUTE Sendto() flag.

Link down! A E F C D B Forwarding Table for A DestCostNext Hop A0A B4B C6E D7B E2E F5E Link A-E goes down. We want to tell B and F about this, but what’s our route to F? Solution: use DONTROUTE Sendto() flag.