IS-IS and fast convergence ongoing tricks

March 22nd, 2009 mmahmoud Posted in Bury the hatchet, ISIS, MPLS, Network Design 6 Comments »

Been a while since my last post, I was extremely busy doing a lot of things, anyway I am glade to be back.
This post I am going to cover a nice tool for enhancing IS-IS convergence, I am really amazed by the ideas that the guys out there pop up. Inventing such wonderful tools requires [...]

AddThis Social Bookmark Button

OSPF & IS-IS Router ID

March 2nd, 2009 Wael Osama Posted in ISIS, OSPF 4 Comments »

When you think about Router ID in any link state protocol  two requirements come to mind:

Each router must be identified by a Router ID and an Area to exist in.
This Router ID must be unique inside a single IGP domain.

IS-IS refers to the this ID as a System ID (SysID) and OSPF refers to this [...]

AddThis Social Bookmark Button

Link state protocols and Areas concept

February 23rd, 2009 Wael Osama Posted in ISIS, Network Design, OSPF 8 Comments »

Link state protocols have introduced the concept of multiple routing areas withing the same routing domain. Link state protocols depend on the fact that all routers must have an identical link state database and then each router will start calculating its very own routing table from this information.
However, this rule sometimes introduce scalability limitations to [...]

AddThis Social Bookmark Button

Fast Convergence: IS-IS performance tuning

December 5th, 2008 Wael Osama Posted in ISIS, Network Design 1 Comment »

IS-IS is the most selected protocol by service providers and large carriers all over the world; this is what makes the understanding  of this protocol important. We have been discussing fast convergence and high availability in the latest few posts and this post is not different, I am just going to give you an overview [...]

AddThis Social Bookmark Button

Fast Convergence: Partial SPF calculation

December 3rd, 2008 Wael Osama Posted in IGP, Network Design 1 Comment »

Shortest path first (SPF) is the algorithm used by IS-IS and OSPF routing protocols to calculate the topological information from the received link state updates. You can find more information about SPF calculation follow the link Dijkstra’s algorithm.
Partial SPF is an efficient shortcut used by the routers to speed up the process of route calculations [...]

AddThis Social Bookmark Button

Fast convergence overview

November 23rd, 2008 Wael Osama Posted in IGP, Network Design 1 Comment »

For a network to converge, all routers in the network must collect and agree on all the topology information from each other. This information must be consistent, reflecting the current state of the network and free of routing loops or any other kinds of corruption.
What is meant by fast convergence?
when we use the word fast [...]

AddThis Social Bookmark Button

IS-IS explained Part2 (Routing Levels)

November 11th, 2008 Wael Osama Posted in ISIS No Comments »

The concept of Areas was introduced in OSPF or link state protocols in general and routers had different roles based on their location in the topology. We have backbone routers, Area border routers, ASBRs and so on. IS-IS is implementing the same concept of areas named as routing domains and introduced the following routers roles:

Level1 [...]

AddThis Social Bookmark Button

What is Integrated ISIS?

November 5th, 2008 Wael Osama Posted in ISIS, What Is ? No Comments »

The IS-IS Routing Protocol may be used as an IGP to support IP as well as OSI. This allows a single routing protocol to be used to support pure IP environments, pure OSI environments, and dual environments. Integrated IS-IS is deployed extensively in an IP-only environment in the top-tier Internet service provider (ISP) networks. The [...]

AddThis Social Bookmark Button

IS-IS explained (Part1)

November 5th, 2008 Wael Osama Posted in ISIS No Comments »

IS-IS was developed for OSI routing then extended to support IP by Integrated IS-IS.
IS-IS is an IGP used for routing within a single administrative domain.
IS-IS is a Link state routing protocol and uses the SPF algorithm for computing best paths just like OSPF.
Below is a comparison between IS-IS and OSPF:

Similarities:

Both are link-state routing protocols.
Both are [...]

AddThis Social Bookmark Button

OSPF Virtual-links vs GRE tunnels

October 21st, 2008 Wael Osama Posted in OSPF No Comments »

Everyone who works in networking knows that every area in the OSPF domain must be connected to the backbone area (Area0). The reason behind this constrain is explained here. However it may be difficult for some reason to physically connect an area to the backbone; in such cases you will have to provide a logical [...]

AddThis Social Bookmark Button