Transcript Propaganda - Swedish Institute of Computer Science

PRESENTATION
PRESENT FROM THE
CONSORTIUM:
Proposal/Contract FP6001935, submitted to
Call FP6-2002-IST-1
EVERGROW, ever-growing
global scale-free
networks, their
provisioning, repair and
unique functions
Dr. Erik Aurell, SICS Swedish
Institute of Computer Science
(Coordinator)
Prof. Scott Kirkpatrick, School of
Computer Science and
Engineering, HUJI
(Coordinator)
Dr. Jakka Sairamesh, IBM
Research, Hawthorne, USA
(not yet fully confirmed)
Brussels September 11, 2003
Brussels 2003-09-11
FP6-001935 EVERGROW
1
EVERGROW project overview: Five Subprojects in IP
SP4
message-passing
as a control paradigm
SP1
measurement of network
traffic and topology
network traffic measurement
across Europe in real-time,
analysis, unique charactistics
expand the recent success
of complex systems from
combinatorial optimization
to a general scheme for
control and design
SP3
SP5
scalable decentralised
self-healing services
market mechanisms for
distributed algorithms
beyond collaborative peer-to-peer
solutions to distributed computing
in an unfriendly world
Brussels 2003-09-11
SP2
FP6-001935 EVERGROW
the virtual distributed
network observatory
infrastructure
nodes, fast internet
links, dedicated
software for
distributed admin
and access control
fully distributed infrastructure for the
future internet for data provisioning,
error correction
2
The vision of EVERGROW is to invent methods and
systems, and build infrastructure for measurement,
mock-ups and analysis of network traffic, topology
and logical structure, so that we can start now to
address the opportunities presented by the Internet
in 2025.
We will collaborate in developing new approaches to
distributed, self-managing, self-healing, secure
information systems which reflect insights from
physics, biology and economics to make them robust
in an evolving, and not always friendly world.
Brussels 2003-09-11
FP6-001935 EVERGROW
3
Highlight (Subproject SP1): inspiration from biology in EVERGROW
R. Milo et al, Science 298 824-27
(2002), ”Network motifs: simple
building blocks of complex networks”
(from Uri Alon Lab, Weizmann, IL)
Brussels 2003-09-11
Sergei Maslov & Kim Sneppen,
Science 296 910-913 (2002),
”Specificity and Stability in
Protein Interaction networks”.
FP6-001935 EVERGROW
4
Highlight (Subprojects SP4 and SP3): message-passing as a general scheme
for control and design builds on recent advances in statistical physics of
disordered systems. Is there a statistical mechanics of large peer-to-peer
systems? What are the intensive variables? What are good and bad phases?
Phase transitions
in optimization
The 4.3 Point
4000
50 var
40 var
20 var
DP Calls
3000
2000
Messagepassing for
distributed
control.
1000
0
1.0
50% sat
Probability
0.8
0.6
0.4
0.2
0.0
2
3
4
5
6
7
Ratio of Clauses-to-Variables
Mitchell, Selman, and Levesque 1991
Brussels 2003-09-11
8
M. Mézard, G. Parisi & R. Zecchina, Science
297 812-15 (2002), ”Analytic and algorithmic
solution of random satisfiability problems” .
FP6-001935 EVERGROW
5
ultimate GOOGLE
INTERNET 2025
ultimate
AKAMAI
COMPLEX SYSTEMS
RESEARCH WILL CREATE
THE BASIS OF THEORY,
INFRASTRUCTURES AND
UNDERSTANDING
ultimate
GNUTELLA
ultimate RAID
Brussels 2003-09-11
FP6-001935 EVERGROW
6