Robust Routing Information Updating in IPV6 Networks

Abstract

The mechanism that classical routing protocols use to transmit routing updates and to maintain adjacency can be susceptible to packets loss and to bandwidth limitation. We propose a new method for transmitting routing information and hello information which can assure delivery even if the links are lossy or their capacity is limited. This method is adapted to IPv6 packets and, with the implementation of a routing algorithm, it builds the routing tables.