Lecture 13 review Explain how distance vector algorithm works.

Slides:



Advertisements
Similar presentations
1 Routing Protocols I. 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.
Advertisements

Vector: Data Layout Vector: x[n] P processors Assume n = r * p
Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 21 Networking and Internetworking Devices.
ENGS Assignment 2 ENGS 4 - Lecture 8 Technology of Cyberspace Winter 2004 Thayer School of Engineering Dartmouth College Assignment 2 – Due Friday,
1 Dr. Xiao Qin Auburn University Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover.
> >
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.
04/05/20011 ecs298k: Routing in General... lecture #2 Dr. S. Felix Wu Computer Science Department University of California, Davis
EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.
CSE123A discussion session 2007/03/08 Ryo Sugihara.
1 times table 2 times table 3 times table 4 times table 5 times table
Routing Protocols Heng Sovannarith
© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—4-1 LAN Connections Exploring the Functions of Routing.
Connecting Networks © 2004 Cisco Systems, Inc. All rights reserved. Exploring How Routing Works INTRO v2.0—4-1.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Link-State and Balanced Hybrid Routing.
1 Message Routing Administration Routing Group Planning Connecting Routing Groups Link Status Information.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Link State Routing Protocols Last Update Copyright Kenneth M. Chipps Ph.D.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Distance Vector Routing 박주호. Introduction.  Modern computer Network generally use Dynamic routing algorithms rather than The.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
Distance Vector Routing Protocols Routing Protocols and Concepts Lecture Week 4.
CIS 725 Network Layer. This layer provides communication between any two nodes Uniform addressing scheme independent of the network technology Network.
Chapter 11 Networking and Internetworking Devices BY Dr.Sukchatri Prasomsuk.
ITI-510 Computer Networks ITI 510 – Computer Networks Meeting 3 Rutgers University Internet Institute Instructor: Chris Uriarte.
Network Layer4-1 Distance Vector: link cost changes Link cost changes: r node detects local link cost change r updates distance table (line 15) r if cost.
Distance Vector Local Signpost Direction Distance Routing Table For each destination list: Next Node Distance Table Synthesis Neighbors exchange table.
Distance Vector Routing Protocols Dynamic Routing.
Lecture #3 OSPF Asst.Prof. Dr.Anan Phonphoem Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Bangkok, Thailand.
Distance-Vector Routing Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki
Networking and internetworking devices. Repeater.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Routing Protocols Brandon Wagner.
Ch 22. Routing Direct and Indirect Delivery.
Tables Learning Support
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Routing algorithms. D(v): the cost from the source node to destination that has currently the least cost. p(v): previous node along current least.
1 Most important algorithms! Routing Algorithms Properties Shortest Path Routing Flooding Distance Vector Routing Link State routing Hierarchical routing.
IT 242 Week 6 CheckPoint Static or Dynamic To purchase this material link CheckPoint-Static-or-Dynamic.
Pertemuan 23 IP Routing Protocols
Instructor Materials Chapter 5: Dynamic Routing
Mutual inconsistency Due to the possible breakdown of the communication links, the system can be divided into several sub-systems (or sub-networks). There.
Routing Protocols and Concepts
COMP 3270 Computer Networks
Link-State Routing Protocols
Times Tables.
SEEM5770/ECLT5840 Course Review
THE NETWORK LAYER.
Routing: Distance Vector Algorithm
Working at a Small-to-Medium Business or ISP – Chapter 6
Chapter 5: Dynamic Routing
CHAPTER 10.
Link-State Routing Protocols
After 3.2 Revised
Intradomain Routing Outline Introduction to Routing
Routing Algorithms Problems
Chapter 22. Network Layer: Routing
Link-State Routing Protocols
Advanced Computer Networks
Algorithms Lecture #19 Dr.Sohail Aslam.
3 times tables.
6 times tables.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 21 Networking and Internetworking Devices.
OSPF Protocol.
Presentation transcript:

Lecture 13 review Explain how distance vector algorithm works. Explain how link state algorithm works. Assuming that the routing algorithm has reached the steady state for the following network. In the next routing information exchange, what will A receive with distance vector algorithm? what about with link state algorithm? 2 A B 1 3 E C 10 D 20

Lecture 13 review Assuming that A received from B, and E the following distance vectors, what will its routing table in the next step? 2 A B 1 3 B E A 100 300 B 0 0.5 C 200 50 D 30 20 E 5000 0 E C 10 D 20