<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.jen-apt" target="https://datatracker.ietf.org/doc/html/draft-jen-apt-01">
   <front>
      <title>APT: A Practical Transit Mapping Service</title>
      <author initials="D." surname="Jen" fullname="Dan Jen">
         </author>
      <author initials="M." surname="Meisel" fullname="Michael Meisel">
         </author>
      <author initials="D." surname="Massey" fullname="Dan Massey">
         </author>
      <author initials="L." surname="Wang" fullname="Lan Wang">
         </author>
      <author initials="B." surname="Zhang" fullname="Beichuan Zhang">
         </author>
      <author initials="L." surname="Zhang" fullname="Lixia Zhang">
         </author>
      <date month="November" day="19" year="2007" />
      <abstract>
	 <t>The size of the global routing table is a rapidly growing problem.
Several solutions have been proposed.  These solutions commonly
divide the Internet into two address spaces, one for determining the
delivery location, and one to use during transit.  Packets destined
for delivery addresses are tunneled through the default-free zone
(DFZ), which uses only transit addresses.  For this process to work,
there must be a mapping service that can supply an appropriate
destination transit address for any given delivery address.  We
present a design for such a mapping service.  We adhere to a &quot;do no
harm&quot; design philosophy: maintain all desirable features of the
current architecture without negatively affecting its security or
reliability.  Our design aims to minimize delay and prevent loss in
packet encapsulation, minimize the number of modifications to
existing hardware, minimize the number of new devices, and keep the
level of control traffic manageable.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-jen-apt-01" />
   
</reference>
