3 rd December 0770 th IETF Meeting ospf-lite draft-thomas-hunter-reed-ospf-lite-00.txt Matthew Ramon Thomas

Slides:



Advertisements
Similar presentations
OSPF 1.
Advertisements

Introduction to OSPF Mark Tinka. Routing and Forwarding  Routing is not the same as Forwarding  Routing is the building of maps Each routing protocol.
OSPF Two-part Metrics Jeffrey Zhang Lili Wang Juniper Networks 88 th IETF, Vancouver.
Introduction to OSPF.
Lonnie Decker Multiarea OSPF for CCNA Department Chair, Networking/Information Assurance Davenport University, Michigan August 2013 Elaine Horn Cisco Academy.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 OSPF Routing Protocols and Concepts – Chapter 11.
Designing OSPF Networks
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Multiarea OSPF Scaling Networks.
CCNA 2 v3.1 Module 6.
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.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Improving Routing Performance.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—5#-1 MPLS VPN Implementation Configuring OSPF as the Routing Protocol Between PE and CE Routers.
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.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 5: Adjust and Troubleshoot Single- Area OSPF Scaling Networks.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Link-State Routing Protocols
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
Collected By: Mehdi Daneshvar Supervisor: E.M.Kosari.
Protocol implementation Next-hop resolution Reliability and graceful restart.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
Network Architecture and Design
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
Page 110/27/2015 A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols.
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 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
1 of of 35 Single Area OSPF Concepts 3 of 35 OSPF Basics.
Simulation of the OLSRv2 Protocol First Report Presentation.
OSPF Topology-Transparent Zone Huaimo Chen, Renwei Li (Huawei) Gregory Cauchie (France Telecom) Ning So (Verizon)
© 2015 Mohamed Samir YouTube channel All rights reserved. Samir Agenda Instructor introduction 1. Introduction toEldarin 2.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Dynamic Routing Protocols II OSPF
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—6-1 Scaling Service Provider Networks Scaling IGP and BGP in Service Provider Networks.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
 RIP — A distance vector interior routing protocol  IGRP — The Cisco distance vector interior routing protocol (not used nowadays)  OSPF — A link-state.
CCNP Routing Semester 5 Chapter 4 OSPF.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
1 24-Feb-16 S Ward Abingdon and Witney College OSPF CCNA Exploration Semester 2 Chapter 11.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Configuring and Verifying.
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.
OSPF Link Overload draft-hegde-ospf-link-overload Shraddha Hegde Hannes Gredler Pushpasis Sarkar.
Chapter 11 Chapter 8 Routing & Switching Open Shortest Path First OSPF Thanks to instructors at St. Clair College in Windsor, Ontario.
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.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Dynamic Routing Protocols II OSPF
Richard Ogier Presented by Tom Henderson July 28, 2011
Routing Protocols and Concepts
Link-State Routing Protocols
ISIS Flooding Reduction in MSDC
Instructor Materials Chapter 10: OSPF Tuning and Troubleshooting
Chapter 10: OSPF Tuning and Troubleshooting
Chapter 9: Multiarea OSPF
Module Summary Open Shortest Path First (OSPF) protocol is one of the most commonly used link-state IP routing protocols in networking. It is an open standard.
Chapter 2: Static Routing
Link-State Routing Protocols
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Chapter 9: Multiarea OSPF
Chapter 2: Scaling VLANs
IS-IS Flooding Reduction in MSDC
Link-State Routing Protocols
Chapter 9: Multiarea OSPF
Chapter 10 Link State Routing Protocols
Dynamic Routing Protocols part3 B
Chapter 10: OSPF Tuning and Troubleshooting
Presentation transcript:

3 rd December 0770 th IETF Meeting ospf-lite draft-thomas-hunter-reed-ospf-lite-00.txt Matthew Ramon Thomas

3 rd December 0770 th IETF Meeting ospf-lite features at a glance Branch version of OSPF (OSPF’s baby brother) Avoids design phase. –‘Instant on’ for customers with no configuration if required. –Vendors can sell direct to client for large networks. Simple single area concept Support for external routes LSA 5’s / Opaque LSAs The ability to ‘boot up’ (2 stage) over non fully meshed multi-access network. MPLS core: Service Providers can implement a simplified OSPF protocol on growing MPLS clouds without resorting to IS-IS.

3 rd December 0770 th IETF Meeting Method Overview: 5 major Adaptations A single unified link type within the LSA 1 was introduced for all network types Hello protocol reworked to allow neighbor establishment over non fully meshed media A single LSA type is used to describe the router Designated router is no longer required Multiple instances solution to area LSA complexity

3 rd December 0770 th IETF Meeting A single link type for ospf-lite ospf-lite employs a single link type within the LSA 1 ospf-lite treats all networks as ospf-lite-stub or ospf- lite-transit –So it’s independent of the underlying network medium –For NBMA networks ospf-lite still compensates: Uses MIB IF lookup, recognises NBMA interface and; Additional 32 bit route still added for NBMA networks This is automatic OSPF P2MP, P2P, Broadcast, NBMA types removed

3 rd December 0770 th IETF Meeting Promiscuous Hello Protocol Always on, all networks treated the same. This allows ospf-lite to ‘boot up’ over non fully meshed NBMA networks.

3 rd December 0770 th IETF Meeting Promiscuous Hello protocol cont.. An ospf-lite router may see neighbors listed in another router’s Hello. –ospf-lite Hello then attempts a unicast Hello to connect to that neighbor. –This may fail until routes are established between the directly communicating neighbors, but the protocol remains promiscuous and establishes communication when the routes are in place.

3 rd December 0770 th IETF Meeting LSA type reduction All of the data required to build the calculation graph is carried inside the Router LSA 1. –V2 has duplication in the LSA 2 due to the DR function ospf-lite has a single LSA type (Router LSA 1) to describe the router itself. –External LSA 5s are supported –Opaque LSA 9,10,11 are supported

3 rd December 0770 th IETF Meeting DR Removal DR function originally designed for IS-IS with more active ES. ospf-lite removes all of the LSA 2’s. Each LSA 2 is flooded throughout the whole area in OSPF V2 –If each router has an Ethernet, then the number of LSA 2’s could equal the number of router LSA 1s –The removal of these LSAs is a significant simplification

3 rd December 0770 th IETF Meeting Adjacencies on shared media are are now O(n 2 ) This is by design. OSPF V2 avoids O(n 2 ) but ospf-lite uses O(n 2 ) when prudent

3 rd December 0770 th IETF Meeting O(n 2 ) concerns: linear With ospf-lite and V2; when routers are added to an internet; –LSA Traffic on an simple P2P internet does not increase O(n 2 ) but increases linearly; Adjacencies on an P2P internet do not increase O(n 2 ) Each router generates it’s own LSAs These of course are copied by each router and distributed linearly –LSA Traffic DOES increase as O(n 2 ) on a broadcast or fully meshed network with no Designated Router function. Adjacencies also increase O(n 2 ) What is n? For n to become large the number or routers on an individual network would have to be large. –A high number of nodes in a standard P2P cloud, each on their own Ethernet connection equates to an n of 1 –Five routers sharing an Ethernet equates to an n of 5

3 rd December 0770 th IETF Meeting O(n 2 ) concerns cont.. Today’s networks are largely point to point or have few routers on a single network / VLAN / PBT path so n is low. –Ethernet comprises of multiple VLANS –Frame clouds are often configured point-to-point

3 rd December 0770 th IETF Meeting Areas / Multiple instances Areas were originally conceived to summarize the database –Although they can summarize routes, this is normally achieved by manual configuration due to class addresses being split between areas. The areas do summarize the database. –Video graphics programmers regularly run SPF on huge databases. Areas do succeed in shielding devices from routes

3 rd December 0770 th IETF Meeting Multiple Instances ospf-lite employs multiple instances with route redistribution where legacy areas are required. There is no theoretical limit to size of ‘area’. With multiple instances and redistribution there is no defined limit to AS size. BW utilisation is low so we are only limited by processor power and memory.

3 rd December 0770 th IETF Meeting IANA / WG Considerations We would like to use Version number zero? –This was never registered with IANA but its up to the Working Group to decide…

3 rd December 0770 th IETF Meeting Thank you You know you could have half a cup of regular coffee, but is it equal to a large skinny Latte?