Routing in Software-Defined Battlefield Networks

State: Assigned to Samuele Giunta

Battlefield Networks often have strong requirements on availability and can experience unreliable connectivity, limited bandwidth, and latency issues. Thus a resilient solution for routing is required in order to ensure reliable communication while minimizing delays and avoiding congested links. New technologies, such as Software-Defined Networking (SDN) and Segment Routing (SR), are used to achieve a fully programmable battlefield network, enabling flexibility and centralized control.

This thesis aims to implement a routing solution for battlefield networks, relying on SDN and SR. The proposed solution should complement traditional routing algorithms, such as OSPF, and take link utilization into account to avoid congested paths as well as minimize delays. The SDN/SR solution should be implemented in Python or C++ and emulated in environments such as IPMininet or GNS3.


Work distribution: 20% Design, 60% Implementation, 20% Documentation
Requirements: Strong Python or C++ skills, basic knowledge of Linux and computer networks

Supervisors: Rafael Hengen Ribeiro

back to the main page