Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Robust and Efficient Computation in Dynamic Networks with Heavy Churn
Speaker:John Augustine
coming from:Indian Institute of Technology Madras
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Monday, 19 September 2016
Time:13:00
Duration:45 Minutes
Location:Saarbrücken
Building:E1 5
Room:029
Abstract
Peer-to-Peer (P2P) networks — typically overlays on top of the Internet — pose some unique challenges to algorithm designers. Primarily, the difficulty comes from heavy churn owing to the short life span of most nodes in the network. Reminiscent of Theseus’ paradox, most nodes in a typical P2P network churn out within an hour only to be replenished with incoming new nodes. In order to maintain a well-connected network despite churn at this level, the overlay has to be constantly reworked. This results in the overlay network graphs being a dynamic graphs that exhibits both edge dynamism and heavy node churn. In this talk, we will discuss how to design fast algorithms that are robust against such dynamic networks.
Contact
Name(s):Sebastian Krinninger
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
Created by:Sebastian Krinninger, 09/09/2016 11:03 AMLast modified by:Uwe Brahm/MPII/DE, 09/19/2016 07:01 AM
  • Sebastian Krinninger, 09/09/2016 11:03 AM -- Created document.