This research project aims to design routing algorithms that have theoretical worst-case guarantees on the length of the routing path or the number of hops their paths use.
Masters/PHD
Geometric networks are networks where every node has a location associated with it. When two nodes are connected, they know each other's location. These networks are quite well understood and for a number of them efficient routing algorithms are known to exist. The aim of this project is to design routing algorithms that have theoretical worst-case guarantees on the length of the routing path or the number of hops their paths use. In order to achieve these outcomes, we may consider all parts of the design process; from the design to the network and its analysis, to the design of the routing algorithm and proving the guarantees it provides or showing that there can't exist a routing algorithm with certain guarantees.
The opportunity ID for this research opportunity is 2439