All Rights Reserved © Alcatel-Lucent 2006, ##### 1 | Presentation Title | Month 2006 Router A Router B OSPF Hdr: Session ID = X1; Nonce = N1 OSPF HELLO:

Slides:



Advertisements
Similar presentations
The Derivative in Graphing and Application
Advertisements

Chances Are… You can do it! Activity #5 Five baseball players threw their caps into a sports bag after a ball game. What is the probability that each.
Maximal Independent Subsets of Linear Spaces. Whats a linear space? Given a set of points V a set of lines where a line is a k-set of points each pair.
BASED ON THE TUTORIAL ON THE BOOK CD Verilog: Gate Level Design 6/11/
Inverting a Singly Linked List Instructor : Prof. Jyh-Shing Roger Jang Designer : Shao-Huan Wang The ideas are reference to the textbook “Fundamentals.
2 x0 0 12/13/2014 Know Your Facts!. 2 x1 2 12/13/2014 Know Your Facts!
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Link-State Routing Protocols Routing Protocols and Concepts – Chapter.
OSPF Header OSPF HEADER OSPF HEADER for this project Types we will use
Handshake Protocols COEN 350. Simple Protocol Alice: Hi, I am Alice. My password is “fiddlesticks”. Bob: Welcome, Alice.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Link State Routing Jean-Yves Le Boudec Fall
5 x4. 10 x2 9 x3 10 x9 10 x4 10 x8 9 x2 9 x4.
Computational Facility Layout
IPv6 EIGRP John Rullan Cisco Certified Instructor Trainer Thomas A. Edison CTE HS Stephen Lynch Network Architect, CCIE #36243 ABS Technology Architects.
Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Network Layer Packet Forwarding IS250 Spring 2010
1 © 2003, Cisco Systems, Inc. All rights reserved. Computer Networks 6 Layer 3 troubleshooting Halmstad University Olga Torstensson
1 ELEN 602 Lecture 20 More on Routing RIP, OSPF, BGP.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
CSEE W4140 Networking Laboratory Lecture 5: IP Routing (OSPF and BGP) Jong Yul Kim
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Configuring and Verifying.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
Routing Protocols Heng Sovannarith
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
CCNP Network Route OSPF Part -I OSPF: Open Shortest Path First Concept of OSPF: 1. It is a link state routing protocol. 2. There are basically only 2 ISIS.
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.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
Dynamic Routing Protocols Why Dynamic Routing Protocols? –Each router acts independently, based on information in its router forwarding table –Dynamic.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Ogier - 1 OSPF Database Exchange Summary List Optimization draft-ietf-ospf-dbex-opt-00.txt Richard Ogier Presented by Acee Lindem March 19, 2007 IETF 68.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
Simulation of the OLSRv2 Protocol First Report Presentation.
Copyright 1999, S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 34 Routing Algorithms Ref: Tanenbaum pp ;
 Development began in 1987  OSPF Working Group (part of IETF)  OSPFv2 first established in 1991  Many new features added since then  Updated OSPFv2.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Lab 3-5 Debrief.
Dynamic Routing Protocols II OSPF
SRI International 1 Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) Richard Ogier March 20, 2003.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
OSPF Immediate Hello draft-kou-ospf-immediately-replying-hello-00.txt Zengjie Kou Xiaoyi Guo.
OSPF WG Security Extensions for OSPFv2 when using Manual Keying Manav Bhatia, Alcatel-Lucent Sam Hartman, Huawei Dacheng Zhang, Huawei IETF 80, Prague.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF-Based Solution How OSPF Packet Processes.
TCP/IP (Routing). Content DHCP And Mobile IP Internet Routing Protocol RIP (Routing Information Protocol) OSPF (Open Shortest Path First) BGP (Border.
Draft-chandra-ospf-manet-ext-01.txtIETF 60 draft-chandra-ospf-manet-ext-01.txt IETF 60.
111 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3: Switching Basics and Intermediate Routing v3.0.
Troubleshooting EIGRP & OSPF (Some typical problems)
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
1 CMPT 471 Networking II OSPF © Janice Regan,
Hello Educational presentation.
Open Shortest Path First (OSPF)
IGP Troubleshooting 3.
Dynamic Routing Protocols II OSPF
Instructor Materials Chapter 5: Dynamic Routing
OSPF (Open Shortest Path First)
Multi Topology Routing (MTR) for OSPF
Routing Protocols and Concepts
Link-State Routing Protocols
ISIS Flooding Reduction in MSDC
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
Chapter 5: Dynamic Routing
Dynamic Routing Protocols II OSPF
ECE 544 Protocol Design Project 2016
Network Security (contd.)
Link-State Routing Protocols
Link-State Routing Protocols
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
CCNP Network Route OSPF Part -II
Unit 3 OSPF Single Area Chapter 6 Using OSPF in a Single Area
OSPF WG Supporting Authentication Trailer for OSPFv3
Presentation transcript:

All Rights Reserved © Alcatel-Lucent 2006, ##### 1 | Presentation Title | Month 2006 Router A Router B OSPF Hdr: Session ID = X1; Nonce = N1 OSPF HELLO: Neighbor = 0 OSPF Hdr: Session ID = X2; Nonce = N2 OSPF HELLO: Neighbor = 0 OSPF Hdr: Session ID = X1; Nonce = N1 OSPF HELLO: Neighbor = B; Session ID = X2; Nonce = N2 OSPF Hdr: Session ID = X2; Nonce = N2 OSPF HELLO: Neighbor = A; Session ID = X1; Nonce = N1 Router B reaches the 2way state and can now initiate the DD exchange.All Hellos from B will now contain A's Session ID and the nonce value OSPF Hdr: Session ID = X1; Nonce = N1 Normal OSPF DD packet OSPF Hdr: Session ID = X2; Nonce = N2 Normal OSPF DD packet The OSPF header carries the Session ID and the Nonce value. There is no change in the DD packet. Router A will accept any packet from B as long as the header carries the same Session ID and the nonce value that it sees in its HELLOs OSPF Hdr: Session ID = X1; Nonce = N1 Normal OSPF Link State Packet Scenario 1: Two Routers coming up.. OSPF Hdr: Session ID = X1; Nonce = N1 OSPF HELLO: Neighbor = B; Session ID = X2; Nonce = N2 Router A keeps sending its HELLO listing B as its neigbor along with the last Session ID and the nonce value

All Rights Reserved © Alcatel-Lucent 2006, ##### 2 | Presentation Title | Month 2006 Router A Router C OSPF Hdr: Session ID = X3; Nonce = N3 OSPF HELLO: Neighbor = 0 OSPF Hdr: Session ID = X1; Nonce = N1' OSPF HELLO: Neighbor1 = B; Session ID = X2; Nonce = N2 OSPF Hdr: Session ID = X2; Nonce = N2 OSPF HELLO: Neighbor = A; Session ID = X1; Nonce = N1' Router A's HELLO is listing B as a neighbor OSPF Hdr: Session ID = X1; Nonce = N1' Normal OSPF DD packet OSPF Hdr: Session ID = X2; Nonce = N2 Normal OSPF DD packet The OSPF header carries the Session ID and the Nonce value. There is no change in the DD packet. Router A will accept any packet from C as long as the header carries the same Session ID and the nonce value that it sees in its HELLOs OSPF Hdr: Session ID = X1; Nonce = N1 Normal OSPF Link State Packet Scenario 1: Another Router C comes up on that LAN OSPF Hdr: Session ID = X1; Nonce = N1 OSPF HELLO: Neighbor = B; Session ID = X2; Nonce = N2 Router C's blank HELLO with its Session ID and nonce value Neighbor2 = C; Session ID = X3; Nonce = N3 Upon hearing a new router, A uses a new Nonce N1'. Router B, updates its data structures to use the new value. It knows its correct since the HELLOs are listing Router B's correct Session ID and nonce values

All Rights Reserved © Alcatel-Lucent 2006, ##### 3 | Presentation Title | Month 2006 Router A Router B OSPF Hdr: Session ID = X4; Nonce = N4 OSPF HELLO: Neighbor = 0 OSPF Hdr: Session ID = X4; Nonce = N4 OSPF HELLO: Neighbor = B; Session ID = X2; Nonce = N2' OSPF Hdr: Session ID = X2; Nonce = N2' OSPF HELLO: Neighbor = A; Session ID = X4; Nonce = N4 Router B recvs new HELLO -- makes note of it and changes its nonce value. Continues listing A with the earlier session ID and nonce values OSPF Hdr: Session ID = X4; Nonce = N4 Normal OSPF DD packet OSPF Hdr: Session ID = X2; Nonce = N2' Normal OSPF DD packet Scenario 3: Router A reboots Router A reboots and uses a new Session ID and nonce values OSPF HELLO: Neighbor = A; Session ID = X1; Nonce = N1 OSPF Hdr: Session ID = X2; Nonce = N2' Router B sees the new HELLO with its new nonce value, updates its internal state of A with its new Session ID X4 and nonce value N4. It carries these new values in its subsequent packets.