Master thesis Scalable ID-based Routing

Description

Due to their overhead, classic routing protocols only work in networks up to a certain size (e.g. a few hundred routers or networks). However, future network infrastructures will also contain many virtual components, so that scalability requirements of several 10,000 to 10,000 nodes exist. A corresponding procedure called KIRA has been developed at the institute, but this is to be further investigated, expanded and improved. The protocol is to form the basis for the self-organizing control level of future networks (e.g., 6th Generation mobile networks).

The Topics

Various aspects can be investigated as part of the thesis (Master or Bachelor if not explicitly stated), including (selection of topics):

• Integration of landmark routing in KIRA (Master)
  • Landmarks can be used to improve the efficiency of routes (stretch)
  • Design of a concept for the integration of landmarks in KIRA
  • Implementation and evaluation in C++-based simulator
• Investigation of the behavior in mobile ad-hoc and mesh networks
• Use of KIRA in a Wi-Fi mesh
  • Use of the Rust prototype with Raspberry Pis
  • Analysis of protocol overheads and protocol parameter tuning if necessary
• Optimizations (improvement of route selection)
• Quality of service support

For bachelor theses, only parts of the aforementioned aspects are examined accordingly. An implementation of the routing protocol has already been implemented in an OMNeT++-based simulator and would have to be extended accordingly. Using the simulator, investigations into scalability and overhead, stability, robustness, etc. can be carried out relatively easily. A prototype implementation in Rust is used on Linux-based systems.