<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.mueller-dkextension" target="https://datatracker.ietf.org/doc/html/draft-mueller-dkextension-01">
   <front>
      <title>Direct Knowledge Extension to Distance Vector Routing</title>
      <author initials="S." surname="Müller" fullname="Sebastian Müller">
         </author>
      <date month="September" day="30" year="2025" />
      <abstract>
	 <t>   Naive Distance Vector-based routing protocols like the Routing
   Information Protocol [RFC_1058] suffer from a phenomena called the
   &quot;count to infinity problem&quot; in the event of a network topology
   change.  This Internet Draft extends a naive Distance Vector routing
   implementation with a simple flag that allows the network to recover
   quickly and reliably, with no chance of routing loops to occur.

Discussion Venues

   This note is to be removed before publishing as an RFC.

   Source for this draft and an issue tracker can be found at
   https://github.com/Sebastianmueller22/network-protocol.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-mueller-dkextension-01" />
   
</reference>
