Traditional network routing algorithms concentrate on maximising utilisation of network resources, without awareness of mission parameters. This results in saturation of bandwidth, while not necessarily guaranteeing the success of high level specifications such as deadlines on file transfer. This project uses constraint programming techniques to allocate bandwidth in field-deployed networks. The resulting algorithms provide probabilistic guarantees on the satisfaction of mission level constraint under uncertainty in network characteristics.
If you would like to contact us about our work, please scroll down to the people section and click on one of the group leads' people pages, where you can reach out to them directly.