About the Project
Networks are pervasive and diverse and deeply integrated into our society. Networks often rely upon distributed protocols for their functioning. Failure of components and security also makes resilience a critical issue. Reseach will focus upon theoretical and mathematical algorithm design and analysis of algorithms on graphs (which are a good abstraction for networks).
We seek candidates who have strong interest in the following:
i) Self-healing, byzantine and other forms of resilient algorithms
ii) Compact routing and memory limited algorithms (ref: https://arxiv.org/abs/1803.03042)
iii) Static and dynamic Leader election and consensus
iv) Techniques such as topology, spectral and algebraic tools and communication complexity
v) Game theory applied to distributed algorithms and decision making
vi) Modelling and application to modern networks such as IOT and SDN.
Links to find out more:
Applicants should have, or expect to achieve, at least a 2:1 Honours degree (or equivalent) in Computer Science/Mathematics
How to apply
All applications are made online, please select the school/department name under the programme name section and include the quote reference number: CO/AT-Un1/2019
Based on your current searches we recommend the following search filters.
Based on your current search criteria we thought you might be interested in these.
Big Data Analytics and Mining: investigating and testing distributed formulations of data mining algorithms that are suitable for the MapReduce paradigm and for other distributed computing approaches
University of Reading