BubbleStorm: Highly Resilient Peer-to-Peer Search and Replication
The Faculty of Informatics is pleased to announce a seminar given by Christof Leng
DATE: Monday, April 15th 2013
PLACE: USI Università della Svizzera italiana, room SI-006, Informatics building (Via G. Buffi 13)
Ten years ago, peer-to-peer networks appeared to be a very promising technology. Despite the hype, very few actual products successfully adopted P2P technology. It seems the implementation of a non-trivial P2P system is much more challenging than a comparable client/server application. The novel rendezvous search overlays aim to radically reduce the burden for application developers. BubbleStorm is a probabilistic rendezvous search overlay that is optimized for especially harsh environments. BubbleStorm's replication mechanisms enable very reliable distributed data management and retrieval.
Christof Leng is a researcher at the International Computer Science Institute, Berkeley, and currently works with UC Berkeley's AMP Lab on Big Data research. He holds a PhD and a diploma in computer science from Technische Universität Darmstadt. His research interests include big data, networking, distributed systems, and simulation. He has co-founded the German Pirate Party and serves as a vice president and speaker of the scientific staff advisory board of the Gesellschaft für Informatik (German Informatics Society).
HOST: Prof. Mauro Pezzè