Analysis of IPv6 routing protocols

OData support
Horváth Zoltán
Department of Networked Systems and Services

In my dissertation I analyse the routing protocols that support Internet Protocol version 6 (IPv6) from points of view of three parameters, the convergence time, the CPU usage, and memory usage. All three parameters are important in a network. The convergence time means the time that the routers need to learn the new, changed network. The lower the convergence time is, the soon the network will function properly after a change. The CPU- and memory usage means that how far a routing protocol needs these two resources to function. The smaller the CPU- and memory usage is, the network is more efficient, the operational costs are lower, the power consumption is lower, and the investment costs decreased. As a result of the analysis of these three parameters, the routing protocols can be compared. Thanks to the three analysed parameters and the conclusion, the networks will be more designable to choose the proper routing protocol for a network, and the proper configuration that satisfies the needs.

In the Chapter 2.1 I give details of the new features of Internet Protocol version 6. In the Chapter 2.2 I introduce the routing protocols generally, and in the Chapter 2.3 I categorize them. The operation of two chosen protocols, the Routing Information Protocol next generation (RIPng), and the Open Shortest Path First version 3 (OSPFv3) are described in detail.

At the analyse of the parameters it was necessary to have some realistic networks, that the calculations, and effects can be shown on. These realistic networks were generated by a program written by me. The networks can be parameterized and based on Barabási-Albert model. I also examine these generated network’s diameter depends on the program input parameters, the number of nodes, and the expected value of degree of nodes.

At the analysis of the convergence time, in the Chapter 4. I give the description of convergence time, the importance of it and the factors that influence it. The factors are described in detail. I show the two chosen routing protocol’s solutions to decrease the convergence time. By means of given network parameters and the generated test networks I calculate the convergence time on the networks that I verify by simulations. Finally I compare the two routing protocol’s results. As a result of the analysis, I can say that the convergence time is depended mainly on the timer configurations of the routing protocols. If it is important to keep low the convergence time then the OSPFv3 is the better choice compared to RIPng.

The analysis of CPU- and memory usage is together, in the Chapter 5. I describe both parameters, the importance of analysis, and the chosen protocols processes, that use these two resources. I show the protocol’s solutions that decrease the need of usage the CPU and memory. Finally I compare the two routing protocol’s results. As a result of this analysis I can say that considering the CPU usage the OSPFv3 is the better choice, but on the other hand RIPng uses less memory to function, so considering the memory usage the RIPng is better.

The results of my analysis can be used when planning or building a network. Thanks to the results of the three analysed parameters, the proper routing protocol can be chosen on the basis of the three parameters in IPv6 environment.


Please sign in to download the files of this thesis.