Name
Abstract | ||
|---|---|---|
File-sharing Peer-to-Peer systems are effective for autonomous information retrieval over the networks. However, the previous information retrieval schemes such as Gnutella and Local Indices have bad performance and large overhead. In order to solve these drawbacks, this paper proposes a dynamic information retrieval scheme, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ISADS.2005.1452164 | ISADS 2005: INTERNATIONAL SYMPOSIUM ON AUTONOMOUS DECENTRALIZED SYSTEMS,PROCEEDINGS |
Keywords | Field | DocType |
information retrieval,computer networks,resource allocation,computational modeling,file sharing,fault tolerance,indium tin oxide,indexation | Peer-to-peer,Computer science,Computer network,Peer to peer computing,Fault tolerance,Resource allocation,Distributed computing | Conference |
Citations | PageRank | References |
2 | 0.51 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomoyuki Ohta | 1 | 293 | 50.54 |
| Yasuo Masuda | 2 | 2 | 0.51 |
| Kouichi Mitsukawa | 3 | 3 | 1.47 |
| Yoshiaki Kakuda | 4 | 559 | 106.85 |
| Atsushi Ito | 5 | 41 | 14.25 |