Loop detection and automated route aggregation in distance vector routing

In this paper, a distance vector routing algorithm for IP computer networks is presented which is able to aggregate routes automatically and detect and prevent routing loops even on the aggregated routes. Route aggregation is the method of summarizing two or more routes to the corresponding destination IP subnetwork addresses into one common IP prefix address. Thus, it enables non-hierarchical network scalability by keeping the volume of routing and forwarding information within a reasonable size. Nevertheless, under certain circumstances route aggregation can cause network anomalies, e.g., routing and forwarding loops, which can seriously impact the performance and failure safety of the whole computer network. We describe an approach based on well-known Routing Information Protocol (RIPv2) that allows for the automation of route aggregation without manual intervention and still ensures loop-free forwarding paths and, therefore, short convergence times.