WP2 Discovery mechanism of the OpenKnowledge system (

1
WP2 Discovery mechanism of the OpenKnowledge
system(Semantic routing)(presented by Ronny
Siebes)
2
What we did last year on WP2

• Functional description architecture of the OK-
  System (D2.1a and D2.1b) additional work as a
  decision to get an actual working prototype and
  final system
• Emulation of routing mechanisms (D2.2?)
• 3. Implementation discovery service (prototype
  and beyond)

3
Functional description architecture of the
OK-system

• What is the Open-Knowledge System?
• Current limitations leading to a validation of
  our system.
• What are our goals of the Open-Knowledge System?
• Large scale in humans and machines
• Diffentiation between types of participants, like
  average user, programmers
• Low integration effort with existing work
• Open participation
• Re-use, re-use and re-use
• Means to evaluate who is good and whos not
• Why the Open-Knowledge system is a good idea?
• Comparison with MAS, P2P, Grids, WWW, SW
• How would the system look like?
• User perspective (screenshots and
  functionality)
• System overview in a technical sense (covered by
  D2.1b)

4
Functional description architecture of the
OK-system

• Can we give examples where the system will be
  useful?
• Emergency response
• Bio- informatics
• SW tool development
• Which techniques will be applicable?
• Interaction models
• Mapping
• Query relaxation
• Discovery
• Trust reputation
• Media2semantics
• Semantic web tools
• How will we evaluate the system?
• (for each point of 6 we say how)

5
Emulation experiments

• Compared JXTA, Pgrid and FreePastry
• JXTA implementation has many bugs and algorithm
  does not scale
• Pgrid takes lots of time to stabalize
• FreePastry is easy and works
• Compared different routing algorithms
• Emulations of hundreds of nodes on the DAS2

6
Discovery implementation
7
Organization
Coordinator
Discovery Node
Related to WP1 communication
Peer
Discovery System
8
Publishing
Coordinator
Discovery Node
Peer
4
5
A B C
IM
6
7
1
IM
OKC
Code
2
IM
3
OKC
Code
IM
9
8
9
Discovering Descriptions
Coordinator
Discovery Node
Peer
4
?
5
A B C
IM
IM
OKC
6
Code
IM
7
IM
OKC
Okc
IM
Okc
Code
OKC
OKC
OKC
1
Code
Code
2
3
8
10

Retrieving Implementations
Coordinator
Discovery Node
IM
IM
Peer
4
OKC
OKC
OKC
OKC
OKC
OKC
5
A B C
IM
IM
OKC
6
OKC
IM
7
IM
OKC
OKC
IM
IM
OKC
OKC
OKC
OKC
OKC
1
OKC
OKC
OKC
2
3
11
Subscribing to Interactions
Coordinator
Discovery Node
IM
IM
OKC
OKC
OKC
OKC
Peer
4
Code
Code
5
A B C
5
IM
IM
OKC
OKC
IM
Code
OKC
6
6
Code
IM
7
IM
7
OKC
OKC
IM
IM
OKC
Code
OKC
OKC
OKC
IM
1
1
Code
Code
Code
OKC
OKC
IM
Code
OKC
2
Code
3
12
Coordinator Initialization
Coordinator
Discovery Node
IM
IM
OKC
OKC
OKC
OKC
Peer
4
OKC
Code
5
A B C
A B C
1
1
6
7
6
7
5
5
IM
IM
IM
OKC
OKC
IM
Code
OKC
6
Code
IM
7
IM
OKC
OKC
IM
IM
OKC
Code
OKC
OKC
OKC
IM
1
Code
Code
Code
OKC
OKC
IM
Code
OKC
2
Code
3
13
Coordination
IM
IM
OKC
OKC
OKC
OKC
4
A B C
Code
Code
A B C
r( inquirer, initial ) r( oracle, necessary, 1
) A( inquirer, ID2 ) ask(W) gt a( oracle,
ID )lt- toknow(W) then definition(W,D) lt
a(oracle, ID) then null lt- show(W,D) B(
oracle, ID ) ask(W) lt a(inquirer, ID2 )
then definition(W,D) gt a(inquirer, ID2)
lt- define(W,D) C( translator, ID ) ask(W)
lt a(ioracle, ID2 ) then definition(W,D)
gt a(inquirer, ID2) lt- define(W,D)
1
1
5
6
7
6
7
A B C
A B C
1
1
5
5
6
7
6
7
5
5
IM
IM
OKC
OKC
IM
Code
OKC
6
Code
IM
7
IM
OKC
OKC
IM
IM
OKC
Code
OKC
OKC
OKC
IM
1
Code
Code
Code
OKC
OKC
IM
Code
OKC
2
Code
3
Interaction Model