Defence of dissertation in the field of computer science, Ilya Nikolaevskiy, M.Sc.
Title of the dissertation is: Scalability and Resiliency of Static Routing
Map © OpenStreetMap. Some rights reserved.
Ilya Nikolaevskiy, M.Sc., will defend the dissertation "Scalability and Resiliency of Static Routing" on 20 December 2016 at 12 noon in Aalto University School of Science, lecture hall T2, Konemiehentie 2, Espoo. The dissertation studies important properties of a special class of routing algorithms. We present a broad theoretical study and several practical routing algorithms having these properties.
For every computer network to function, network devices have to decide where to send data packets. This is not a trivial problem especially for large-scale networks such as the Internet. To solve that problem there are many different algorithms that build routes for each packet – routing algorithms. Despite a huge body of research on this topic, some questions are not yet addressed. This dissertation is aiming to investigate important properties of the simplest class of routing algorithms, namely static routing. We study how well static routing algorithms work on large networks, and how good can they tolerate network failures. For the former, we present a static routing algorithm, which can deliver data to several receivers at the same time in Internet-scale networks. There are no such algorithms yet deployed in the Internet. For the latter, we present a systematic theoretical study and propose several unexpectedly tolerant to network disruptions static routing algorithms.
This dissertation lays the groundwork for further theoretical research of static routing properties. Additionally, we present several highly practical routing algorithms. Some of them are better than existing algorithms and can yield significant benefits in several scenarios.
Dissertation release (pdf)
Opponent: Professor Yevgeni Koucheryavy, Tampere University of Technology
Custos: Professor Antti Ylä-Jääski, Aalto University School of Science, Department of Computer Science
Electronic dissertation: http://urn.fi/URN:ISBN:978-952-60-7194-7