Fault Tolerance Distributed Computing

The problem is concerned with studying the limits of distributed computing in the presence of faults. Faults are generally modeled as Byzantine faults.

The present focus is on the following problems: 1. Is it possible to route from a source to a destination in the presence of faults, and how much topology knowledge is needed in this case? 2. Is there a topology knowledge hierarchy theorem that limits problem solving in the distributed setting?

Faculty

1. Kishore Kothapalli
2. Kannan Srinathan (Head)