Home > Articles > Cisco Network Technology > General Networking > Using TRILL, FabricPath, and VXLAN: IS-IS Intra Domain Routing Protocol

Using TRILL, FabricPath, and VXLAN: IS-IS Intra Domain Routing Protocol

  • Sample Chapter is provided courtesy of Cisco Press.
  • Date: Feb 14, 2014.

Chapter Description

This chapter covers the control plane aspects of TRILL and FabricPath. It provides an overview of IS-IS followed by a detailed description of the changes that were made in IS-IS to support TRILL.


This section explains the fundamental concepts behind link state protocols. Routing protocols can be classified in to Distance Vector Protocols such as Routing Information Protocol (RIP),3 Enhanced Interior Gateway Routing Protocol (EIGRP)4, and so on and as Link State Protocols such as Open Shortest Path First (OSPF)2 and IS-IS. The basic idea behind link state protocols is that each node is made aware of the entire network topology. The protocol ensures that all the nodes have accurate information of the entire topology. Then, all the nodes independently run the same Shortest Path First (SPF) algorithm to compute the shortest route between each node. Because the topology information is the same, the route computation will also be the same at all the nodes. Synchronizing the topology database with the neighbors and computing the routes are independent operations and can be done in parallel. The mechanism by which this is achieved is left to the details of the individual protocol. Now consider a simple topology, as shown in Figure 3-1, to illustrate neighbor discovery, topology exchange, and synchronization in an IS-IS network. Assume that a new node (labeled as “G” in Figure 3-1) is connected to the network. A typical link state protocol has multiple stages.

Figure 3-1

Figure 3-1 IS-IS Network

Neighbor Discovery

Neighbor discovery is the first stage of the protocol in which a node discovers its neighbors. Every node sends a multicast packet on all the interfaces configured for the link state protocol to run. This packet contains the properties of the protocol. The other routers respond to this packet with their capabilities. After processing the information, the router accepts or rejects the adjacent nodes as neighbors. The next section on IS-IS goes into the specifics that detail the packet format, the three-way hand shake, and so on. Every node also sends a periodic keepalive packet. When the keepalive packet is not heard for a specific duration, the corresponding neighboring router is considered unreachable and not taken into consideration for computing routes. For the topology shown in Figure 3-1, after the neighbor discovery phase, node G would have established nodes E and F as its neighbors and vice versa.

Topology Exchange

As stated previously, every node has the complete topology information. This means that the amount of data exchanged between the nodes is large and, needless to say, it increases with the increase in the number of nodes in the topology. During every topology change, such as link failures, the node going down triggers topology updates. The obvious intention of any routing protocol is to minimize the number of times the route computation algorithm is run, minimize the number of topology updates, and reduce the size of the topology updates whenever possible.

After the neighbor discovery is done, the nodes exchange in short packets, describing the revision of the topology information it has. If both the nodes have the same information, no exchange of topology is needed. Otherwise, the node having the latest information sends only the portion of the topology database, which is out of date in the neighbor node. In this way, topology information is exchanged only when needed. Considering the topology shown in Figure 3-1 because node G’s topology database is empty, it can request nodes E and F to send the entire database.


Information about new nodes or network changes is propagated to all the nodes in the network through flooding. The idea behind flooding is simple. A change picked up by a node is transmitted on all the links where the link state protocol is configured. The other nodes, after receiving the flood packet, in turn send it out on all its links, except the link through which the packet arrived. This process continues until all the nodes have obtained the packet. It is normal for a node to receive multiple copies of the same packet. Usually, the classic split horizon rule is employed, wherein a node will not transmit the packet back to the neighbor from which it received the announcement. There are other optimizations employed like having a hold-down timer, wherein after receiving a flood packet, it is not transmitted immediately but transmitted after waiting for a small random time. There are numerous optimizations proposed for flooding that include limiting the number of duplicate packets, corruption detection, versioning of the flooded packets, and so on. You see how IS-IS handles some of these in the subsequent sections. For a deep dive on this, refer to the reference for IS-IS.1 Refer to the topology shown in Figure 3-1. As soon as the nodes E and F detect the new neighbor G, they will flood the topology change information to their neighbors. In this example, node E sends the information to node C, and node F sends the information to node D. Nodes C and D in turn flood the information to both the nodes A and B. In this way, all the nodes in the network have the same topology information.

Route Computation

After a node has built its database, it calculates the shortest path to all the other nodes in the network. Usually Dijkstra’s shortest path first (SPF) algorithm is employed. This algorithm was originally proposed for Graph Theory, wherein each vertex is treated as a node, and the edges connecting the vertices are the links connecting the nodes. The cost of the edges is the metric associated with the link. When the network topology is redrawn by only considering the path computed by SPF algorithm, it forms a spanning tree with itself as the root. The tree is composed of the shortest path from the root to all the other nodes in the network. Because a tree is an acyclic graph, there are no loops. This plays an important role in how TRILL and FabricPath support forwarding of multidestination frames. For the topology shown in Figure 3-1, every node computes a shortest path to reach the new node G. In this topology, node A has two equal cost paths to reach node G, assuming the metric of all the links are the same. The two equal cost paths are A-C-E-G and A-D-F-G.

Link State Protocol Scaling

Scaling poses a big threat especially to link state protocols. Recall that all the nodes maintain the topology of the entire network. The higher the number of nodes, the higher the size of the database maintained by each node and the higher the time spent by each CPU to compute the routes. Because flooding is the mechanism used to propagate the database, any topology change can trigger a flood, the effects of which will be severe for a larger network. The higher the floods, the higher the network traffic and time spent by the CPU in processing the messages. To address the scalability concern, link state protocols usually divide the network into areas. Flooding is limited to an area. Flood packets originated within an area are not sent to other areas. Flood packets terminate at the area boundary. Each area has a border router that synchronizes the database with the border router of the adjacent area. The database that gets synchronized between the border routers and later on distributed inside an area is summarized and not the complete database of the other area. Limiting the scope of flooding and the size of the database can improve the scalability by a big factor.

Link State Protocol in a Local Area Network

Figure 3-1 has routers connected to each other through point-to-point links. But it is not uncommon for multiple routers to be connected through a shared media or a local-area network (LAN) as shown in Figure 3-2.

Figure 3-2

Figure 3-2 IS-IS LAN Network

In this example, Routers R1, R2, and R3 that are running a link state protocol have one of their ports connected to the LAN. R1, R2, and R3 can see each other as neighbors. Even though they are part of the LAN, neighbor discovery, topology exchange, and flooding of information happen between every peer (or neighbor pairs). When the number of routers connected to the LAN increases, the number of peers increases, and this increases the number of messages seen in the network, the redundant information in the messages leading to increased CPU utilization in the routers to process extra messages and compute the routes. To get around this issue, the concept of designated router (DR in OSPF) or designated intermediate-system (DIS in IS-IS) was introduced. A DR or DIS is elected among all the routers in the LAN during the neighbor discovery phase. Figure 3-2 shows R1 as the DIS. A DR or DIS has the following additional functionality:

  • All the routers synchronize their database only with the DR or DIS.
  • The DR or DIS synchronizes the topology database information with the rest of the LAN.
  • All the routers in a network form a neighbor relationship only with the DR in OSPF. In IS-IS, a full mesh of adjacencies is established.

This scalability issue is seen not only within the LAN, but also in the routers that are not a part of the LAN but are directly connected to the routers in the LAN, as shown in Figure 3-3.

Figure 3-3

Figure 3-3 IS-IS LAN Connected to an External Router

In Figure 3-3, an external Router R4 is connected to both R1 and R2 but is not a part of the LAN. If every router in the LAN includes all the nodes in its topology database as a part of its topology database advertisement to the external router, this can lead to a lot of redundant information being carried, and a single topology advertisement can become big. So, the concept of pseudo-node was introduced, wherein a special message is sent with the pseudo-node as the source of the advertisement that includes reachability to all the other nodes in the LAN with a cost of zero. The DR or DIS sends this special advertisement. When the routers in the LAN advertise their topology database to the external routers, they just advertise the reachability to the pseudo-node (or virtual node) with the actual cost of the broadcast link rather than advertising their reachability to all the other nodes in the LAN. The logical topology as viewed by the external routers after processing the topology advertisements from the routers in the LAN is shown in Figure 3-4. There is no pseudo-node in the actual physical topology. The pseudo-node will be seen as another router connected to all the routers in the LAN. Running a link state protocol in a LAN environment introduces a lot of additional complexities as discussed in this section. A link state protocol in a LAN environment is a detailed topic and you are encouraged to refer to IS-IS1 and OSPF2 for additional details.

Figure 3-4

Figure 3-4 IS-IS Pseudo-Node

3. IS-IS Architecture Details | Next Section Previous Section

Cisco Press Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from Cisco Press and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about Cisco Press products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites; develop new products and services; conduct educational research; and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@ciscopress.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by Cisco Press. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.ciscopress.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020