Refine
Document Type
- Bachelor Thesis (3) (remove)
Keywords
- Routing (3) (remove)
Institute
- Fachbereich 4 (3) (remove)
Due to the incorrect allocation management and the continuous increase of internet-capable devices, IPv4-adresses are nearly exhausted. For this reason and because of new requirements demanded by the technique of the internet the IPv6-protocol has been developed. The IPv6-protocol provides a larger adress space and will gradually replace the IPv4-protocol. However, the routing-protocols have to be adapted to the new internetprotocol. This paper will introduce and analyse the dynamic Routing-Information-Protocol RIPng which in itself is an inter-gateway protocol (IGP). The routers inside the network can exchange information about their different connections over this protocol. Furthermore, this paper will explain the basics of the IPv6-protocol, of the used protocol-algorithm as well as of the RIPv2-protocol. In the practical part of the paper the Counting-to-Infinity-Problem and some attributes of RIPng will be reviewed under the IPv6-protocol.
The advantage of virtual networks is to test routing-algorithms or distributed software in an easy-to-use, cheap and well-arranged way. Optimized Link State Routing (OLSR) and Babel are two modern routing-algorithms for mobile ad-hoc networks that distinguish faulty links from good link connections in their routing process. Typically virtual networks provide nearly perfect link connections without any network traffic disruptions. The Traffic Control (tc) tool is able to manipulate connections in terms of delay and packet loss.
In this bachelor thesis virtual network scenarios are created with VNUML and Qemu and manipulated with tc in order to analyze the behavior of ad-hoc routing algorithms like Babel and OLSR. The behavior of well-known TCP congestion control algorithms, e.g., TCP Vegas and TCP Reno are analyzed, too.
In this thesis we discuss the increasingly important routing aggregation and its consequences on avoiding routing loops. As basis for implementation and evaluation I will use the RMTI protocol, developed at the University of Koblenz, which is an evolution of the RFC2453 specified in the Routing Information Protocol version 2. The virtual network environment Virtual Network User Mode Linux (VNUML) is used within this thesis as environment. With VNUML it is possible to operate and evaluate real network scenarios in a virtual environment. The RMTI has already proven its ability to detect topological loops and thereby prevent the formation of these routing loops. In this thesis we will describe the function of the RMTI and then discuss under which circumstances we can use routing aggregation, without it resulting in routing anomalies. In order to implement these changes it is essential to have a deeper understanding of the structure of routing tables, so the construction will be explained using reference to examples. There follows a description of which points have to be changed, in the RMTI in order to avoid loops despite aggregation. In Summary we will evaluate the affect the routing aggregation has on the reorganization ability of the virtual network.