University of Twente Student Theses


The burden and information gain of path-based topology discovery

Hendriks, Remi (2021) The burden and information gain of path-based topology discovery.

[img] PDF
Abstract:There exist many routing algorithms for networks that allow nodes to efficiently send messages through a network, these algorithms require a map of the network. One method for gaining knowledge about the topology of a network is to store the path a packet has taken and include it in the packet header. This will burden the network with the extra required overhead to share the paths of packets, however a lot of information can be gained from analyzing this data. This paper will analyze the information gain and burden of this method. To accomplish this, we will write software that examines received packets from a simulated network and updates routing tables based on the paths these packets took. Statistics about information gain will be examined and presented
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:54 computer science
Programme:Computer Science BSc (56964)
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page