Richard Ogier Presented by Tom Henderson March 23, 2006

Slides:



Advertisements
Similar presentations
Extensible Manet Auto-configuration Protocol (EMAP) draft-ros-autoconf-emap-02.txt Pedro M. Ruiz Francisco J. Ros March, 2006 Dallas, USA 65 th IETF.
Advertisements

OSPF Two-part Metrics Jeffrey Zhang Lili Wang Juniper Networks 88 th IETF, Vancouver.
OSPF WG – IETF 70 - Vancouver OSPFv2 Multi-Instance draft-acee-ospf-multi-instance-00.txt Acee Lindem/Redback Networks Abhay Roy/Cisco Systems Sina Mirtorabi/Force10.
Ogier and Spagnolo - 1 MANET Extension of OSPF Using CDS Flooding draft-ogier-manet-ospf-extension-05.txt Richard Ogier, SRI International Phil Spagnolo,
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Nov 11, 2004CS573: Network Protocols and Standards1 IP Routing: OSPF Network Protocols and Standards Autumn
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.
OSPF Two-part Metrics Jeffrey Zhang Juniper Networks 89 th IETF, Landon.
Ogier - 1 OSPF-MDR Position draft-ogier-ospf-mdr-position-00.txt Richard Ogier Presented by Tom Henderson March 23, 2006 IETF Meeting - OSPF WG.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
LAN Switching and WAN Networks Topic 6 - OSPF. What we have done so far! 18/09/2015Richard Hancock2  Looked at the basic switching concepts and configuration.
OSPF-MDR - 1 OSPF-MDR: Extension of OSPF for Mobile Ad Hoc Networks draft-ietf-ospf-manet-mdr-02.txt Richard Ogier September 17, 2008.
OSPF-MDR - 1 Comparison of Three MANET Extensions of OSPF draft-ogier-ospf-manet-mdr-or-compare-00.txt draft-ogier-ospf-manet-mdr-mpr-compare-00.txt Richard.
Ogier - 1 MANET Extension of OSPF Using CDS Flooding draft-ogier-manet-ospf-extension-03.txt Richard Ogier March 2, 2005 IETF Meeting - OSPF WG.
Network Architecture and Design
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 Multi Topology Routing for OSPFv3 (draft-mirtorabi-mt-ospfv3-00.txt) Sina Mirtorabi
CCNA Guide to Cisco Networking Fundamentals Fourth Edition
OSPF Offloading: The HELLO Protocol A First Step Toward Distributed Heterogeneous Offloading Speaker: Mary Bond.
1 OSPF and MANET WG meetings, IETF64 OSPF MANET Design Team outbrief November, 2005 Tom Henderson Design team members:
OSPF WG – IETF 67 OSPF WG Document Status or “You can bring a Horse to Water …” Rohit Dube/Consultant Acee Lindem/Cisco Systems.
OSPF WG – IETF 69 - Chicago OSPF WG Document Abhay Roy/Cisco Systems Acee Lindem/Redback Networks.
OSPF WG – IETF 66 OSPF WG Document Status Rohit Dube/Consultant Acee Lindem/Cisco Systems.
SRI International 1 Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) Richard Ogier September 21, 2002.
SRI International 1 Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) Richard Ogier March 20, 2003.
1 OSPF and MANET WG meetings, IETF63 OSPF MANET Design Team update August 1-5, 2005 Tom Henderson (in absentia)
OSPFv3 Auto-Config IETF 83, Paris Jari Arkko, Ericsson Acee Lindem, Ericsson.
1 IGP Data Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-app-01.txt draft-ietf-bmwg-igp-dataplane-conv-term-01.txt draft -ietf-bmwg-igp-dataplane-conv-meth-01.txt.
OSPF Hybrid Broadcast and P2MP Interface Type Nischal Sheth, Lili Wang, Jeffrey Zhang Juniper Networks 81th IETF, Quebec City.
3 rd December 0770 th IETF Meeting ospf-lite draft-thomas-hunter-reed-ospf-lite-00.txt Matthew Ramon Thomas
Release 5.1, Revision 0 Copyright © 2001, Juniper Networks, Inc. Advanced Juniper Networks Routing Module 3: OSPF NSSA.
Draft-chandra-ospf-manet-ext-01.txtIETF 60 draft-chandra-ospf-manet-ext-01.txt IETF 60.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
Draft-psenak-ospf-segment-routing-ospf-extension-03 draft-psenak-ospf-segment-routing-ospfv3-extension-00 IETF 88, November 3-8, 2013 P. Psenak, S.Previdi,
IETF 58 OSPF WG Rohit Dube/Acee Lindem (Chairs) November, 2003 Rohit Dube/Acee Lindem (Chairs) November, 2003.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
1 OSPF WG meeting, IETF65 OSPF MANET update March 23, 2006 Tom Henderson
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,
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Advertising Generic Information in IS-IS
Instructor & Todd Lammle
Kevin Piper, David Perry, Tom Hoffman, Emely Pagan
Richard Ogier Presented by Tom Henderson July 28, 2011
Multi-Instances ISIS Extension draft-ietf-isis-mi-08.txt
OSPF (Open Shortest Path First)
Instructor & Todd Lammle
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Multi Topology Routing (MTR) for OSPF
ISIS Flooding Reduction in MSDC
Instructor Materials Chapter 10: OSPF Tuning and Troubleshooting
Single-Area OSPF (Open Shortest Path First Protocol)
Single-Area OSPF (Open Shortest Path First Protocol)
Explicitly advertising the TE protocols enabled on links in OSPF
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Dynamic Routing Protocols part2
IS-IS Reverse Metric IETF 97, Seoul
CCNA 3 v3 JEOPARDY Module 2 CCNA3 v3 Module 2 K. Martin.
OSPF & ISIS Flooding Reduction
draft-ietf-ospf-lls-interface-id-01
draft-ppsenak-ospf-lls-interface-id-00
draft-ietf-ospf-lls-interface-id-00
Dynamic Routing Protocols part3 B
draft-ietf-ospf-lls-interface-id-00
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
draft-ietf-ospf-te-link-attr-reuse-04
Presentation transcript:

Richard Ogier Presented by Tom Henderson March 23, 2006 IETF Meeting - OSPF WG MANET Extension of OSPF Using CDS Flooding draft-ogier-manet-ospf-extension-07.txt Richard Ogier Presented by Tom Henderson March 23, 2006

Changes from Version 06 to Version 07 Dependent Neighbors are now advertised in Hellos via a new LLS TLV, to allow each router to correctly update its Dependent Selectors. The set of Dependent Neighbors has been narrowed to include only (Backup) MDR neighbors that should become adjacent. (The set therefore now depends on AdjConnectivity.) The procedure for deciding whether to become adjacent with a neighbor has been simplified, and no longer depends on AdjConnectivity. The parent selection algorithm has been simplified. The (Backup) Parent is now selected to be an adjacent (Backup) MDR neighbor whenever such a neighbor exists, to avoid forming a new adjacency when possible. The min-cost LSA algorithm has been extended to support multiple interfaces, including non-MANET interfaces.

Reason for adding Dependent Neighbor List (DNL) TLV in Hellos Previously, when a router received a Database Description packet from a (Backup) MDR, it set the Dependent Selector bit to 1 for the neighbor, which indicated the neighbor should be adjacent. However, if the router temporarily loses the neighbor (due to inactivity timer) but the neighbor never loses the router, the Dependent Selector bit is reset to 0 and the adjacency is not reestablished. With the modification, the router will see itself in the DNL sent by the neighbor, and will know that it should reestablish the adjacency.

Simplified Rule for Deciding Whether to Become Adjacent The set of Dependent Neighbors has been narrowed to include only (Backup) MDR neighbors that should become adjacent. (The set therefore now depends on AdjConnectivity.) As a result, a router becomes adjacent with a neighbor if and only if any of the following conditions is true: Both the router and neighbor are (Backup) MDR and the neighbor is either a Dependent Neighbor or a Dependent Selector. The router is a (Backup) MDR and the neighbor is a child. The neighbor is a (Backup) MDR and is the router's (Backup) Parent.

Simplified Rule for Selecting Parents Parent is selected to be an existing adjacent neighbor that is an MDR, if such a neighbor exists. Otherwise, the neighbor with the largest value of (MDR Level, RtrPri, RID) is selected as parent. Similarly, Backup Parent is selected to be an existing adjacent neighbor that is an MDR/BMDR if such a neighbor exists (if AdjConnectivity = 2). By giving preference to neighbors that are already adjacent, the formation of a new adjacency is avoided when possible.

Future Work Experiment with link quality conditions (hysteresis) for accepting new neighbors and declaring neighbors to be routable. When selecting MDRs and Dependent Neighbors: Give preference to more stable links to increase adjacency lifetime. Give preference to existing adjacencies, to avoid forming new adjacencies when possible.