| Presentation | 2018-12-14 A Structured Overlay Network Based on a Proximity-aware Distributed Line Graph Youki Shiraishi, Akiko Manada, Yuzo Taenaka, Youki Kadobayashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A distributed line graph (DLG) is a technique for designing a structured overlay network based on an arbitrary regular graph. It enables to construct an overlay network having a constant degree and some excellent properties, such as fault tolerance and scalability. Overlay networks based on a DLG are constructed under rigid topological constraints of a base regular graph, and therefore, their diameters are maintained to be small. On the other hand, since they are constructed without considering proximity between nodes in the underlying network, their lookup latencies turn out to be serious. In this research, we propose a proximity-aware distributed line graph (PDLG), a method to consider proximity of an underlying network in an overlay network based on an arbitrary regular graph. In PDLG, overlay network topologies are optimized locally in consideration of communication latency between nodes in an underlying network when expanding or shrinking an overlay network topology. Simulation experiments show that the overlay network based on our proposed method reduces lookup latencies. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | distributed hash tables / distributed line graphs / structured overlay networks / peer-to-peer networks / de Bruijn graphs / Kautz graphs |
| Paper # | IA2018-51 |
| Date of Issue | 2018-12-06 (IA) |
| Conference Information | |
| Committee | IA / IN |
|---|---|
| Conference Date | 2018/12/13(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Hiroshima Univ. |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Performance Analysis and Simulation, Robustness, Traffic and Throughput Measurement, Quality of Service (QoS) Control, Congestion Control, Overlay Network/P2P, IPv6, Multicast, Routing, DDoS, etc. |
| Chair | Katsuyoshi Iida(Hokkaido Univ.) / Takuji Kishida(NTT-AT) |
| Vice Chair | Rei Atarashi(IIJ) / Hiroyuki Osaki(Kwansei Gakuin Univ.) / Toru Kondo(Hiroshima Univ.) / Kenji Ishida(Hiroshima City Univ.) |
| Secretary | Rei Atarashi(Tokyo Metropolitan Univ.) / Hiroyuki Osaki(TOYOTA-IT) / Toru Kondo(NEC) / Kenji Ishida(KDDI Research) |
| Assistant | Kenji Ohira(Tokushima Univ.) / Ryohei Banno(Tokyo Inst. of Tech.) |
| Paper Information | |
| Registration To | Technical Committee on Internet Architecture / Technical Committee on Information Networks |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Structured Overlay Network Based on a Proximity-aware Distributed Line Graph |
| Sub Title (in English) | |
| Keyword(1) | distributed hash tables |
| Keyword(2) | distributed line graphs |
| Keyword(3) | structured overlay networks |
| Keyword(4) | peer-to-peer networks |
| Keyword(5) | de Bruijn graphs |
| Keyword(6) | Kautz graphs |
| 1st Author's Name | Youki Shiraishi |
| 1st Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| 2nd Author's Name | Akiko Manada |
| 2nd Author's Affiliation | Shonan Institute of Technology(Shonan Inst. of Tech.) |
| 3rd Author's Name | Yuzo Taenaka |
| 3rd Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| 4th Author's Name | Youki Kadobayashi |
| 4th Author's Affiliation | Nara Institute of Science and Technology(NAIST) |
| Date | 2018-12-14 |
| Paper # | IA2018-51 |
| Volume (vol) | vol.118 |
| Number (no) | IA-360 |
| Page | pp.pp.71-77(IA), |
| #Pages | 7 |
| Date of Issue | 2018-12-06 (IA) |