Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.

Slides:



Advertisements
Similar presentations
Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Advertisements

Chapter 22 Network Layer: Delivery, Forwarding, and Routing.
Computer Networks with Internet Technology William Stallings
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
What is “Routing”? Routing algorithm that part of the network layer responsible for deciding on which output line to transmit an incoming packet Adaptive.
Networks: Routing1 Network Layer Routing. Networks: Routing2 Network Layer Concerned with getting packets from source to destination Network layer must.
EEC-484/584 Computer Networks Lecture 10 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 22 Introduction to Computer Networks.
CCNA 2 v3.1 Module 6.
Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer The service should be independent of the router.
Routing and Routing Protocols
EEC-484/584 Computer Networks Lecture 10 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.
Networks: Routing1 Network Layer Routing. Networks: Routing2 Network Layer Concerned with getting packets from source to destination. The network layer.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Subnets Routing within an Organization. Subnet  Subnets are a subset of the entire network Networks can be divided into subnets Subnets can be divided.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
CS 453 Computer Networks Lecture 24 IP Routing. See…
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
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.
Introduction to networking Dynamic routes. Objectives  Define dynamic routing and its properties  Describe the classes of routing protocols  Describe.
Introduction to Routing and Routing Protocols By Ashar Anwar.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Distance Vector Routing 박주호. Introduction.  Modern computer Network generally use Dynamic routing algorithms rather than The.
Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.
University of the Western Cape Chapter 11: Routing Aleksandar Radovanovic.
Routing Protocols RIP, OSPF, BGP. A Routing Protocol’s Job Is to Find a “Best” Path between Any Pair of Nodes Routers in a network exchange their routing.
Routing and Routing Protocols Routing Protocols Overview.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Understanding Routing. Agenda What Is Routing? Network Addressing Routing Protocols.
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:
CCNA 1 Module 10 Routing Fundamentals and Subnets.
1 Computer Networking Dr. Mohammad Alhihi Communication and Electronic Engineering Department Philadelphia University Faculty of Engineering.
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)
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
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.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Network Layer4-1 Distance Vector Algorithm Bellman-Ford Equation (dynamic programming) Define d x (y) := cost of least-cost path from x to y Then d x (y)
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
Objectives After completing this chapter you will be able to: Understand how routers operate Describe Distance Vector and Link State Algorithms Describe.
Distance Vector Routing
EEC-484/584 Computer Networks Lecture 10 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Network Layer4-1 Datagram networks r no call setup at network layer r routers: no state about end-to-end connections m no network-level concept of “connection”
Routing and Routing Protocols
TELE202 Lecture 6 Routing in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »Packet switching in Wide Area Networks »Source: chapter 10 ¥This Lecture.
1 Version 3.1 Module 6 Routed & Routing Protocols.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Shortest Path Algorithm
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Routing Protocols Brandon Wagner.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
Network Layer (2). Review Physical layer: move bits between physically connected stations Data link layer: move frames between physically connected stations.
Distance Vector Routing
Distance Vector and Link State Routing Pragyaditya Das.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
Link-State Routing Protocols
CS 1302 Computer Networks — Unit - 3 — — Network Layer —
THE NETWORK LAYER.
Binary Lesson 5 Classful IP Addresses
CHAPTER 10.
EEC-484/584 Computer Networks
Link-State Routing Protocols
Link-State Routing Protocols
5 THE NETWORK LAYER 5.1 NETWORK LAYER DESIGN ISSUES
Data Communication: Routing algorithms
OSPF Protocol.
Presentation transcript:

Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used in early versions of ARPANET and in Internet (RIP), DECnet,, AppleTalk and Cisco. Each router maintains a table (i.e. a vector) indexed by, and containing one entry for each router in the subnet. The entry contains the preferred outgoing line for this destination and an estimate giving the best known distance to that destination (# of hops, time delay, etc.).  Once every T msec each router sends to (and receives from) each neighbor a list of estimated distance to each destination. The router recalculates the distances. 2 1

Stainov - DataComMET CS TC5354 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Count-to-Infinity Problem - the distance vector routing propagates the good news, but leisurely to the bad news.

Stainov - DataComMET CS TC5355 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Link State Routing (Second Generation in ARPANET) - the first generation did not consider the speed, but only the queue length, and took too long to converge. 1. Discover its neighbors and learn their network addresses. 2. Measure the delay or cost to each of its neighbors (e.g. by ECHO packets)  measure RTT/2 and calculate only the queue delay (to avoid load oscillation) or both, the queue delay and the communication load transformed to "link utilization". 3. Construct a packet telling all it has just learned, and send the packet to all routers. 4. Compute the shortest path to every other router.  The complete topology and all delays are experimentally measured and distributed to every router.

Stainov - DataComMET CS TC INTERNET: Subnets a. The classic (and externally transparent) IP address: b. Internal structuring of the IP address: For example are the first 8 bits (= 1 byte) the host ID. The 3 high order bits can be used as subnet ID. It means, 2 8 = 256 host addresses are divided into 2 3 = 8 subnets with 2 5 = 32 host addresses each. How many bits are to be used for the subnet ID is specified by the subnet mask. Example: The subnet mask , of a C class address means, that the three high order bits in the first byte are used for subnet IDs: » Net-IDSubnet-IDHost-ID Net-IDHost-ID

Stainov - DataComMET CS TC53541 Internetworking IP Routing Example