Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 Initialization.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "1 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 Initialization."— Presentation transcript:

1 1 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 Initialization

2 2 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 Direct Neighbours

3 3 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 11 3 3 Neighbours of neighbours

4 4 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 11 3 3 13 Neighbours of neighbours

5 5 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 11 3 3 13 Stable convergence

6 6 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 11 3 3 13 1 Good news: A new link!

7 7 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 11 3 3 1 13 1 1 Direct endpoints know

8 8 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 4 2 2 2 2 2 2 1 3 3 3 3 3 3 1 3 1 3 1 Neighbours know

9 9 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 4 1 4 2 2 2 2 2 2 1 3 3 3 3 3 3 1 3 1 3 1 Neighbours of neighbours know

10 10 1 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 4 1 4 2 2 2 2 2 2 1 3 3 3 3 3 3 1 3 1 3 1 A happy and stable network

11 11 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 4 1 4 2 2 2 2 2 2 1 3 3 3 3 3 3 1 3 1 3 Bad news: Link crash!!

12 12 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 4 1 2 2 2 2 2 2 1 3 3 3 3 3 3 Direct endpoints know

13 13 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 4 1 2 2 2 2 2 2 1 3 3 3 3 3 3

14 14 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 4 1 2 2 2 2 2 2 1 3 3 3 3 3 3 5 13 11 13 Get help from neighbours

15 15 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 4 1 2 2 2 2 2 2 1 3 3 3 3 7 7 5 13 11 13 Routing loop (due to inconsistent state info)

16 16 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 8 1 2 2 2 2 2 2 1 3 3 3 3 7 7 9 13 11 13

17 17 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 8 1 2 2 2 2 2 2 1 3 3 3 3 11 10 9 13 11 13 Counting to infinity…

18 18 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 3 3 11 10 13 11 13

19 19 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 3 3 11 13 10 13 11 13

20 20 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 1 2 2 2 2 2 2 1 3 3 3 3 11 13 10 13 11 13 Stability again

Download ppt "1 1 10 2 2 2 A B C E D A C E B D A C E B D A C E B D A C E B D A C E B D 0 0 0 0 0 Initialization."

Similar presentations

Distance Vector Routing Protocols

Distance Vector Routing Protocols
Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.

Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Copyright 2008 Kenneth M. Chipps Ph.D. www.chipps.com Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 4 Distance Vector Routing Protocols.

Copyright 2008 Kenneth M. Chipps Ph.D. Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 4 Distance Vector Routing Protocols.
Courtesy: Nick McKeown, Stanford

Courtesy: Nick McKeown, Stanford
Improved BGP convergence via Ghost Flushing Yehuda Afek Anat Bremler-Barr Shemer Schwarzd המרכז הבינתחומי הרצליה.

Improved BGP convergence via Ghost Flushing Yehuda Afek Anat Bremler-Barr Shemer Schwarzd המרכז הבינתחומי הרצליה.
Berkeley slides were used for this tutorial 1 Internet Networking Spring 2003 Tutorial 3 DUAL Algorithm.

Berkeley slides were used for this tutorial 1 Internet Networking Spring 2003 Tutorial 3 DUAL Algorithm.
CIS 235: Networks Fall, 2007 Western State College Computer Networks Fall, 2007 Prof Peterson.

CIS 235: Networks Fall, 2007 Western State College Computer Networks Fall, 2007 Prof Peterson.
LSRP: Local Stabilization in Shortest Path Routing Hongwei Zhang and Anish Arora Presented by Aviv Zohar.

LSRP: Local Stabilization in Shortest Path Routing Hongwei Zhang and Anish Arora Presented by Aviv Zohar.
Summary The Problem The Dijkstra’s Shortest Path Algorithm

Summary The Problem The Dijkstra’s Shortest Path Algorithm
Distance-Vector Routing COS 461: Computer Networks Spring 2010 (MW 3:00-4:20 in COS 105) Michael Freedman

Distance-Vector Routing COS 461: Computer Networks Spring 2010 (MW 3:00-4:20 in COS 105) Michael Freedman
Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer The service should be independent of the router.

Network Layer Design Isues Store-and-Forward Packet Switching Services Provided to the Transport Layer The service should be independent of the router.
Chapter 4 IP Routing Professor Rick Han University of Colorado at Boulder

Chapter 4 IP Routing Professor Rick Han University of Colorado at Boulder
131.123.247.253 -> 131.123.246.52 -> 131.123.11.254 131.123.8.1 131.123.11.254 131.123.247.253 131.123.246.52.

> >
CCNA 2 v3.1 Module 7.

CCNA 2 v3.1 Module 7.
RD-CSY2001-08/09 Distance Vector Routing Protocols.

RD-CSY /09 Distance Vector Routing Protocols.
4: Network Layer4a-1 Miscellaneous Last Modified: 6/28/2015 7:54:21 PM.

4: Network Layer4a-1 Miscellaneous Last Modified: 6/28/2015 7:54:21 PM.
1 Computer Networks Routing Algorithms. 2 IP Packet Delivery Two Processes are required to accomplish IP packet delivery: –Routing discovering and selecting.

1 Computer Networks Routing Algorithms. 2 IP Packet Delivery Two Processes are required to accomplish IP packet delivery: –Routing discovering and selecting.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Distance Vector Routing.

© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Distance Vector Routing.
Distance Vector Routing Protocols Distance Vector Routing.

Distance Vector Routing Protocols Distance Vector Routing.
Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)

Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)

Similar presentations

Ads by Google