| Presentation | 2006-11-17 An Improvement of Bloom-Filter-Based Index Dissemination in P2P Networks Yusuke TAKAHASHI, Taisuke IZUMI, Toshimitsu MASUZAWA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A bloom filter is a representation of data item indexes, which achives small memory requirement by allowing one-sided errors (false positive). Because of such a feature, it is often used for lookup in P2P networks; in advance, each peer disserminates a bloom filter representing indexes of the data items it owns. Using the information of disserminated bloom niters as clue, each query can find a short path to its destination. In our previous work, we proposed an extension of the bloom filter, called a Deterministic Decay Bloom Filter (DDBF), and a search method based on it. While the standard bloom filter suffers performance degradation by containing the information of too much data items when its dissermination range is large, the DDBF can circumvent such degradation by containing the information according to the distance between the filter holder and items holders, i.e., a DDBF contains less information for faraway items and more information for nearby items. Then, we can reduce the amount of information aggregated by one peer, and can avoid the increase of error rate. In this paper, we further extend the DDBF-based search method by introducing the tchnique that the protocol adjusts dissermination range of each filter according to the popularity of data items that the filter represents. We also show by simulation that this popularity-biased scheme drastically improves efficiency of the DDBF-based lookup. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Bloom filter / P2P network / lookup problem |
| Paper # | NS2006-133 |
| Date of Issue |
| Conference Information | |
| Committee | NS |
|---|---|
| Conference Date | 2006/11/9(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Network Systems(NS) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An Improvement of Bloom-Filter-Based Index Dissemination in P2P Networks |
| Sub Title (in English) | |
| Keyword(1) | Bloom filter |
| Keyword(2) | P2P network |
| Keyword(3) | lookup problem |
| 1st Author's Name | Yusuke TAKAHASHI |
| 1st Author's Affiliation | Graduate School of Information Science and Technology, Osaka University() |
| 2nd Author's Name | Taisuke IZUMI |
| 2nd Author's Affiliation | Graduate School of Engineering, Nagoya Institute of Technology |
| 3rd Author's Name | Toshimitsu MASUZAWA |
| 3rd Author's Affiliation | Graduate School of Information Science and Technology, Osaka University |
| Date | 2006-11-17 |
| Paper # | NS2006-133 |
| Volume (vol) | vol.106 |
| Number (no) | 355 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |