DocumentCode :
3097955
Title :
Reduction of the Communication Traffic for Multi-word Searches in DHTs
Author :
Sei, Yuichi ; Matsuzaki, Kazutaka ; Honiden, Shinichi
Author_Institution :
Dept. of Comput. Sci., Univ. of Tokyo, Tokyo
fYear :
2006
fDate :
Nov. 28 2006-Dec. 1 2006
Firstpage :
14
Lastpage :
14
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 are 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.
Keywords :
file organisation; mobile radio; peer-to-peer computing; telecommunication traffic; DHT; communication traffic; distributed hash tables; divided bloom filters; file searching mechanisms; large-scale wireless networks; mobile devices; multi-word searches; Computer networks; Computer science; Filters; Informatics; Intrusion detection; Large-scale systems; Peer to peer computing; Telecommunication traffic; Testing; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence for Modelling, Control and Automation, 2006 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on
Conference_Location :
Sydney, NSW
Print_ISBN :
0-7695-2731-0
Type :
conf
DOI :
10.1109/CIMCA.2006.174
Filename :
4052662
Link To Document :
بازگشت