<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.chakrabarti-nordmark-6man-efficient-nd" target="https://datatracker.ietf.org/doc/html/draft-chakrabarti-nordmark-6man-efficient-nd-04">
   <front>
      <title>Wired and Wireless IPv6 Neighbor Discovery Optimizations</title>
      <author initials="S." surname="Chakrabarti" fullname="Samita Chakrabarti">
         </author>
      <author initials="E." surname="Nordmark" fullname="Erik Nordmark">
         </author>
      <author initials="P." surname="Thubert" fullname="Pascal Thubert">
         </author>
      <author initials="M." surname="Cullen" fullname="Margaret Cullen">
         </author>
      <date month="October" day="21" year="2013" />
      <abstract>
	 <t>   IPv6 Neighbor Discovery (RFC 4861) protocol has been designed for
   neighbor&#x27;s address resolution, unreachability detection, address
   autoconfiguration, router advertisement and solicitation.  With the
   progress of Internet adoption on various industries including home,
   wireless, M2M and cellular networks there is a desire for optimizing
   the legacy IPv6 Neighbor Discovery protocol.  This document describes
   a method of optimization by reducing multicast messages and
   introducing an IPv6 address Registration mechanism.  The optimization
   of IPv6 Neighbor Discovery protocol is useful for Wirless and low-
   power IPv6 networks and as well as Data Centers and Home Networks.
   The solution is capable of handling existing legacy IPv6 nodes in the
   network with local mobility.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-chakrabarti-nordmark-6man-efficient-nd-04" />
   
</reference>
