Reduction of the communication traffic for multi-word searches in DHTs

Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In large-scale wireless networks, efficient file searching mechanisms are essential for users. Many studies have been done on a distributed hash tables (DHTs) which air. one kind of peer-to-peer system. In DHT networks, we can certainly and effectively get the desired files if they exist. However, much communication traffic comes from multi-word searches. If we increase the storage redundancy, we can reduce the traffic. However, storage constrains of mobile devices make doing so impossible. In our previous work, we proposed a divided bloom filter to reduce the traffic in DHTs. However, the effect of divided bloom filters depends strongly on their parameters, and optimizing them is difficult. Hence, we have developed and tested the method to determine optimum parameters of divided bloom filters.

Original languageEnglish
Title of host publicationCIMCA 2006
Subtitle of host publicationInternational Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...
DOIs
Publication statusPublished - 2007 Dec 1
Externally publishedYes
EventCIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies and International Commerce - Sydney, NSW
Duration: 2006 Nov 282006 Dec 1

Other

OtherCIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies and International Commerce
CitySydney, NSW
Period06/11/2806/12/1

Fingerprint

Telecommunication traffic
Mobile devices
Redundancy
Wireless networks
Air

ASJC Scopus subject areas

  • Computer Science(all)
  • Control and Systems Engineering

Cite this

Sei, Y., Matsuzaki, K., & Honiden, S. (2007). Reduction of the communication traffic for multi-word searches in DHTs. In CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ... [4052662] https://doi.org/10.1109/CIMCA.2006.174

Reduction of the communication traffic for multi-word searches in DHTs. / Sei, Yuichi; Matsuzaki, Kazutaka; Honiden, Shinichi.

CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies .... 2007. 4052662.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sei, Y, Matsuzaki, K & Honiden, S 2007, Reduction of the communication traffic for multi-word searches in DHTs. in CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...., 4052662, CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies and International Commerce, Sydney, NSW, 06/11/28. https://doi.org/10.1109/CIMCA.2006.174
Sei Y, Matsuzaki K, Honiden S. Reduction of the communication traffic for multi-word searches in DHTs. In CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies .... 2007. 4052662 https://doi.org/10.1109/CIMCA.2006.174
Sei, Yuichi ; Matsuzaki, Kazutaka ; Honiden, Shinichi. / Reduction of the communication traffic for multi-word searches in DHTs. CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies .... 2007.
@inproceedings{8c8e4530c67d454489fab4598a27ca92,
title = "Reduction of the communication traffic for multi-word searches in DHTs",
abstract = "In large-scale wireless networks, efficient file searching mechanisms are essential for users. Many studies have been done on a distributed hash tables (DHTs) which air. one kind of peer-to-peer system. In DHT networks, we can certainly and effectively get the desired files if they exist. However, much communication traffic comes from multi-word searches. If we increase the storage redundancy, we can reduce the traffic. However, storage constrains of mobile devices make doing so impossible. In our previous work, we proposed a divided bloom filter to reduce the traffic in DHTs. However, the effect of divided bloom filters depends strongly on their parameters, and optimizing them is difficult. Hence, we have developed and tested the method to determine optimum parameters of divided bloom filters.",
author = "Yuichi Sei and Kazutaka Matsuzaki and Shinichi Honiden",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/CIMCA.2006.174",
language = "English",
isbn = "0769527310",
booktitle = "CIMCA 2006",

}

TY - GEN

T1 - Reduction of the communication traffic for multi-word searches in DHTs

AU - Sei, Yuichi

AU - Matsuzaki, Kazutaka

AU - Honiden, Shinichi

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In large-scale wireless networks, efficient file searching mechanisms are essential for users. Many studies have been done on a distributed hash tables (DHTs) which air. one kind of peer-to-peer system. In DHT networks, we can certainly and effectively get the desired files if they exist. However, much communication traffic comes from multi-word searches. If we increase the storage redundancy, we can reduce the traffic. However, storage constrains of mobile devices make doing so impossible. In our previous work, we proposed a divided bloom filter to reduce the traffic in DHTs. However, the effect of divided bloom filters depends strongly on their parameters, and optimizing them is difficult. Hence, we have developed and tested the method to determine optimum parameters of divided bloom filters.

AB - In large-scale wireless networks, efficient file searching mechanisms are essential for users. Many studies have been done on a distributed hash tables (DHTs) which air. one kind of peer-to-peer system. In DHT networks, we can certainly and effectively get the desired files if they exist. However, much communication traffic comes from multi-word searches. If we increase the storage redundancy, we can reduce the traffic. However, storage constrains of mobile devices make doing so impossible. In our previous work, we proposed a divided bloom filter to reduce the traffic in DHTs. However, the effect of divided bloom filters depends strongly on their parameters, and optimizing them is difficult. Hence, we have developed and tested the method to determine optimum parameters of divided bloom filters.

UR - http://www.scopus.com/inward/record.url?scp=38849113411&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38849113411&partnerID=8YFLogxK

U2 - 10.1109/CIMCA.2006.174

DO - 10.1109/CIMCA.2006.174

M3 - Conference contribution

AN - SCOPUS:38849113411

SN - 0769527310

SN - 9780769527314

BT - CIMCA 2006

ER -