| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IA, SITE, IPSJ-IOT [detail] | 2024-03-12 13:45 |
Okinawa | Miyakojima City Future Creation Center (Primary: On-site, Secondary: Online) |
Dynamic control of redundancy factor k in the byzantine-resilient structured overlay network ByzSkip Toyokazu Akiyama (Kyoto Sangyo Univ.), Yuuichi Teranishi (NICT), Kota Abe (Osaka Metropolitan Univ.)  SITE2023-74 IA2023-80 |
While key-order preserving structured overlay networks (KOPSONs) with Byzantine Fault Tolerance (BFT) are expected to ha... [more] | SITE2023-74 IA2023-80 pp.36-42 |
| NS, IN (Joint) |
2024-03-01 09:45 |
Okinawa | Okinawa Convention Center | A Hop Count Reduction Method Using Helper Nodes in RangeKey Skip Graphs Robust to Data Changes Motoki Kurita, Akihiro Fujimoto (Wakayama Univ.), Hideki Tode (Osaka Metropolitan Univ.) NS2023-215 |
With the increase of IoT devices, P2P-based IoT platforms have been attracting attention because of their capabilities o... [more] | NS2023-215 pp.253-257 |
| NS, IN (Joint) |
2022-03-11 15:10 |
Online | Online | A Study on Hop Count Reduction of Skip Graph with Arbitrary Number of Layers Yuuki Fujita, Akihiro Fujimoto (Wakayama Univ.), Hideki Tode (Osaka Pref Univ.) NS2021-159 |
With the increase of IoT devices, P2P-based IoT platforms have been attracting attention because of their capabilities o... [more] | NS2021-159 pp.218-223 |
| IA | 2021-01-29 14:25 |
Online | Online | A Routing Method for Range Queries Utilizing Detour Routes on Skip Graph Yuya Miki, Takeshi Kaneko (Tokyo Tech), Ryohei Banno (Tokyo Tech/Kogakuin Univ.), Kazuyuki Shudo (Tokyo Tech) IA2020-33 |
A structured overlay is a technique to construct an autonomous decentralized network of nodes and to achieve efficient r... [more] | IA2020-33 pp.15-20 |
| IA, IN (Joint) |
2018-12-14 15:05 |
Hiroshima | Hiroshima Univ. | A Structured Overlay Network Based on a Proximity-aware Distributed Line Graph Youki Shiraishi (NAIST), Akiko Manada (Shonan Inst. of Tech.), Yuzo Taenaka, Youki Kadobayashi (NAIST) IA2018-51 |
A distributed line graph (DLG) is a technique for designing a structured overlay network based on an arbitrary regular g... [more] | IA2018-51 pp.71-77 |
| IA, SITE, IPSJ-IOT [detail] | 2017-03-04 13:25 |
Okinawa | Culture Resort Festone (Okinawa) | A Study on ID/Locator Resolution System Using 1-Hop Notifications on Skip Delaunay Network Yusuke Aoki, Masaaki Ohnishi, Kazuyuki Shudo (Tokyo Tech) SITE2016-82 IA2016-112 |
Structured overlays enable a number of nodes to construct an application-level network autonomously and to search data.... [more] | SITE2016-82 IA2016-112 pp.197-202 |
| IA, IN (Joint) |
2016-12-15 14:30 |
Hiroshima | Hiroshima city university | Proposal and Evaluation of Suzaku, a Churn Resilient, Lookup-Efficient and Key-Order Preserving Structured Overlay Network Kota Abe (Osaka City Univ.), Yuuichi Teranishi (NICT) IA2016-65 |
A ``key-order preserving structured overlay network,'' which enables range queries, has various applications and thus be... [more] | IA2016-65 pp.11-16 |
| IA, SITE, IPSJ-IOT [detail] | 2016-03-03 14:50 |
Saga | Nijino-Matsubara Hotel (Karatsu-shi, Saga-prefecture) | A Structured Overlay to Construct Routing Tables by Stochastic Entry Deleting Method Shuhei Mitsuyama, Masashi Hojo, Kazuyuki Shudo (Tokyo Tech) SITE2015-62 IA2015-94 |
Symphony is one of structured overlays, in which all nodes autonomously organize an application-level network, delivery... [more] |
SITE2015-62 IA2015-94 pp.91-95 |
| IA, SITE, IPSJ-IOT [detail] | 2016-03-03 15:15 |
Saga | Nijino-Matsubara Hotel (Karatsu-shi, Saga-prefecture) | FRT-Skip Graph: A Skip Graph-Style Strucutred Overlay based on Flexible Routing Tables Masashi Hojo (Tokyo Tech), Ryohei Banno (NTT), Kazuyuki Shudo (Tokyo Tech) SITE2015-63 IA2015-95 |
Structured overlays can perform to construct a network autonomously by a number of nodes and to search other nodes and d... [more] | SITE2015-63 IA2015-95 pp.97-102 |
| IA, SITE, IPSJ-IOT [detail] | 2016-03-03 15:40 |
Saga | Nijino-Matsubara Hotel (Karatsu-shi, Saga-prefecture) | Self-Refining Skip Graph: A Structured Overlay Approaching to Ideal Skip Graph Takafumi Kawaguchi, Ryohei Banno, Masashi Hojo, Kazuyuki Shudo (Tokyo Tech) SITE2015-64 IA2015-96 |
Structured overlays construct mathematical and logical structural networks. In Skip Graph, one of structured overlays, e... [more] | SITE2015-64 IA2015-96 pp.103-108 |
| IN, IA (Joint) |
2013-12-19 11:35 |
Hiroshima | Hiroshima City Univ. | A construction method of efficient SkipGraph in heterogeneous communication environment Yohe Yasutomo, Yoshitaka Nakamura, Osamu Takahashi (FUN) IN2013-101 |
SkipGraph are an overlay network using SkipList as data structure of P2P network. Conventional SkipGraph does not consid... [more] | IN2013-101 pp.13-18 |
| IN, IA (Joint) |
2013-12-20 11:35 |
Hiroshima | Hiroshima City Univ. | A Distributed Topic-based Pub/Sub System for Stream Data Delivery Ryohei Banno, Susumu Takeuchi, Michiharu Takemoto, Takashi Kambayashi, Tetsuo Kawano, Masato Matsuo (NTT) IA2013-64 |
We propose a new method of distributed topic-based pub/sub messaging using structured overlay networks. Supposing strea... [more] |
IA2013-64 pp.41-46 |
| IN | 2013-01-25 13:05 |
Kagoshima | Kagoshima-Ken-Sangyo-Kaikan | A Skip Graph-Based Overlay Network That Allows Fast Key Insertion and Lookup Yuta Harima, Kota Abe, Hayato Ishibashi, Toshio Matsuura (Osaka City Univ.) IN2012-148 |
In this paper, we propose techniques to improve insertion and lookup time of skip graphs, a kind of structured overlay n... [more] | IN2012-148 pp.57-62 |
| NS, IN (Joint) |
2012-03-09 10:10 |
Miyazaki | Miyazaki Seagia | A Reachability Ensuring Technique for A Scalable Wide-Area Routing Method Shohei Shimamura, Hiroya Nagao, Takehiro Miyao, Kazuyuki Shudo (Tokyo Tech) IN2011-170 |
Today's EGPs are necessary that each router maintains routing information of O(N) against N ASes. It is the source of th... [more] | IN2011-170 pp.199-204 |
| LOIS, ICM | 2012-01-20 14:00 |
Kumamoto | Sojo Univ. | A Proposal of Scalable Publisher/Subscriber Computing Infrastructure with Structured Overlay Network Kimihiro Mizutani, Osamu Akashi (NTT), Kensuke Fukuda (NII) ICM2011-42 LOIS2011-67 |
We propose a new distributed computing infrastructure for managing big data such as massive traffic and sensor informati... [more] | ICM2011-42 LOIS2011-67 pp.61-66 |
| DC, CPSY | 2009-04-21 13:00 |
Tokyo | Akihabara Satellite Campus, Tokyo Metropolitan Univ. | Evaluation of a Metropolis Algorithm for Constructing Unstructured Overlay Networks Tatsushi Takamura, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.) CPSY2009-3 DC2009-3 |
Peer-to-peer(P2P) systems use a virtual network called an overlay network to route messages to distinations. Some algor... [more] |
CPSY2009-3 DC2009-3 pp.13-17 |
| RCS, AN, MoNA, SR, WBS (Joint) |
2008-03-05 15:10 |
Kanagawa | YRP | [Invited Talk]
Architecture of structured overlay networks and its application for ubiquitous networks Tomohiro Nishitani (Communications) MoMuC2007-99 AN2007-74 |
Recently, P2P technologies gather attention, as some P2P software like Winny and Gnutella are widely spread. Among the ... [more] |
MoMuC2007-99 AN2007-74 pp.19-24(MoMuC), pp.61-66(AN) |
| IN, NS, CS (Joint) |
2006-09-15 09:40 |
Miyagi | Semantic Peer-to-Peer Networks Based on Proximity Narumi Oobayashi, Takuya Asaka, Tatsuro Takahashi (Kyoto Univ.) NS2006-83 |
Recently there has been a lot of study to work on improving performance of content search efficiency and throughput in p... [more] | NS2006-83 pp.73-78 |
|
[Return to Top Page]