Bottleneck Analysis of Complex Networks
Assane Gueye, Nikhil Gopinath Shetty and Jean Walrand
For the analysis of very large and complex networks, it is crucial to understand which parts of the network limit the performance objectives. Such parts are usually termed bottlenecks. Defining the term bottleneck and identifying how they affect performance is a challenging task and, so far, very limited research effort has been spent on finding systematic and efficient methods to identify bottlenecks in a network. Brute-force simulation is the path chosen to understand and design networks presently. In this research project, we aim to develop mathematical tools that will enable us to study a network without having to resort to heavy simulations.