Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NS, IN (Joint) |
2017-03-03 10:10 |
Okinawa |
OKINAWA ZANPAMISAKI ROYAL HOTEL |
Construction method of logical links considering distance between nodes for low delay Skip Graph Takahiro Toda, Yosuke Tanigawa, Hideki Tode (Osaka Prefecture Univ.) NS2016-199 |
These days, more and more devices are connected to the Internet and types of those devices become various. Thus, P2P net... [more] |
NS2016-199 pp.241-246 |
NS |
2016-04-22 10:10 |
Wakayama |
wakayama university |
Membership Vector Assignment considering Spacial Locality of Nodes in Skip Graph Takahiro Toda, Yosuke Tanigawa, Hideki Tode (Osaka Prefecture Univ.) NS2016-6 |
These days, more and more devices are connected to the Internet and types of those devices become various. Thus, P2P net... [more] |
NS2016-6 pp.25-30 |
NS, IN (Joint) |
2012-03-09 12:00 |
Miyazaki |
Miyazaki Seagia |
Experimental Evaluation of BitTorrent System with Adaptive Support Nodes and Peers following Various Unchoking Rules Kei Ito, Yosuke Tanigawa, Hideki Tode (Osaka Pref. Univ.) NS2011-248 |
In BitTorrent network, some peers has disadvantages to get files slower than others, because of their individual sojourn... [more] |
NS2011-248 pp.387-390 |
COMP |
2011-04-22 10:05 |
Kyoto |
Kyoto University |
Stochastic Node Departure Process and Alive-Node Connection for P2P Systems Susumu Shibusawa, Mamoru Kobayashi, Hiroshi Ohno, Tatsuhiro Yonekura (Ibaraki Univ.) COMP2011-2 |
Node departure from P2P system affects the maintenance of system, and managing the effect of node departure is very impo... [more] |
COMP2011-2 pp.9-16 |
NS |
2009-10-15 15:45 |
Kumamoto |
Prefectural University of Kumamoto (Kumamoto) |
[Poster Presentation]
Performance Impact of User Bandwidth on Inter-ISP P2P Traffic Takafumi Sakabe, Miki Yamamoto (Kansai Univ.) NS2009-92 |
In P2P systems, peers construct their participating overlay network and exchange their required contents on it. Because ... [more] |
NS2009-92 pp.87-90 |
SWIM |
2009-09-11 16:15 |
Tokyo |
|
A Design of Virtual Clinic Interprise Model on P2P Network Hiroyuki Kitamura, Tamotsu Noji, Hiroyuki Fukushi, Minoru Horii (Tokai Univ.), Yasuzo Suto (Azabu Univ.) SWIM2009-9 |
We construct global medical collaboration Interprise Model with the design of a virtual clinic and attempting the cooper... [more] |
SWIM2009-9 pp.23-28 |
IN |
2008-07-17 14:20 |
Hyogo |
Koube Univ. |
On effective index caching technique for P2P file-sharing systems Takuya Shinnou, Sayaka Kamei, Satoshi Fujita (Hiroshima Univ) IN2008-26 |
In the unstructured P2P, the network topology and the placement of files are largely unconstrained.The most simple searc... [more] |
IN2008-26 pp.1-6 |
IN |
2008-07-17 14:45 |
Hyogo |
Koube Univ. |
An improvement of the interest mining method based on a network reconfiguration Naomi Aoki, Sayaka Kamei, Satoshi Fujita (Hiroshima Univ) IN2008-27 |
In unstructured peer-to-peer (P2P) systems, it is necessary to retrieve enough information and reduce the number of quer... [more] |
IN2008-27 pp.7-12 |
IN |
2007-12-14 15:00 |
Hiroshima |
Hiroshima City University |
A File Fetching Method to Reduce the Redundant Traffic on P2P Networks Akihiko Ishidu, Junichi Funasaka, Kenji Ishida (Hiroshima City Univ.) IN2007-117 |
When dividing a file into many pieces and fetching different pieces from many peers on P2P systems, if the piece is requ... [more] |
IN2007-117 pp.109-114 |
CQ, LOIS, IE, IEE-CMN, ITE-ME |
2007-09-28 09:00 |
Tokushima |
The university of Tokushima |
On the construction of minimum depth tree for P2P system Naoki Miwa, Liang Zhao, Hiroshi Nagamochi (Kyoto Univ.) CQ2007-54 OIS2007-44 IE2007-51 |
It is necessary to minimize delay from a sender with considering the ability of each broadcast node when we design P2P s... [more] |
CQ2007-54 OIS2007-44 IE2007-51 pp.101-106 |
IN |
2006-12-15 16:40 |
Osaka |
|
A Construction Method of Proximity-aware P2P DHT Kenji Doi, Shigeaki Tagashira, Satoshi Fujita (Hiroshima Univ.) IN2006-137 |
Distributed Hash Table (DHT) is a common technique to improve the scalability and the efficiency for retrieving objects ... [more] |
IN2006-137 pp.139-144 |
IN |
2005-12-16 13:10 |
Hiroshima |
Hiroshima City Univ. |
Proposal of dynamic grouping method for selecting peers on P2P networks Hideyuki Yasuoka, Junichi Funasaka, Kenji Ishida (Hiroshima City Univ.) |
When sharing a file on P2P systems that adopt the Tit-For-Tat exchange strategy, the random peer selection has a problem... [more] |
IN2005-125 pp.91-96 |
DE, DC |
2005-10-17 11:00 |
Tokyo |
NTT Musashino R&D center |
A Network Aware Overlay Construction and its Reliability Evaluation Shinichi Ikeda, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.) |
Peer-to-peer (P2P) systems are often constructed in overlay networks at the application layer without taking the physica... [more] |
DE2005-125 DC2005-19 pp.1-5 |