| Presentation | 2018-01-22 Autonomous Distributed Calculation and Storage of Tie Strengths between Contents in Graph System Daichi Kitamura, Kunitake Kaneko, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Graphs as relation between contents is used to calculate the tie strength between them and it is of- ten used for recommendation. The calculation and strage is proposed for centralized control system. We propose autonomous distributed calculation and storage of tie strength between contents to allow the distributed graph manager to offer the tie strength services. We design and implement Contents Tie Strength Daemon and protocol applying autonomous distributed caluculation and storage of shortest paths and use CFEC as tie strength. Contents Tie Strength Daemon propagate own path each other and calculate CFEC with others which have neighbornodes. The traffic and memory load is bigger as graph scale is larger. We measure the traffic and memory load and prove that the Daemon is avalable when propagation cycle is one hour and 1000 nodes are distributed to 64 servers. And we find writing database can be a bottoleneck. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | graph / tie strength / distributed system / recommendation / routing table construction method |
| Paper # | IN2017-76 |
| Date of Issue | 2018-01-15 (IN) |
| Conference Information | |
| Committee | IN |
|---|---|
| Conference Date | 2018/1/22(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | WINC AICHI |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Contents Distribution, Social Networking Services, Data Analytics and Processing Platform, Big data, etc. |
| Chair | Katsunori Yamaoka(Tokyo Inst. of Tech.) |
| Vice Chair | Takuji Kishida(NTT) |
| Secretary | Takuji Kishida(NTT) |
| Assistant | |
| Paper Information | |
| Registration To | Technical Committee on Information Networks |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Autonomous Distributed Calculation and Storage of Tie Strengths between Contents in Graph System |
| Sub Title (in English) | |
| Keyword(1) | graph |
| Keyword(2) | tie strength |
| Keyword(3) | distributed system |
| Keyword(4) | recommendation |
| Keyword(5) | routing table construction method |
| 1st Author's Name | Daichi Kitamura |
| 1st Author's Affiliation | Keio University(Keio University) |
| 2nd Author's Name | Kunitake Kaneko |
| 2nd Author's Affiliation | Keio University(Keio University) |
| Date | 2018-01-22 |
| Paper # | IN2017-76 |
| Volume (vol) | vol.117 |
| Number (no) | IN-397 |
| Page | pp.pp.37-42(IN), |
| #Pages | 6 |
| Date of Issue | 2018-01-15 (IN) |