B3 B1 B7 B2 B5 B4 B6 Which interfaces to keep and which to ignore. Pretend that the objective is to route to root (the one with smallest ID) and use least.

Slides:

Advertisements

Similar presentations

The ETX Objective Function draft-gnawali-roll-etxof-00 ROLL WG IETF 77 - Anaheim, CA 3/22/2010 Omprakash Gnawali and Philip Levis Stanford University.

Advertisements

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.

112/04/2015 Tim Moors Example of the bridge process a b c Stations a, b, c, d are spread about. 1.Bridge tables are initially empty. 2.a sends to d. Flood.

Communication Networks Recitation 3 Bridges & Spanning trees.

4/12/2015© 2009 Raymond P. Jefferis IIILect Internet Protocol - Continued.

Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.

Fundamentals of Computer Networks ECE 478/578 Lecture #13: Packet Switching (2) Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.

Johannes Schneider –1 A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint.

DictionaryADT and Trees. Overview What is the DictionaryADT? What are trees? Implementing DictionaryADT with binary trees Balanced trees DictionaryADT.

Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.

Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.

Making bigger LANs out of small ones What technology is available to us for connecting small LANs together into larger ones?

1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.

IP ROUTING. Content: What is Router? What is Routing? Routing Protocols What is Routing table? What are the Routing table components? What are the Routing.

Least Common Multiple (LCM)

Chap 10 Routing and Addressing Andres, Wen-Yuan Liao Department of Computer Science and Engineering De Lin Institute of Technology

Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.

Chapter 21: IP Encapsulation, Fragmentation & Reassembly

Series and Parallel Circuits How to find the resultant resistance of an electronic circuit.

More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.

An Illustration of Kruskal’s Algorithm Prepared Spring 2006 by Sean Szumlanski Computer Science II, University of Central Florida.

Least Common Multiple (LCM). Let’s Break It Down! Least  Smallest! Common  All numbers have it! Multiple  The product of a quantity! Definition:

TRILL remaining issues Radia Perlman

Distance Vector Local Signpost Direction Distance Routing Table For each destination list: Next Node Distance Table Synthesis Neighbors exchange table.

08 LCM Least Common Multiple

Exam Technique Read the question Highlight the important information! Read the question again Then answer the question Mark a Minute.

JOHN DOE PERIOD 8. AT LEAST 80% OF HUMANITY LIVES ON LESS THAN $10 A DAY.

When finding multiples, you can list all of the products after multiplying it by 1, 2, 3, 4… Finding the Least Common Multiple For example, Multiples.

M. Veeraraghavan 1 Bridge 55 Bridge 41 Bridge LAN A LAN B LAN C EXAMPLE.

Bridges and Extended LANs

Ch. 15 Connecting LANs.

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.

Centralized vs Distributed Routing

Routing Jennifer Rexford.

Least Common Multiple.

A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF.

Presented by Alexei Semenov

(How the routers’ tables are filled in)

Shortest Path from G to C Using Dijkstra’s Algorithm

Dijkstra’s shortest path Algorithm

ECE 544 Protocol Design Project 2016

Routing Protocols and Concepts

TripWire Section Qiuhua Cao April 23, 2004.

Link-State Routing Protocols

Tonga Institute of Higher Education

تعارف. تعارف قواعد العمل ا الموبيل المشروبات الاحاديث الجانبية الاسئلة نفكر.

COS 461: Computer Networks Spring 2013

Least Common Multiple By Monica Yuskaitis.

Link State Route Calculations

Link-State Routing Protocols

STP – Spanning Tree Protocol A closer look

Fractional Exponents CA 2.0.

Announcements Late homework policy New Add Updated on course website

Link State Route Calculations

Scientific Notation M8N1.

Link-State Routing Protocols

Chapter 15. Connecting Devices

Cube Root-Least number

Square root Least number Multiply & Divide.

BGP Instability Jennifer Rexford

Square Least number Add & Subtract.

Bridges Neil Tang 10/10/2008 CS440 Computer Networks.

Engine Part ID Part 1.

A quick way to figure out the number of real roots of an equation

Engine Part ID Part 2.

Engine Part ID Part 2.

COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.

Figure 6.11 Configuration for Example 4

Presentation transcript:

B3 B1 B7 B2 B5 B4 B6 Which interfaces to keep and which to ignore. Pretend that the objective is to route to root (the one with smallest ID) and use least cost with minimum ID to break ties.

B3 B1 B7 B2 B5 B4 B6 2 1*1* (2) B5 has a path that takes one hop to root. B3 has a path that takes 2 hops. B5 also has a path that takes 2 hops, but this doesn’t matter.

B3 B1 B7 B2 B5 B4 B6 2 1*1* (2) B5 has a path that takes one hop to root. B3 has a path that takes 2 hops. B5 also has a path that takes 2 hops, but this doesn’t matter.

B3 B1 B7 B2 B5 B4 B6 1*1* (3) 1 (2) B5 has a path with one hop. B7 has a path with 1 hop, but 5 is less than 7, so 5 gets the route.

B3 B1 B7 B2 B5 B4 B6 2 1

B3 B1 B7 B2 B5 B4 B6 2 1

B3 B1 B7 B2 B5 B4 B6 2 1