This document describes Orbis, a peer-to-peer service similar to Twitter. It uses a master-slave architecture with MessagePack-RPC to distribute indexing and searching across nodes. Each node runs an HTTP servlet front-end and indexes content into memory using a morpho-parser. Hashing replication is used to share indexes across nodes for fault tolerance and distributed querying.

1. P2P
ORBIS
Dec. 19, 2011
@ceeflyer (Yusuke FUJISAKA)
CyberAgent, inc.

2. ORBIS
•
•
• Peer to Peer

3. • Twitter-like service
•
•
•
•
• P2P

4. ORBIS application
HTTP Servlet
P2P Server
Morpho-parser
Index/Search Queue
Indexing Memory

5. • ( 1,000 )
•
• Master-Slave
• MessagePack-RPC
(http://msgpack.org)

6. Node 1
10.0.0.4 Node 2
10.0.0.5
Node 3
10.0.0.6

7. New comer
10.0.0.7
connect?node=10.0.0.6

10. Beacon

11. ?

12. ×

13. ○
Beacon

15. :
Content ( )
xxx
...
Appendix ( )
yyy
...
Flag ( )
zzz
...

16. Index
Title: xxxxxxxx
Text: xxxxxxxx...

17. 5 67
2 34 3 21
x 61 6 54
0 77
0x
1 23
0 00 0 00
4 00 x FA
Hash: 0x51234567
54 0
0x
Index
Title: xxxxxxxx
Text: xxxxxxxx...

18. 5 67
2 34 3 21
x 61 6 54
0 77
0x
1 23
0 00 0 00
4 00 x FA
Hash: 0x51234567
54 0
0x
Index
Title: xxxxxxxx
Text: xxxxxxxx...

19. Title: xxxxxxx
Text: xxxxxxx...
Hash: 0x51234567
Index
Title: xxxxxxxx
Text: xxxxxxxx...

20. Term Term
Index ID Index ID Index ID Index ID Index ID
Content
Content
Content Content
Content
Content Content
Content
Content Content
Content
Content Content
Content
Content

21. Term Term
max: 100
Index ID Index ID Index ID Index ID Index ID
Content
Content
Content Content Content
Content
Content Content
Content
Content Content

22. Term Term
max: 100
Index ID Index ID Index ID Index ID Index ID
Content
Content
Content Content Content
Content
Content Content
Content
Content Content

23. •
•
•

24. •
• Hashing replication

25. Search
Query: xxxxxx
From: 1 Length: 10

26. Result
Intersection

27. ?
Search
Query: xxxxxx
From: 1 Length: 10

28. Result

29. •
•

30. • Written in Java
• Google code:
http://code.google.com/p/orbis