UNIT 2 LESSON 8 CS PRINCIPLES. UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send.

Slides:



Advertisements
Similar presentations
Chapter 22 Network Layer: Delivery, Forwarding, and Routing.
Advertisements

Routing Protocol.
Routing Basics By Craig Lindstrom. Overview Routing Process Routing Process Default Routing Default Routing Static Routing Static Routing Dynamic Routing.
© 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 Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 Comnet 2010 Communication Networks Recitation 6 Routing.
Routing and Routing Protocols Introduction to Static Routing.
RD-CSY /09 Distance Vector Routing Protocols.
TNMK09 Computer Networks Copyright © 2005 Di Yuan, ITN, LiTH 1  Non-hierarchical routing, static or dynamic, won’t work in the Internet  None of the.
Routing.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
Introduction of Web programming Ins. Elaf Alhazmi LECTURE 2.
Delivery, Forwarding, and Routing
Routing Protocol Pertemuan 21 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
Routing Protocols Heng Sovannarith
© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—4-1 LAN Connections Exploring the Functions of Routing.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
OSPF To route, a router needs to do the following: Know the destination address Identify the sources it can learn from Discover possible.
Analysis of RIP, OSPF, and EIGRP Routing Protocols using OPNET Group 5: Kiavash Mirzahossein Michael Nguyen Sarah Elmasry
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)
CS 453 Computer Networks Lecture 24 IP Routing. See…
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Chapter 4: Managing LAN Traffic
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
6: Routing Working at a Small to Medium Business.
Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Common Devices Used In Computer Networks
10/8/2015CST Computer Networks1 IP Routing CST 415.
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
© 2002, Cisco Systems, Inc. All rights reserved..
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
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.
Distance Vector Routing Protocols Dynamic Routing.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Routing Algorithms Lecture Static/ Dynamic, Direct/ Indirect, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.0 Module 9 Basic Router Troubleshooting.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Networks DEVICES. Repeater device to amplify or regenerate digital signals received while setting them from one part of a network into another. Works.
Day 13 Intro to MANs and WANs. MANs Cover a larger distance than LANs –Typically multiple buildings, office park Usually in the shape of a ring –Typically.
Submitted by : yateendra sahu Et&T 7 th B R/N :
© 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.
Working at a Small-to-Medium Business or ISP – Chapter 6
Chapter 6 Delivery & Forwarding of IP Packets
Routing Information Protocol (RIP)
COMP 3270 Computer Networks
What is a router? A router is a device that connects multiple computers together. Not to be confused with a switch Routers transmit packets of data across.
Net 323 D: Networks Protocols
Working at a Small-to-Medium Business or ISP – Chapter 6
Net 323 D: Networks Protocols
(How the routers’ tables are filled in)
Delivery, Forwarding, and Routing
Delivery and Routing of IP Packets
UNICAST ROUTING PROTOCOLS
Link-State Routing Protocols
Intradomain Routing Outline Introduction to Routing
Dynamic Routing and OSPF
Link-State Routing Protocols
Communication Networks
Working at a Small-to-Medium Business or ISP – Chapter 6
ECE 544 Project3 Team member.
Communication Networks
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
OSPF Protocol.
Presentation transcript:

UNIT 2 LESSON 8 CS PRINCIPLES

UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send packets. Simulate the job of a router. Develop a router table to efficiently transmit packets from one destination to another across the Internet.

ROUTERS Routers, like many systems on the Internet, are governed by protocols. In order to determine where a packet should be sent so that it can reach its desired destination, the router uses a static or dynamic routing protocol such as Routing Information Protocol (RIP) or Open Shortest Path First (OSPF), which both create and maintain a routing table.

ROUTERS (CONT) Routers are only able to communicate with their directly connected neighbors, so in order to generate an efficient table for sending packets they communicate with their neighbors, comparing who has the best way to reach a particular destination. As routers learn about more paths, they are able to share this information with their neighbors to help update and maintain their routing tables.

HOW DOES A ROUTER LEARN WHICH WAY TO ROUTE PACKETS? A router is connected to a few other routers but the Internet is much bigger. If a packet is supposed to get to destination X, but the router is only connected to other routers A, B, and C, how do you know which one you should forward the packet to in order to reach X as fast as possible? There might be a lot of Internet between you, your neighbors, and X. Even though the cost or distance to your neighbor B might be the greatest of your other neighbors, you can’t know what lies beyond B. It might be the best way to send traffic to X, but how can you know?

HOW DOES A ROUTER LEARN WHICH WAY TO ROUTE PACKETS? Like the problems we considered yesterday, a router wants to find the shortest path through the network to any possible location on the Internet. Unlike the algorithm from yesterday, today we recognize that a router cannot see how the entire network is connected ahead of time; not only is this not possible because the Internet is too big, but also the network changes all the time, new routers come online, cables get cut accidentally, etc. Instead, a router can only observe traffic between it and its direct connections. The question, then, is how can a router learn about the network in order to optimally route packets?

IMPORTANCE OF ORDER: If tables are immobile, it is sufficient to create circles of chairs. This activity relies on each student communicating with a specific set of individuals. The activity guides are designed with the assumption that students will be sitting in alphabetical order, and the lesson will be much harder to facilitate if this not the case.

GROUPS OF EIGHT: This activity has been designed with eight routers, because that’s enough to make the shortest paths between nodes interesting and to give students an idea of the kind of interactions that routers have. Using the current set of routers and costs, all students will find that there is a more efficient route between themselves and one of their neighbors than through the direct connection. With smaller groups, these connections are much more subtle to the student.