| Presentation | 2021-09-09 Quantitative Evaluation of the Number of Servers Required to Obtain the Coverage of Community Formation Vertices in Autonomous Decentralized Management Graphs Satoshi Tanaka, Kunitake Kaneko, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | An autonomous decentralized management graph is a graph in which each of the multiple managers autonomously decides which vertices to manage and vertices cannot be managed by other administrators except for the vertices adjacent to the one managed by the administrator, unlike a centralized management graph in which there is a single manager of the graph. In a centralized graph, a vertex forming a community is often managed by a single server, whereas in an autonomous decentralized graph, it is managed by multiple servers. In this study, we compared the number of servers required to acquire all the community formation vertices and the number of servers managing the community formation vertices by varying the number of servers managing the autonomous decentralized management graph and the clustering coefficient, which is a measure of the coarseness of the community. The number of servers required to acquire all community formation vertices was determined by selecting the server with the largest number of vertices in the target community and deleting the vertices that can be acquired by that server, repeating the process until all vertices were acquired. As a result, in an autonomous decentralized management graph managed by more than 10 servers, if the clustering coefficient of the community is 0.1 or higher, the number of servers required to acquire all the vertices of the community formation is less than 10% of the number of servers managing the community formation vertices. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | autonomous dicentralized management graph / community acquisition / clustering coefficient / domination set |
| Paper # | IN2021-13 |
| Date of Issue | 2021-09-02 (IN) |
| Conference Information | |
| Committee | IN / NS / CS |
|---|---|
| Conference Date | 2021/9/9(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Session management (SIP/IMS), Interoperability/Standardization, NGN/NwGN/Future networks, Cloud/Data center networks, SDN (OpenFlow, etc.)/NFV, IPv6, Machine learning, etc. |
| Chair | Kenji Ishida(Hiroshima City Univ.) / Akihiro Nakao(Univ. of Tokyo) / Jun Terada(NTT) |
| Vice Chair | Kunio Hato(Internet Multifeed) / Tetsuya Oishi(NTT) / Daisuke Umehara(Kyoto Inst. of Tech.) |
| Secretary | Kunio Hato(NTT) / Tetsuya Oishi(Univ. of Nagasaki) / Daisuke Umehara(Nagaoka Univ. of Tech.) |
| Assistant | / Kotaro Mihara(NTT) / Takahiro Yamaura(Toshiba) / Yuta Ida(Yamaguchi Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Information Networks / Technical Committee on Network Systems / Technical Committee on Communication Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Quantitative Evaluation of the Number of Servers Required to Obtain the Coverage of Community Formation Vertices in Autonomous Decentralized Management Graphs |
| Sub Title (in English) | |
| Keyword(1) | autonomous dicentralized management graph |
| Keyword(2) | community acquisition |
| Keyword(3) | clustering coefficient |
| Keyword(4) | domination set |
| 1st Author's Name | Satoshi Tanaka |
| 1st Author's Affiliation | Keio University(Keio Univ.) |
| 2nd Author's Name | Kunitake Kaneko |
| 2nd Author's Affiliation | Keio University(Keio Univ.) |
| Date | 2021-09-09 |
| Paper # | IN2021-13 |
| Volume (vol) | vol.121 |
| Number (no) | IN-171 |
| Page | pp.pp.7-12(IN), |
| #Pages | 6 |
| Date of Issue | 2021-09-02 (IN) |