Skalierbares ID-basiertes Routing

  • chair:Routing, Software-Defined Networking, Network Function Virtualization
  • type:Master/Bachelor
  • time:ab sofort
  • advisor:

     Dr. Roland Bless

Master thesis Scalable ID-based Routing

Description

Due to their overhead, classical routing protocols only work in networks up to a certain size (e.g. a few hundred routers or networks). Future network infrastructures, however, will also contain many virtual components, so that scalability requirements of several 10000 to 100000 nodes exist here. A corresponding approach named KIRA has been developed at the institute, which, however, is to be further investigated, extended and improved. The routing protocol is intended to be used in the control plane of future 6G networks.

Task

 

Within the scope of the thesis (Master or Bachelor), aspects of dynamic routing after failure of nodes and links can be investigated. 

  • Investigation of mobility aspects
    (background: moving end-systems in 6G networks, implementation of mobility models in the simulator, if necessary: improvement of the protocol by designing specific mobility support mechanisms)
  • Investigation of mobile ad-hoc or mesh networks
  • Optimizations (Improvement for finding and selecting better paths)
  • Multi-domain Routing
  • Analysis of use in LEO satellite networks
  • Quality-of-Service support
  • Improvement of the routing by introducing landmarks

Accordingly, for bachelor theses only parts of the previously mentioned aspects are investigated. An implementation of the routing protocol is already implemented in an OMNeT++-based simulator and would have to be extended accordingly. Using the simulator, investigations of scalability and overhead, stability, robustness, etc. can be carried out relatively easily.