Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IN, NS (Joint) |
2019-03-05 13:50 |
Okinawa |
Okinawa Convention Center |
ID Allocation and Query Transfer Methods for Reducing Processing Load on Distributed Key Value Stores Takahiro Kadoguchi, Taiju Mikoshi, Katsunori Oyama, Toshihiro Nishizono (Nihon Univ.) NS2018-274 |
This paper proposes an ID allocation algorithm to equalize node load in distributed key value store (KVS). The paper als... [more] |
NS2018-274 pp.471-476 |
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 |
ICM |
2016-07-07 16:40 |
Hokkaido |
|
A method to construct redundant distributed KVS designed for geographically dispersed data management Kazuhito Matsuda, Noriyuki Fukuyama (FUJITSU LAB.) ICM2016-17 |
Numerous sensors, actuators, and embedded computers are connecting to information networks as well as cloud systems such... [more] |
ICM2016-17 pp.51-56 |
NS, IN (Joint) |
2016-03-04 13:50 |
Miyazaki |
Phoenix Seagaia Resort |
Load Reduction method for Distributed Key-Value Stores Using Query Information Based Routing Takashi Sakuma, Katsunori Oyama, Toshiro Nishizono (Nihon Univ.) NS2015-242 |
This paper proposes a method for reducing processing workload on the servers in distributed key-value stores. The server... [more] |
NS2015-242 pp.429-434 |
IN |
2014-04-17 13:00 |
Kyoto |
Kyotofu-Chusho-Kigyo-Kaikan |
Elastic and strict load balancing via consistent hashing Yuichi Nakatani, Hiroyuki Kurita, Naoki Takada, Takao Yamashita (NTT) IN2014-1 |
Load balancing is a key function constructing massively distributed systems. Stateful services like SIP and distributed ... [more] |
IN2014-1 pp.1-6 |
ICSS, IPSJ-SPT |
2014-03-28 13:55 |
Okinawa |
Meio Univiersity |
Evaluation of hash tree construction on P2P networks Tomoyuki Asaeda, Taihei Higuchi, Masakazu Soshi (Hiroshima City Univ.) ICSS2013-91 |
In recent years communication systems called P2P, where the peers communicate with one another
without the support of... [more] |
ICSS2013-91 pp.217-224 |
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 |
CPSY |
2013-11-08 15:55 |
Hiroshima |
|
Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing Systems Taishi Nakashima, Satoshi Fujita (Hiroshima Univ.) CPSY2013-52 |
In this paper, we propose a new consistency maintenance scheme for P2P file sharing systems. The basic idea of the propo... [more] |
CPSY2013-52 pp.73-78 |
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 |
DE |
2011-12-16 10:45 |
Kyoto |
Kyoto Sangyo University |
A Method to Reduce Remote Accesses in L1-Distance-based Distributed Locality-Sensitive Hashing and Its Implementation Evaluation Hisashi Koga, Toshinori Watanabe (UEC) DE2011-40 |
Locality-Sensitive Hashing (LSH) is an approximate nearest-neighbor search algorithm for high-dimensional data. Though L... [more] |
DE2011-40 pp.1-6 |
DC |
2011-12-16 16:10 |
Hyogo |
|
Object Search with Backtracking on Structured Overlay Networks Satoshi Fukumoto, Ippei Ozawa, Masayuki Arai (Tokyo Metropolitan Univ.) DC2011-73 |
This paper discusses the fault tolerance of routing protocol by the structured overlay network ``Chord" with backtrackin... [more] |
DC2011-73 pp.27-32 |
USN, IPSJ-UBI |
2011-07-14 13:55 |
Fukuoka |
Kyushu Univ. Nishishin Plaza |
A Management Method of Items in Display Shelf by Cooperative Communications between Advanced IC Tags with Ad Hoc Communication Kyohei Tanba, Daisuke Kasamatsu, Kazumasa Takami (Soka Univ.) USN2011-13 |
As a location management method which has flexibility for frequent display-changes of items, for example a rental shop, ... [more] |
USN2011-13 pp.43-48 |
IN, NS (Joint) |
2011-03-04 14:30 |
Okinawa |
Okinawa Convention Center |
Reducing Overloaded Search Routes to Reduce Search Load in P2P System Naoki Ishikawa, Aki Kobayashi (Kogakuin Univ.) IN2010-207 |
Replication methods in a P2P system have been extensively studied to find a way to reduce the content delivery load, and... [more] |
IN2010-207 pp.377-382 |
DC |
2010-12-10 15:10 |
Tottori |
International Family Plaza (Yonago) |
A Study on Fault Tolerance of Structured P2P Network Satoshi Fukumoto, Yumeto Terada, Masayuki Arai (Tokyo Metropolitan Univ.) DC2010-54 |
This paper discusses ``Symphony" which is a typical structured P2P (peer to peer) system. Fault tolerance property is ex... [more] |
DC2010-54 pp.15-20 |
NS, IN (Joint) |
2010-03-04 10:00 |
Miyazaki |
Miyazaki Phoenix Seagaia Resort (Miyazaki) |
Simulation on Replication Method of Management Information for P2P Content Delivery Hironori Sakakihara, Toru Kamiwada (Fujitsu Laboratories LTD), Hisayuki Ohmata, Kiyohiko Ishikawa (NHK) IN2009-157 |
A study on Peer-to-Peer (P2P) is actively progressing. P2P is regarded as a useful method for content delivery without t... [more] |
IN2009-157 pp.79-84 |
NS, IN (Joint) |
2010-03-04 09:00 |
Miyazaki |
Miyazaki Phoenix Seagaia Resort (Miyazaki) |
Analysis of P2P search load fairness about utilization of the system Naoki Ishikawa, Aki Kobayashi (Kogakuin Univ.) IN2009-163 |
A content search in DHT based P2P systems need many queries to many nodes that makes a search
path. Therefore, the node... [more] |
IN2009-163 pp.115-120 |
CS, IN, NS (Joint) |
2008-09-11 14:50 |
Miyagi |
Tohoku University |
Implementation and Performance of Extended OneHop-P2P Yutaka Kaneko, Shinya Takeuchi, Hiroki Minami, Yoshinori Izumi (NHK) NS2008-52 |
Structured peer-to-peer techniques using distributed hash tables are decentralized system and have fault resilience and ... [more] |
NS2008-52 pp.57-62 |
CS, IN, NS (Joint) |
2008-09-12 15:10 |
Miyagi |
Tohoku University |
A Packet Compression Algorithm Suitable for P2P Overlay Applications Kengo Sasaki, Akihiro Nakao (UT) IN2008-65 |
In the current Internet, the amount of P2P overlay traffic flowing between ISP's keeps increasing, which has a great imp... [more] |
IN2008-65 pp.129-134 |
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) |
USN, CQ, MoNA (Joint) |
2008-01-24 09:30 |
Shizuoka |
Kenshu Kouryu Center, Actcity Hamamatsu (Shizuoka) |
Improving Success Ratio of Object Search in Highly-Dynamic Mobile P2P Networks Kei Takeshita, Masahiro Sasabe, Hirotaka Nakano (Osaka Univ.) CQ2007-81 |
With the wide spread of mobile devices, information discovery methods over mobile ad hoc networks (MANETs) are required.... [more] |
CQ2007-81 pp.1-6 |