|Title||:||Distributed Computation in Dynamic Networks via Random Walks|
|Speaker||:||Anisur Rahaman (University of Freiburg, Germany)|
|Details||:||Thu, 11 Aug, 2016 3:00 PM @ BSB 361|
|Abstract:||:||Real world networks are inherently dynamic; the communication links are changing or the nodes are crashing over time. Dynamic networks capture this changing behaviour of modern networks. In this talk, we will discuss distributed computation in dynamic networks in which the network topology changes arbitrarily from time to time. We first present a fast distributed algorithm for performing random walks in such networks. Then we talk about one of the fundamental problems in distributed computing, namely, information dissemination (also called as gossip). In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes in the network and the problem is to disseminate the k tokens to all nodes. Essentially, we will see how to apply the random walk algorithm to devise a fast distributed algorithm for the information dissemination in dynamic networks.
Speaker Bio: Anisur Rahaman Molla is a postdoctoral researcher in the Department of Computer Science at the University of Freiburg, Germany. Before Freiburg, for a short period, he was a postdoc at Singapore University of Technology and Design (SUTD). He earned his PhD at Nanyang Technological University, Singapore. He received an MTech degree in Computer Science from Indian Statistical Institute, Kolkata, and BSc and MSc in Mathematics from Calcutta University. His research focuses on the theoretical aspects of distributed systems.