Vljudno vabljeni na FRI Piškot, kjer bo prof. dr. John Augustine predstavil svoje raziskovalno delo.

Predavanje bo v sredo, 6. junija 2018, ob 14.00 v Akademiji FRI.

Robust and Efficient Computation in Dynamic Networks with Heavy Churn

Povzetek:

Peer-to-Peer (P2P) networks — typically overlay networks built on top of the Internet — pose some unique challenges to algorithm designers. The difficulty comes primarily from constant churn owing to the short lifespan of most nodes in the network. In order to maintain a well-connected overlay network despite churn at this level, the overlay must be dynamically maintained. This makes the overlay network graph an evolving graph that exhibits both edge dynamism and node churn. In this talk, we will discuss the somewhat surprising line of work in which we show how to design fast algorithms that are robust against heavy churn. The talk will comprise two main parts. In the first part, we will describe how we maintain a well-connected P2P network despite heavy churn. In the second part of the talk, we will describe how to design algorithms for fundamental distributed computing problems when the P2P network is well connected.

O predavatelju:

John Augustine is an Associate Professor in the Department of Computer Science and Engineering at IIT Madras. He received his Ph.D. in Computer Science from the University of California at Irvine in 2006. Prior to IIT Madras, he worked as a scientist at Tata Research Development and Design Centre and also as a Research Fellow at Nanyang Technological University. He has a wide array of research interests ranging from distributed network algorithms (esp., dynamic network algorithms), online algorithms, computational geometry, combinatorial optimization, and also applied algorithms, esp., in the context of inexact computing.