Method for adjacency information updating in IPv6 networks

In this paper we present a method of transmitting routing updates in IPv6 networks. Routing protocols that use discrete packets to send/receive routing updates are susceptible to instability in a limited bandwidth or lossy links environment. We study and compare our method with OSPF and EIGRP and show that it stabilizes more rapidly. By design, our method is robust and it is not susceptible to bandwidth limitation and to the degree of lost packets like other routing protocols.