1 Introduction to ISIS SI-E Workshop AfNOG 2012 - The Gambia Noah Maina.

Slides:



Advertisements
Similar presentations
Introduction to OSPF Mark Tinka. Routing and Forwarding  Routing is not the same as Forwarding  Routing is the building of maps Each routing protocol.
Advertisements

Introduction to OSPF.
Lonnie Decker Multiarea OSPF for CCNA Department Chair, Networking/Information Assurance Davenport University, Michigan August 2013 Elaine Horn Cisco Academy.
ISIS and OSPF: Network Design Comparisons and Considerations Roosevelt Ferreira Professional Services Engineer
Future Directions For IP Architectures Ipv6 Cs686 Sadik Gokhan Caglar.
IPv6 Routing IPv6 Workshop Manchester September 2013
ISIS Advanced Routing Workshop AfNOG IS-IS Standards History  ISO specifies OSI IS-IS routing protocol for CLNS traffic Tag/Length/Value.
Release 5.1, Revision 0 Copyright © 2001, Juniper Networks, Inc. Advanced Juniper Networks Routing Module 4: Intermediate System To Intermediate System.
Shivkumar Kalyanaraman 1 Reference: IS-IS vs OSPF Shivkumar Kalyanaraman Rensselaer Polytechnic Institute Abstracted from NANOG talks.
© 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.
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.
Extending Networks. Three Levels of Extension Physical Layer –Repeaters Link Layer –Bridges –Switches Network –Routers: “Connecting networks”
Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
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.
Presentation Title Subtitle Author Copyright © 2002 OPNET Technologies, Inc. TM Introduction to IP and Routing.
© 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 11-Sep-15 S Ward Abingdon and Witney College Link State CCNA Exploration Semester 2 Chapter 10.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
1 Routing Protocols. 2 Distributed Routing Protocols Rtrs exchange control info Use it to calculate forwarding table Two basic types –distance vector.
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
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
© 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.
CS 540 Computer Networks II
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.
© 2006 Cisco Systems, Inc. All rights reserved. BSCI v3.0—4-1 The IS-IS Protocol Introducing IS-IS and Integrated IS-IS Routing.
Link State Routing NETE0521 Presented by Dr.Apichan Kanjanavapastit.
86th IETF, Orlando, March 2013 IS-IS Support for Unidirectional Links draft-ginsberg-isis-udl-00.txt Les Ginsberg
 Development began in 1987  OSPF Working Group (part of IETF)  OSPFv2 first established in 1991  Many new features added since then  Updated OSPFv2.
IS-IS An introduction to IGP routing protocols Hagai Kahana.
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 Planning Routing Implementations.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
1 Chapter 14-16a Internet Routing Review. Chapter 14-16: Internet Routing Review 2 Introduction Motivation: Router performance is critical to overall.
Comparing ISIS and OSPF
111 © 2002, Cisco Systems, Inc. All rights reserved. Presentation_ID.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
86th IETF, Orlando, March 2013 Flooding Scope PDUs draft-ginsberg-isis-fs-lsp-00.txt Les Ginsberg Stefano Previdi.
IS-IS Suman Pandey As a part of EECS702: Topics in Computer Systems - Future Internet (Spring 2008)
1 Introduction to ISIS AfNOG 2011 SI-E Workshop. 2 IS-IS Standards History  ISO specifies OSI IS-IS routing protocol for CLNS traffic A Link State.
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,
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Dynamic Routing Protocols II OSPF
Link State Routing protocol
draft-litkowski-isis-yang-isis-cfg IETF 90 - Toronto
Multi-Instances ISIS Extension draft-ietf-isis-mi-08.txt
Scalable Infrastructure Workshop AfNOG 2010
OSPF (Open Shortest Path First)
Routing/Routed Protocols
ISIS Flooding Reduction in MSDC
Instructor Materials Chapter 10: OSPF Tuning and Troubleshooting
13.3 OSPF: Open Shortest Path First.
Link State Algorithm Alternative to distance-vector
Similar Yet Different Protocol Design Choices in IS-IS and OSPF
Dynamic Routing Protocols II OSPF
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Cisco networking, CNET-448
BSCI Module 4 Lesson 1 Introducing IS-IS and Integrated IS-IS Routing
Dynamic Routing Protocols part3 B
Chapter 10: OSPF Tuning and Troubleshooting
Presentation transcript:

1 Introduction to ISIS SI-E Workshop AfNOG The Gambia Noah Maina

2 IS-IS Standards History  ISO specification that defines IS-IS as an OSI routing protocol for CLNS traffic A Link State protocol with a 2 level hierarchical architecture With Type/Length/Value (TLV) options for protocol enhancements  The RFC 1195 added Support for IP Thus Integrated IS-IS I/IS-IS runs on top of the Data Link Layer or rather L2 Requires CLNP (Connectionless Network Protocol) to be configured  RFC5308 adds IPv6 address family support to IS-IS  RFC5120 defines Multi-Topology concept for IS-IS Permits IPv4 and IPv6 topologies which are not identical

3 ISIS Levels  ISIS has a 2 layer hierarchy; Level-1 (the areas) Level-1 (the backbone)  A router can be either; Level-1 (L1) router Level-2 (L2) router Level-1-2 (L1L2) router

4 ISIS Levels  Level-1 router Has neighbours only on the same area Has a level-1 LSDB with all routing information for the area  Level-2 router May have neighbours in the same or other areas Has a Level-2 LSDB with all routing information about inter-area  Level-1-2 router May have neighbours on any area. Has two separate LSDBs: level-1 LSDB & level-2 LSDB

5 Backbone & Areas  ISIS does not have a backbone area as such (like OSPF typical area 0)  Instead the backbone is the contiguous collection of Level-2 capable routers  ISIS area borders are on the wire or rather links and not routers  Each router is identified with a unique Network Entity Title (NET) NET is a Network Service Access Point (NSAP) where the n-selector is 0 (Compare with each router having a unique Router-ID with IP routing protocols)

6 L1L2 L1-only L2-only L1-only Area-2 Area-1 Area-3 Area-4 L1-only L1, L2, and L1L2 Routers

7 NSAP and Addressing  NSAP: Network Service Access Point Total length between 8 and 20 bytes Area Address: variable length field (up to 13 bytes) System ID: defines either an ES or IS in an area. NSEL: N-selector. identifies a network service  NET: The address of the network entity itself Example aaaa.bbbb.cccc.00 Where, – Area Address = – SysID = aaaa.bbbb.cccc – Nsel = 00

8 49.0f f f f f f f Area 1 Area 3 Area 4 Area 2 Typical NSAP Addressing

9 Addressing Common Practices  ISP's typically choose NSAP addresses thus: First 8 bits – pick a number (usually 49) Next 16 bits – area Next 48 bits – router loopback address (BCP) Final 8 bits – zero  Example: NSAP: Router: (loopback) in Area 1

10 Addressing & Design Practices  ISPs typically use one area (eg ) Multiple areas only come into consideration once the network is several hundred routers big  NET begins with 49 “Private” address range  All routers are in L2 only (Core Network) Note: Cisco IOS defaults to L1L2 Set L2 under ISIS router configuration (can also be done per interface)

11  Hello Protocol Data Units (PDUs) are exchanged between routers.  Typically to establish and maintain adjacencies between IS's.  IS-IS area addresses are also exchanged in this IIH PDUs.  A PDU is an IS-IS equivalent of a packet ISIS adjacency through IIH Adjacencies – Hello PDU (IIS)

12 Link State PDU (LSP)  Each router creates an LSP and floods it to neighbours  A level-1 router will create level-1 LSP(s)  A level-2 router will create level-2 LSP(s)  A level-1-2 router will create Independent level-1 LSP(s) and Independent level-2 LSP(s)

13 The ISIS LSP  LSPs have a Fixed Header and TLV coded contents  Typically an LSP header contains LSP-id Sequence number Remaining LifetimeChecksum Type of LSP (level-1, level-2) Attached bit Overload bit  The LSP contents are coded as TLV (Type, Length, Value) and contain; Area addresses IS neighbours Authentication Information

14 Link State Database Content  Each IS maintains a separate LSDB for either level-1 or level-2 LSPs  The LSDB contains: LSP headers and contents SRM = Send Routing Message SSN = Send Sequence Number SRM bits: set per interface when a router has to flood an LSP through that interface SSN bits: set per interface when router has to send a PSNP for this LSP

15 Flooding of LSPs  New LSPs are flooded to all neighbors  All IS's get all LSPs  Each LSP has a sequence number  There are 2 kinds of flooding: Flooding on a point to point link and Flooding on a LAN

16 Flooding on a p2p link  Once the adjacency is established either routers send CSNP packet.  And in case of any missing LSP's, if not present in the received CSNP both routers would send a request!!!!!  This is done through a PSNP packet request  PSNP (Partial Sequence Number PDU)  CSNP (Complete Sequence Number PDU)

17 Flooding on a LAN  Each LAN has a Designated Router (DIS)  The DIS has two tasks Conducting LSP flooding over the LAN Creating and updating a special LSP describing the LAN topology (Pseudo-node LSP)  DIS election is based on priority Best practice is to select two routers and give them higher priority Thus, in case of any failure one provides deterministic backup for the other DIS Tie breaker is router with the highest MAC address

18 Flooding on a LAN Cont...  DIS conducts the flooding over the LAN  DIS multicasts CSNP every 10 seconds  All routers on the LAN check the CSNP against their own LSDB.  In case of any missing content withing the LSP, the IS may request for specific re- transmissions of uptodate LSP's via a PSNP request

19 Complete Sequence Number PDU  Used to distribute a routers complete link- state database  If the LSDB is large, multiple CSNPs are sent  Used on 2 occasions: Periodic multicast by DIS (every 10 seconds) to synchronise the LSDB over LAN subnets On p2p links when link comes up

20 Partial Sequence Number PDUs  Typically exchanged on p2p links, PSNP are used to ack and request link-state info  Two functions Acknowledge receipt of an LSP Request transmission of latest LSP  PSNPs describe LSPs by its header LSP identifier Sequence number Remaining lifetime LSP checksum

21 Network Design Issues  As in all IP network designs, the key issue is the addressing layout  ISIS supports a large number of routers in a single area  When network is so large requiring the use of areas, employ summary-addresses  >400 routers in the backbone is quite doable … according to Philip Smith :-)

22 Network Design Issues  Link cost Default on all interfaces is 10 (Compare with OSPF which sets cost according to link bandwidth) Manually configured according to routing strategy  Summary address cost Equal to the best more specific cost  Backbone has to be contiguous Ensures continuity through redundancy  Area partitioning Design in a way that backbone can NOT be partitioned

23 Scaling Issues  Areas vs. single area Use areas where  sub-optimal routing is not an issue  areas with one single exit point  Start with L2-only everywhere Thus future implementation of any level-1 areas would become easier Backbone continuity is ensured from start

PoP 1 PoP 3 PoP 4 PoP 2 Typical ISP Design All routers are in L2 only and only one area is used

25 Asante Sana./noah noah(at)neo.co.tz