Prof.
Erik Aurell
(KTH),
Mikko Alava
(HUT, Espoo, Finland)
5/15/08, 9:00 AM
Dr
Supriya Krishnamurthy
(SICS)
5/15/08, 9:20 AM
Overlay networks are application-level networks, or networks
of acquaintances, established on top of physical networks,
such as the Internet. Peer-to-Peer (P2P) systems are one
class of overlay networks, in which all nodes in the system
are equivalent and all tasks are carried out without the
presence of any central authority. Despite their relatively
short history, peer-to-peer overlays...
Prof.
Riccardo Zecchina
(Politecnico di Torino)
5/15/08, 10:00 AM
Given an undirected graph with positive weights on the
edges, the Minimum Weight Steiner Tree (MST) problem
consists in finding a connected subgraph of minimum weight
that contains a selected set of ``terminal'' vertices. Such
construction may require the inclusion of some non-terminal
nodes which are called Steiner nodes. Clearly, an optimal
sub-graph must be a tree. Solving MST is a...
Dr
Luca Dall'Asta
(Abdus Salam ICTP)
5/15/08, 11:00 AM
Many efforts have been devoted to characterize the onset of
congestion in communication networks. Numerical simulations
performed using complex routing protocols have revealed that
congestion always occurs as an effect of traffic increase,
but with specific features that strictly depend on the
local routing scheme. (For instance, the continuous or
discontinuous character of the...
Jeremy Stribling
(MIT CSAIL)
5/15/08, 1:00 PM
It is a challenge to build applications that need to share
data and are distributed across hundreds or thousands of
computers in a wide-area network (e.g., PlanetLab or on a
Grid). In order to cope with high latency, throughput
bottlenecks, and temporary failures, such applications
typically implement their own storage plan or use
special-purpose storage solutions (e.g., DISC,...
Danny Bickson
(The Hebrew University of Jerusalem)
5/15/08, 2:00 PM
The canonical linear-algebraic problem of solving a system
of linear equations arises in numerous contexts in the
mathematical sciences and engineering. In this talk, we
introduce an efficient Gaussian belief propagation (GaBP)
solver that does not involve direct matrix inversion. The
iterative nature of our approach allows for a distributed
message-passing implementation of the solution...
Dr
Dimos Dimarogonas
(KTH)
5/15/08, 2:20 PM
Multi-agent consensus problems where agents aim to attain a
common value of some quantity under limited communication
have received increasing attention recently, due to their
application in multi-vehicle and multi-robot systems, as
well as distributed estimation and filtering in networked
systems. In this talk we present two recent results on
consensus problems. The first part of the...
Prof.
Olav Tirkkonen
(TKK)
5/15/08, 3:20 PM
Prof.
Bernhard Mehlig
(Chalmers University of Technology)
5/15/08, 4:40 PM
