| 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, 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| NS, IN (Joint) |
2007-03-09 13:10 |
Okinawa | Okinawa Convention Center | Proposing and Evaluating a DHT based on an Overlay Broadcast Daishi Kato (NEC) IN2006-237 |
We propose a DHT based on an overlay broadcast in a structured overlay network, which replicates data on all nodes as ... [more] |
IN2006-237 pp.339-344 |
| CQ, IE, LOIS, IEE-CMN, ITE-ME | 2005-09-15 10:50 |
Kochi | Kochi Univ. of Technoloty | Application of One-Time Password Authentication Protocol to Peer-to-Peer Network Yuji Nishida, Takasuke Tsuji, Akihiro Shimizu (KUT) |
In recent years, the spread of the application using the P2P(Peer-to-Peer) network is remarkable, and various services c... [more] | CQ2005-38 OIS2005-23 IE2005-31 pp.23-27 |
[Return to Top Page]