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 |
SITE, IA, IPSJ-IOT [detail] |
2021-03-02 10:45 |
Online |
Online |
Broadcasts with Tree Selection on an Overlay Network Takeshi Kaneko, Kazuyuki Shudo (TokyoTech) SITE2020-49 IA2020-45 |
On an overlay network where a number of nodes work autonomously in a decentralized way, the efficiency of broadcasts has... [more] |
SITE2020-49 IA2020-45 pp.64-71 |
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, SITE, IPSJ-IOT [detail] |
2019-03-08 15:00 |
Tokushima |
Grand XIV Naruto |
Detouring Skip Graph: A Structured Overlay Utilizing Detour Routes Takeshi Kaneko, Ryohei Banno, Yusuke Aoki, Kazuyuki Shudo (Tokyo Tech) SITE2018-86 IA2018-78 |
Skip Graph, one of the structured overlays, constructs its own structure based on membership vectors assigned to every n... [more] |
SITE2018-86 IA2018-78 pp.343-350 |
VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2018-12-06 09:00 |
Hiroshima |
Satellite Campus Hiroshima |
Resources Utilization of Fine-grained Overlay Architecture Theingi Myint (Kumamoto), Qian Zhao (Kyutech), Motoki Amagasaki, Masahiro Iida, Toshinori Sueyoshi (Kumamoto) RECONF2018-37 |
This paper focuses on utilization of hardware resources for fine-grained overlay architecture. Overlay architectures inc... [more] |
RECONF2018-37 pp.15-20 |
IA |
2018-09-04 14:40 |
Hokkaido |
Hokkaido Univ. Conference Hall |
Reducing Average Path Lengths of Range Queries on Skip Graphs Ryohei Banno, Kazuyuki Shudo (Tokyo Tech) IA2018-27 |
Structured overlay networks are useful techniques to enable a large number of nodes to discover each other in an autonom... [more] |
IA2018-27 pp.69-76 |
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, 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 |
NS, IN (Joint) |
2014-03-06 11:20 |
Miyazaki |
Miyazaki Seagia |
A Structured Overlay on a Two-Dimensional Space based on Flexible Routing Tables Masashi Hojo, Hiroya Nagao, Takehiro Miyao, Kazuyuki Shudo (Tokyo Inst. of Tech.) NS2013-206 |
To perform message delivery or data collection in such as the wireless mesh network which sensors constitute, it is prom... [more] |
NS2013-206 pp.173-178 |
NS, IN (Joint) |
2014-03-06 11:40 |
Miyazaki |
Miyazaki Seagia |
Routing Table Construction Method Solely Based on a Flow of Queries for Structured Overlays Yasuhiro Ando, Hiroya Nagao, Takehiro Miyao, Kazuyuki Shudo (Tokyo Inst. of Tech.) NS2013-207 |
In structured overlays, nodes transfer a query hop by hop to the node that is responsible to the query's target ID by re... [more] |
NS2013-207 pp.179-184 |
ICM |
2013-03-14 10:20 |
Kagoshima |
Yakushima Environmental Culture Village Center |
An Interdomain Overlay Network Based on ISP Alliance Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano (Osaka Univ.) ICM2012-61 |
Recent research found that the standard interdomain routing protocol in today's Internet, BGP, is not optimal in end-to-... [more] |
ICM2012-61 pp.13-18 |
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 |
IN |
2012-10-12 09:30 |
Tokyo |
Tokyo Univ. Sanjo-Kaikan |
Routing Architecture for Capsulation Network
-- Smart embodiment of ID/locator Separation -- Hisao Furukawa (DSRI), Shoji Miyaguchi (formerly NTT) IN2012-98 |
The IP packets sent by the end user input the edge node of the capsulation network, and are encapsulated to yield intern... [more] |
IN2012-98 pp.127-132 |
IN |
2012-10-12 09:55 |
Tokyo |
Tokyo Univ. Sanjo-Kaikan |
Large-scale network that provides overlay networks for communication services
-- En-/de-capsulation, New routing architecture and new IP packet with 48-bit address -- Hisao Furukawa (DSRI), Shoji Miyaguchi (formerly NTT) IN2012-99 |
We discuss main three tasks on a large-scale network, the core network, capable of providing multiple overlay networks f... [more] |
IN2012-99 pp.133-138 |
IN, NV (Joint) |
2012-07-19 14:45 |
Hokkaido |
Hokkaido Univ. |
A dynamic application-level routing method reacting traffic changes based on distributed heuristic algorithm Kazuhito Matsuda, Go Hasegawa, Masayuki Murata (Osaka Univ.) IN2012-36 |
Application-level traffic routing that chooses an end-to-end traffic route relaying other end-hosts can improve user-per... [more] |
IN2012-36 pp.19-24 |
ICM, IPSJ-IOT, IPSJ-CSEC |
2012-05-10 11:50 |
Akita |
Akita University |
Modeling the Interaction of Overlay Routing and Multihoming ISP with Game Theory Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano (Osaka Univ.) ICM2012-11 |
Multihoming is widely used by Internet Service Providers (ISPs) to obtain improved performance and availability when con... [more] |
ICM2012-11 pp.121-126 |
NS, IN (Joint) |
2012-03-08 11:20 |
Miyazaki |
Miyazaki Seagia |
FRT-2-Chord:A DHT Supporting Seamless Transition between One-hop and Multi-hop with Symmetric Routing Table Yasuhiro Ando, Hiroya Nagao, Takehiro Miyao, Kazuyuki Shudo (Tokyo Tech) IN2011-149 |
We propose FRT-2-Chord a DHT based on FRT, a method for designing routing algorithms for overlays. In structured overlay... [more] |
IN2011-149 pp.73-78 |
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 |