<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-rtgwg-igp-shortcut" target="https://datatracker.ietf.org/doc/html/draft-ietf-rtgwg-igp-shortcut-01">
   <front>
      <title>Calculating Interior Gateway Protocol (IGP) Routes Over Traffic Engineering Tunnels</title>
      <author initials="H." surname="Smit" fullname="Henk Smit">
         </author>
      <author initials="N." surname="Shen" fullname="Naiming Shen">
         <organization>Redback Networks</organization>
      </author>
      <date month="May" day="24" year="2004" />
      <abstract>
	 <t>This document describes how conventional hop-by-hop link-state routing protocols interact with new Traffic Engineering capabilities to create Interior Gateway Protocol (IGP) shortcuts.  In particular, this document describes how Dijkstra&#x27;s Shortest Path First (SPF) algorithm can be adapted so that link-state IGPs will calculate IP routes to forward traffic over tunnels that are set up by Traffic Engineering.  This memo provides information for the Internet community.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-rtgwg-igp-shortcut-01" />
   
</reference>
