OSPF Topology-Transparent Zone Huaimo Chen, Renwei Li (Huawei) Gregory Cauchie (France Telecom) Ning So (Verizon)

Slides:



Advertisements
Similar presentations
OSPF Header OSPF HEADER OSPF HEADER for this project Types we will use
Advertisements

Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Introduction to OSPF.
Designing OSPF Networks
OSPF TE Topology-Transparent Zone draft-chen-ospf-te-ttz-00 Huaimo Chen Renwei Li Gregory Cauchie
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Multiarea OSPF Scaling Networks.
1 LINK STATE PROTOCOLS (contents) Disadvantages of the distance vector protocols Link state protocols Why is a link state protocol better?
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public BSCI Module 4 Lesson 1 1 The IS-IS Protocol BSCI Module 4 Lesson 1 Introducing IS-IS and Integrated.
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.
RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.
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.
Internet Networking Spring 2002
CSEE W4140 Networking Laboratory Lecture 5: IP Routing (OSPF and BGP) Jong Yul Kim
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
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.
Open Shortest Path First (OSPF) -Sheela Anand -Kalyani Ravi -Saroja Gadde.
Routing and Routing Protocols Dynamic Routing Overview.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Link-State Routing Protocols
1 Routing Protocols. 2 Distributed Routing Protocols Rtrs exchange control info Use it to calculate forwarding table Two basic types –distance vector.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
© 1999, Cisco Systems, Inc OSPF Overview RFC 2328, 2178, 1583.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
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.
Link State Routing NETE0521 Presented by Dr.Apichan Kanjanavapastit.
 Development began in 1987  OSPF Working Group (part of IETF)  OSPFv2 first established in 1991  Many new features added since then  Updated OSPFv2.
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.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Open Shortest Path First (OSPF)
Dynamic Routing Protocols II OSPF
OSPF Topology-Transparent Zone Huaimo Chen Renwei Li Gregory Cauchie Ning So
LINK STATE ROUTING PROTOCOLS Dr. Rocky K. C. Chang 22 November
Applicability of OSPF Topology- Transparent Zone Gregory Cauchie Ning So Vic Liu
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF-Based Solution Planning Routing Implementations.
CCNP Routing Semester 5 Chapter 4 OSPF.
CS440 Computer Networks 1 Link State Routing and OSPF Neil Tang 10/31/2008.
3 rd December 0770 th IETF Meeting ospf-lite draft-thomas-hunter-reed-ospf-lite-00.txt Matthew Ramon Thomas
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Configuring and Verifying.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.
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.
Requirements for OSPF Topology- Transparent Zone Gregory Cauchie Ning So Vic Liu
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Open Shortest Path First (OSPF)
Dynamic Routing Protocols II OSPF
Instructor Materials Chapter 5: Dynamic Routing
Link State Routing protocol
OSPF (Open Shortest Path First)
Link-State Routing Protocols
Dynamic Routing Protocols part2
Intra-Domain Routing Jacob Strauss September 14, 2006.
Chapter 5: Dynamic Routing
Chapter 9: Multiarea OSPF
Dynamic Routing Protocols II OSPF
ECE 544 Protocol Design Project 2016
OSPF & ISIS Flooding Reduction
Link-State Routing Protocols
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Cisco networking, CNET-448
Chapter 9: Multiarea OSPF
Link-State Routing Protocols
Chapter 9: Multiarea OSPF
Dynamic Routing Protocols part3 B
Link State(LS) Flooding Reduction
Presentation transcript:

OSPF Topology-Transparent Zone Huaimo Chen, Renwei Li (Huawei) Gregory Cauchie (France Telecom) Ning So (Verizon)

Page 2 Contents  Why TTZ?  What is TTZ?  Introduction  How TTZ?

Page 3 Introduction What happens if a network is bigger and bigger? Scalability Issue, Slower convergence, etc. Problems in Current Solution Using Area ›Limitation on Scalability: at most two levels of hierarchies ›Very complex to provide end to end services ›Service interruptions when splitting ASes/Areas since Network Architecture is changed significantly ›Harder to operate & maintain network with more/multiple ASes & areas ›Not easy for applications/software to be aware of/drive/control networks with more/multiple ASes and areas in near future ›Harder for inter-cloud networking with more/multiple ASes and areas TTZ may resolve these issues

Page 4 Contents  Why TTZ?  What is TTZ?  Introduction  How TTZ?  Definition of TTZ  Configuring OSPF TTZ  TTZ vs Area

Page 5 Definition of TTZ A group of routers connected by links with TTZ ID  which is virtualized as a group of TTZ edge routers fully connected or a single router  of which routers outside TTZ are NOT aware  through which LSAs outside are distributed

Page 6 As a Group of Edge Routers Connected (Animated) A group of routers connected by links with attribute TTZ ID. Routers outside of TTZ are NOT aware of TTZ, just see the edge routers of TTZ, which are connected. Links, routers inside TTZ are NOT advertised to routers outside of TTZ. R6 R7 R8 R10 R9 R4 R1 R2 R11 R3 R5 T4 T2 T5 T8 T3 T9 T10 T1 T7 T6 TTZ T4 T3 T10 T1

Page 7 TTZ as a Single Router (Animated) Routers outside of TTZ are NOT aware of TTZ, Just see TTZ as a Single Router. R6 R7 R8 R10 R9 R4 R1 R2 R11 R3 R5 RT T4 T2 T5 T8 T3 T9 T10 T1 T7 T6 TTZ

Configuring OSPF TTZ Configurations on router R2: router ospf 1 Interface ethernet 1/0 ip address /24 Interface ethernet 2/0 ip address /24 ttz Interface ethernet 3/0 ip address /24 ttz Interface ethernet 4/0 ip address /24 ttz No configuration changes on router outside TTZ Configurations on router P1: router ip ospf 1 Interface ethernet 0/0 ip address /24 Interface ethernet 1/0 ip address /24 San Francisco R1 R2 R3 R4 P1 P2 Eth0/0 Eth1/0 Eth2/0 Eth3/0 Eth4/0 Eth3/0 Eth4/0 Eth3/0 Eth1/0 Eth0/0 Eth1/0 Eth2/0 TTZ OSPF Configure TTZ ID on an interface in TTZ

TTZ vs Area OSPF TTZ:  Virtualize TTZ as a router or a group of routers  Can see through a TTZ  2+ levels of hierarchies  Easy to set up TE LSP crossing TTZs  Minor network architecture changes when TTZ is used in a network OSPF Area:  2 levels of hierarchies  Complex to set up TE LSP crossing areas  Significant network architecture changes when multiple areas are introduced to a network TTZ has functions of Area & improves on Area

Page 10 Contents  Why TTZ?  What is TTZ?  Introduction  How TTZ?  Improves Scalability 1 Order of Magnitude  E2E Services Can Be Set Up Easily  Higher Availability

Improves Scalability:1 Order of Magnitude (Animated) R5 R6 R7 R9 R8 R3 R1 R10 R2 R4 RT1 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T4 T2 T5 T8 T3 T9 T10 T1 T7 T6 TTZ 1 One more hierarchies Area 0 Area 1 TTZ Area 0 Area 2 Area 3 Area 4

E2E TE LSP can be set up easily (Animated) Path for LSP is computed easily in a normal way LSP can be set up along the path computed R5 R6 R7 R9 R8 R3 R1 R10 R2 R4 T4 T2 T5 T8 T3 T9 T10 T1 T7 T6 TTZ Source Destination Find path from R3 to R6 in a normal way Find path from T4 to T10 in a normal way T4 T3 T10 T1

Higher Availability The routing tables on P1 and P2 are not re-calculated. There will be no downloading from RIB to FIB. When considering more complex POPs as TTZs, a failure or crash of a router inside a POP will not affect anything outside of POP. And thus availability is higher. Suppose the Link R2-R3 Is Broken Routers outside not aware of this P1 P2 Eth0/0 Eth1/0 Eth0/0 Eth1/0San Francisco R1 R2 R3 R4 Eth2/0 Eth3/0 Eth4/0 Eth3/0 Eth4/0 Eth3/0 Eth2/0 TTZ

Issues in a Bigger Network: Split to Areas (animated) 1. Significant changes on Network Architecture and configuration when split area, service may be interrupted

TTZ Avoids Splitting to Areas (Animated) 1. No need to split area (one area) 2. Smaller changes on Network Architecture and configuration, network is more stable T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T4 T2 T5 T8 T3 T9 T10 T1 T7 T6 TTZ 1 Area 0 T4 T3 T10 T1 T3T3 T T T3T3 T

Page 16 Contents  Why TTZ?  What is TTZ?  Introduction  How TTZ?  OSPF Data Change — I bit  LSA Generation and Flooding  Adjacency Establishment  Routing Table Computation

Page 17 OSPF Data Change — I bit 1 bit to identify if a link is in TTZ 0127 I Link Type I = 1 : Link is in TTZ I = 0 : Link is not in TTZ Meaning of “Link Type” of 7 bits is the same as that of “Link Type” of 8 bits Link Type OptionsLS Age Link State ID LS Sequence Number LS Checksum Advertising Router Length Number of Links I bit = 1 if link in TTZ LS Type = 1 Router Link... Flags Header I bit = 1 if link in TTZ Router LSA

LSA Generation and Flooding Every router in TTZ generates a router LSA containing all the router links, each of which has I bit set to 1 if it is configured with TTZ ID. This LSA is flooded inside TTZ. TTZ virtualized as –A group of routers connected: TTZ edge router constructs a second router LSA and sends it to all its neighbors. This LSA comprises two groups of links. 1.The router links connecting the routers outside of the TTZ from this TTZ edge router. These router links are normal router links. There is a router link for every adjacency between this TTZ edge router and a router outside of the TTZ. 2.The "virtual" router links. For each of the other TTZ edge routers, there is a "virtual" router link to it from this TTZ edge router. The cost of the router link from this TTZ router to one of the other TTZ edge routers is the cost of the shortest path from this TTZ edge router to it. –A single router: DR of TTZ constructs a second router LSA and sends it to all its neighbors. This LSA comprises links between a TTZ edge router and a router outside of TTZ. Page 18

HUAWEI TECHNOLOGIES CO., LTD. Huawei Confidential Page 19 Router LSA Generated by T1/T5 to inside TTZ R6 R7 R8 R10 R9 R4 R1 R2 R11 R3 R5 T4 T2 T5 T8 T3 T9 T10 T1 T7 T6 TTZ OptionsLS Age Link State ID (T1) LS Sequence Number LS Checksum Advertising Router (T1) Length Number of Links I=0 for Normal Link LS Type = 1 Router Link: T1 to R2 Router Link: T1 to T5 Flags Header Router Link: T1 to T2 Router Link: T1 to T4 I=1 for TTZ link OptionsLS Age Link State ID (T5) LS Sequence Number LS Checksum Advertising Router (T5) Length Number of Links I=1 for TTZ Link LS Type = 1 Router Link: T5 to T1 Router Link: T5 to T9 Flags Header Router Link: T5 to T4 Router Link: T5 to T6 I=1 for TTZ link

Page 20 Router LSA by T1 to outside TTZ as a Group of Nodes Connected R6 R7 R8 R10 R9 R4 R1 R2 R11 R3 R5 T4 T3 T10 T1 OptionsLS Age Link State ID (T1) LS Sequence Number LS Checksum Advertising Router (T1) Length Number of Links Normal Link LS Type = 1 Router Link: T1 to R2 Router Link: T1 to T10 Flags Header Router Link: T1 to T3 Router Link: T1 to T4 Normal Link (“virtual”)

Page 21 Router LSA Generated to outside TTZ as a Single Node R6 R7 R8 R10 R9 R4 R1 R2 R11 R3 R5 OptionsLS Age Link State ID (RT) LS Sequence Number LS Checksum Advertising Router (RT) Length Number of Links Normal Link LS Type = 1 Router Link: RT to R2 Router Link: RT to R11 Flags Header Router Link: RT to R3 Router Link: RT to R10 Normal Link RT...

Adjacency Establishment Between TTZ edge and non TTZ router, TTZ edge –for TTZ as a group of routers connected sends non TTZ router hellos in a normal way, and sends non TTZ router all the LSAs except for the LSAs belong to TTZ during LSDB synchronization. –for TTZ as a single router RT sends non TTZ router hellos in a normal way but with RT ID, and sends non TTZ router all the LSAs except for the LSAs belong to TTZ during LSDB synchronization. After adjacency is established, when TTZ edge router floods a LSA, –it only floods the LSA that does not belong to TTZ to the non TTZ router through the adjacency between the TTZ edge router and the non TTZ router. Page 22

Page 23 Routing Table Computation T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T3T3 T10 T10 T4 T2 T5 T8 T3 T9 T10 T1 T7 T6 TTZ 1 Area 0 T3T3 T T T3T3 T Router in TTZ builds SPF tree using topology it sees

Next Step Welcome comments