Scribd
Upload
68 views

IS-IS Routing Process: Update Decision Q W e

IS-IS is a link-state routing protocol that uses different types of hello packets to discover neighbors. It generates link-state packets (LSPs) that are flooded throughout the network, and uses the Dijkstra algorithm to calculate the shortest path tree and routing table. It elects a designated intermediate system using priority and interface identifiers. IS-IS prefers internal routes over external ones, level-1 routes within an area over level-2 routes outside the area, and will forward to the nearest level-2 router if no path is available.

Uploaded by

sridhar reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views

IS-IS Routing Process: Update Decision Q W e

IS-IS is a link-state routing protocol that uses different types of hello packets to discover neighbors. It generates link-state packets (LSPs) that are flooded throughout the network, and uses the Dijkstra algorithm to calculate the shortest path tree and routing table. It elects a designated intermediate system using priority and interface identifiers. IS-IS prefers internal routes over external ones, level-1 routes within an area over level-2 routes outside the area, and will forward to the nearest level-2 router if no path is available.

Uploaded by

sridhar reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

IS-IS Routing Protocol – Cheatsheet – Part-2 Version 2

IS-IS Routing Process

1 UPDATE LSPs are generated and flooded throughout the network


IS-IS Hello
Types
2 DECISION Create SPT & Routing table based on Dijkstra’s algorithm
www.networkwalks.com

3 FORWARDING forwarding database is created www.networkwalks.com q ESH


(ES Hello)
w ISH
(IS Hello)
e IIH
(IS to IS Hello)

4 RECEIVE After receiving a frame, IS-IS checks it, passes user data and error reports
to the FORWARDING process & Routing info to UPDATE process
Sent by ES to an IS Sent by IS to an ES Sent between two ISs

IS-IS Tables
NEIGHBOUR Table All Adjacent Routers List

IS-IS Packet Format TOPOLOGY Table


LSA’s Table (complete info about the
networks in same area)
8 16 24 32
ROUTING Table Best Routes www.networkwalks.com
Version /
IRPD Length ID Length
Protocol ID

Reserved PDU Type Version Reserved IS-IS Route Types


Max Area
Type Length
i* IS-IS Default Route
Address
i L1 IS-IS Level-1 Route

Value i L2 IS-IS Level-2 Route


i su IS-IS Summary Route www.networkwalks.com

L2 Header IS-IS Header IS-IS Data IS-IS DIS (DR) Election


1. Highest Interface Priority (Default interface priority = 64)
2. Highest SNPA (MAC/DLCI)
3. Highest System-ID
www.networkwalks.com

IS-IS Rules to find best Route


✓ Internal paths are always preferred over External paths
✓ Level-1 paths within the area are preferred over Level-2 paths outside the area
Other IS-IS Intervals
Timer/Interval Value
✓ If there is no path, the forwarding database sends the packet to the nearest
Level-2 Router
LS AGING 1,200 sec or 20 min (counts down)
www.networkwalks.com LS REFRESH Every 15 min
SPF DELAY /HOLDTIME 5.5 sec / 10 sec

New batch of online Cisco CCNA 200-301 is starting!


Enrol today with us for quality training: [email protected]

/Network Walks /NetworkWalks /company/networkwalks


Visit our website & You Channel for more FREE resources like Cheatsheets,
Workbooks, Labs, Interview Questions, Quiz, VCE exams

Network Walks Training Academy www.networkwalks.com


Your Feedback, Comments are always Welcomed: [email protected]

You might also like