OSPF Two-part Metrics Jeffrey Zhang Juniper Networks 90 th IETF, Toronto.

Slides:



Advertisements
Similar presentations
OSPF WG - IETF 66 OSPF Protocol Evolution WG Re-Charter Acee Lindem/Cisco Systems.
Advertisements

OSPF Two-part Metrics Jeffrey Zhang Lili Wang Juniper Networks 88 th IETF, Vancouver.
Introduction to OSPF.
IPv6 Routing IPv6 Workshop Manchester September 2013
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Multiarea OSPF Scaling Networks.
OSPF Stub neighbor Draft Faraz Shamim – Cisco Padma Pillay-Esnault – Cisco Khalid Raza – Viptela Andrew Kulawiak – Bank of America John Cavanaugh – 405.
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.
Update to: The OSPF Opaque LSA Option draft-berger-ospf-rfc2370bis Lou Berger Igor Bryskin Alex Zinin
Draft-ospf-non-compatible Mike Dubrovsky. The draft addresses the following problem: Problem: How to introduce non-backward compatible functionality into.
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.
OSPF Two-part Metrics Jeffrey Zhang Juniper Networks 89 th IETF, Landon.
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
ROUTING PROTOCOLS PART II ET4187/ET5187 Advanced Telecommunication Network.
Open Shortest Path First (OSPF) -Sheela Anand -Kalyani Ravi -Saroja Gadde.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Carl Bergenhem Multi Area OSPF Carl Bergenhem
Collected By: Mehdi Daneshvar Supervisor: E.M.Kosari.
1 © 2001, Cisco Systems, Inc. All rights reserved.© 2003, Cisco Systems, Inc. OSPF and ISIS v6 Khalid Raza
Draft-ietf-ospf-segment-routing-extensions-01 draft-psenak-ospf-segment-routing-ospfv3-extension- 02 IETF 88, November 3-8, 2013 P. Psenak, S.Previdi,
© 1999, Cisco Systems, Inc OSPF Overview RFC 2328, 2178, 1583.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
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.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
CCNA 3 Week 2 Link State Protocols OSPF. Copyright © 2005 University of Bolton Distance Vector vs Link State Distance Vector –Copies Routing Table to.
1 Multi Topology Routing for OSPFv3 (draft-mirtorabi-mt-ospfv3-00.txt) Sina Mirtorabi
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
Link State Routing NETE0521 Presented by Dr.Apichan Kanjanavapastit.
OSPF Topology-Transparent Zone Huaimo Chen, Renwei Li (Huawei) Gregory Cauchie (France Telecom) Ning So (Verizon)
 Development began in 1987  OSPF Working Group (part of IETF)  OSPFv2 first established in 1991  Many new features added since then  Updated OSPFv2.
OSPF Extensions for ASON Routing draft-ietf-ccamp-gmpls-ason-routing-ospf-02.txt IETF67 - San Diego - Nov’06 Dimitri Papadimitriou (Alcatel)
57 th IETF VIENNA draft-sheng-ppvpn-isis-bgp-mpls vpn-01.txt 57 th IETF meeting IS-IS as the PE/CE Protocol in BGP/MPLS VPN draft-sheng-ppvpn-isis-bgp-mpls-00.txt.
1 OSPF in Multiple Areas. 2 2 Scalability Problems in Large OSPF Areas Scalability problems in large OSPF areas include Large routing tables Large routing.
OSPF WG – IETF 69 - Chicago OSPF WG Document Abhay Roy/Cisco Systems Acee Lindem/Redback Networks.
Extensions to OSPFv2 for Advertising Optional Route/Link Attributes draft-mirtorabi-ospf-tag-00.txt Sina Mirtorabi
OSPF WG – IETF 63 OSPFv3 Graceful Restart Padma Pillay-Esnault Cisco Systems
1 OSPF and MANET WG meetings, IETF63 OSPF MANET Design Team update August 1-5, 2005 Tom Henderson (in absentia)
1 OSPF WG meeting, IETF61 OSPF Wireless Design Team update November 8, 2004 Tom Henderson
Cisco Confidential © 2010 Cisco and/or its affiliates. All rights reserved. 1 draft-pillay-esnault-ospf-service-distribution-00.txt Padma Pillay-Esnault.
OSPFv3 Auto-Config IETF 83, Paris Jari Arkko, Ericsson Acee Lindem, Ericsson.
PIM-BIDIR RP Resiliency Jeffrey Zhang, Kurt Windisch, Jaroslaw Adam Gralak Juniper Networks 88 th IETF, Vancouver.
OSPFv3 John Rullan Cisco Certified Instructor Trainer Thomas A. Edison CTE HS Stephen Lynch Network Architect, CCIE #36243 ABS Technology Architects.
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
Extended procedures and Considerations for Loop Free Alternatives draft-chunduri-rtgwg-lfa-extended-procedures-01 Uma Chunduri Ericsson Inc. Jeff Tantsura.
Draft-chandra-ospf-manet-ext-01.txtIETF 60 draft-chandra-ospf-manet-ext-01.txt IETF 60.
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.
1 CMPT 471 Networking II OSPF © Janice Regan,
CMPT 371 Data Communications and Networking Routing in the Internet
Richard Ogier Presented by Tom Henderson July 28, 2011
OSPF (Open Shortest Path First)
Multi Topology Routing (MTR) for OSPF
Routing Protocols and Concepts
Link-State Routing Protocols
13.3 OSPF: Open Shortest Path First.
Chapter 9: Multiarea OSPF
Link-State Routing Protocols
draft-ietf-ospf-lls-interface-id-01
Cisco networking, CNET-448
Chapter 9: Multiarea OSPF
draft-pim-with-ipv4-prefix-over-ipv6-nh
Link-State Routing Protocols
Chapter 9: Multiarea OSPF
Dynamic Routing Protocols part3 B
ISIS extensions for SRv6 draft-bashandy-isis-srv6-extensions-03
draft-ietf-ospf-te-link-attr-reuse-04
BIER with RIFT Zhaohui Zhang (Juniper) Shaowen Ma (Juniper) Zheng Zhang (ZTE) BIER WG 20-March-2018.
Presentation transcript:

OSPF Two-part Metrics Jeffrey Zhang Juniper Networks 90 th IETF, Toronto

Summary -00 revision presented in 88 th IETF, Vancouver –Problem statement and proposed solution -01 revision addressed compatibility issue and filled in missing details –Presented in 89 th IETF, London With two options of encoding from-network cost and ensuring backward compatibility This presentation: –Reviews general idea –Presents the chosen option and details in -02 revision –Request WG adoption

An example network Satellite based, with fixed/mobile routers –A true broadcast network, not MANET Different costs between different pairs –Conventionally modeled as p2mp network R1 R2 R3 R1->R2: 10 R1->R3: 20 R2->R1: 15 R2->R3: 25 R3->R1: 20 R3->R2: 25

RFC 6845 Hybrid Interface Treat as broadcast for Hello, adjacency and database synchronization purpose Treat as p2mp to advertise different costs for different neighbors –Each Router LSA has N-1 links for the interface One for each neighbor –Change in one router’s communication capability causes all routers to update their Router LSAs unbearable flooding in a large network with routers constantly moving around

Proposed solution Model as broadcast network –Do not advertise p2p links Break router to router cost to two parts: to/from-network –Advertise from-network cost in a stub-link for the network SPF calculation to consider both to- and from-network costs V1 V2 W Router LSA for R1 Router LSA for R2 Router LSA for R3 Router-Router Cost calculation: R1->R2: 10+10=20 R1->R3: 10+15=25 R2->R1: 10+5 =15 R2->R3: 10+15=25 R3->R1: 20+5 =25 R3->R2: 20+10=30 Net LSA V3 Black: to-net Red: from-net

Advantages Full benefit of broadcast network model –Hello, Adjacency, Synchronization –Reduced LSA size (2N vs. N^2) One link in each Router LSA, N link in the Net LSA –Vs. (N-1) link in each Router LSA Reduced update frequency –When one router’s communication capability changes, only its own Router LSA needs update (for OSPFv2) For OSPFv3, that router’s Intra-Area-Prefix-LSA also needs update Generally applicable to ANY broadcast network –As long as cost can be logically broken into two parts –Not a drastic change in concept from RFC 2328: Section 2.2: “Edges that are not marked with a cost have a cost of zero (these are network-to-router links)” Section A.4.3: “The distance from the network to all attached routers is zero”

Encoding from-network cost: In a stub link (OSPFv2) Thanks to Acee for the idea In addition to the type-2 transit link, advertise a type-3 stub link to the network, with cost set to the from-network cost During SPF calculation, the presence of both a transit and stub link to the network indicates the network is using two-part metric, and router-router costs are calculated accordingly The stub link is skipped in the second stage of SPF calculation (for stub networks)

Encoding from-network cost: OSPFv3 For OSPFv3, there is no stub-link in Router LSA but there are separate Intra-Area-Prefix-LSAs –advertised by DR for transit networks and by everyone for stub networks If a DR includes a transit link in its Router-LSA for a two-part- metric network, then for the associated prefix in its Intra-Area- Prefix-LSA, the metric is set to its from-network cost (vs. 0) For a non-DR, include the associated prefix in its Intra-Area- Prefix-LSA –Metric set to its from-network-cost –Reference set to the Transit Link advertised by the DR Referenced LS Type set to 0x2002 Referenced LS ID sets to DR’s InterfaceID Referenced Advertising Router set to DR’s Router ID

An optional optimization for OSPFv3 Encode all from-network costs in DR’s Intra- Area-Prefix-LSA –If the underlying network already has a mechanism to communicate those costs to DR –Non-DR’s from-network costs encoded in additional prefix entries following the prefix entry that the DR normally includes already Referenced Advertising Router set to those Non-DR This further reduces flooding in affect-all events – e.g. large-area rainstorm affecting a satellite based network

SPF calculation When a network LSA is examined, for each listed neighbor, check if there is advertised from-network cost -OSPFv2: check for the stub-link for the transit network in the neighbor’s Router LSA -OSPFv3: check for corresponding prefixes in DR’s Intra-Area-Prefix-LSA first. If not found, check the neighbor’s Intra-Area-Prefix-LSA -The stub-link or prefixes described above are ignored when calculating routes to stub networks

Compatibility All routers supporting this capability must advertise Router Information (RI) LSA with a newly assigned bit set in Router Informational Capabilities TLV All routers must disable two-part metric when detecting the presence of a reachable Router LSA w/o a companion RI LSA w/ the bit set: –Remove its stub link for a transit network –Recalculate routes w/o considering the from- network cost

Next steps Draft is done – no further update expected –Except for potential changes warranted from the WG review Seek WG adoption