東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Trustworthy Distributed Search and R...

Chuang, Yung-Ting.

FindBook

Google Book

Amazon

博客來

Trustworthy Distributed Search and Retrieval over the Internet.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Trustworthy Distributed Search and Retrieval over the Internet./
作者:	Chuang, Yung-Ting.
面頁冊數:	214 p.
附註:	Source: Dissertation Abstracts International, Volume: 75-01(E), Section: B.
Contained By:	Dissertation Abstracts International75-01B(E).
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3596103
ISBN:	9781303425073

Trustworthy Distributed Search and Retrieval over the Internet.
Chuang, Yung-Ting.

Trustworthy Distributed Search and Retrieval over the Internet. - 214 p.

Source: Dissertation Abstracts International, Volume: 75-01(E), Section: B.

Thesis (Ph.D.)--University of California, Santa Barbara, 2013.

Currently, our trust in the accessibility of information over the Internet and the Web depends on benign and unbiased administration of centralized search engines. Unfortunately, a centralized search engine can be modified to filter, conceal, or censor information. We present a decentralized search and retrieval system, named iTrust, to address these problems.

ISBN: 9781303425073Subjects--Topical Terms:

1669061
Engineering, Computer.

Trustworthy Distributed Search and Retrieval over the Internet.
LDR:03270nam a2200337 4500 001 1960600
005 20140623111239.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303425073
035 $a (MiAaPQ)AAI3596103
035 $a AAI3596103
040 $a MiAaPQ $c MiAaPQ
100 1 $a Chuang, Yung-Ting. $3 2096292
245 1 0 $a Trustworthy Distributed Search and Retrieval over the Internet.
300 $a 214 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-01(E), Section: B.
500 $a Adviser: P. Michael Melliar-Smith.
502 $a Thesis (Ph.D.)--University of California, Santa Barbara, 2013.
520 $a Currently, our trust in the accessibility of information over the Internet and the Web depends on benign and unbiased administration of centralized search engines. Unfortunately, a centralized search engine can be modified to filter, conceal, or censor information. We present a decentralized search and retrieval system, named iTrust, to address these problems.
520 $a First, we address the design and implementation of iTrust. Source nodes distribute metadata for information along with the address of the information to randomly chosen nodes. Similarly, requesting nodes distribute requests that contain keywords to randomly chosen nodes. Nodes that receive a request compare the keywords with the metadata they hold, and return the URL of the information to the requesting node if they have a match. For appropriate values of the parameters, the probability of a match is very high.
520 $a Next, we present statistical algorithms for detecting and defending against malicious attacks. Our statistical detection algorithm compares the empirical and analytical probabilities of a match to estimate the proportion of non-operational nodes in the membership. The defensive adaptation algorithm then increases the number of nodes to which the requests are distributed to maintain the same probability of a match when some of the nodes are non operational as when all of the nodes are operational.
520 $a Then, we consider an environment in which nodes join or leave the membership rapidly. Our adaptive membership protocol allows nodes to discover changes in the membership using the iTrust messages and responses that it normally receives. A node then dynamically adjusts its requesting rate, and sends more request messages to compensate for nodes from which it did not receive a response. The protocol exploits messages already being sent to distribute metadata or requests, thus reducing the need for additional messages.
520 $a Finally, we combine our adaptive membership protocol with our algorithms for detecting and defending against malicious nodes. The combined adaptation algorithm estimates changes in the membership to improve the behavior of iTrust. We demonstrate that the combined adaptive algorithm is effective and robust when the membership churn is high and when there are malicious nodes in the membership.
590 $a School code: 0035.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0464
690 $a 0984
690 $a 0544
710 2 $a University of California, Santa Barbara. $b Electrical & Computer Engineering. $3 1020566
773 0 $t Dissertation Abstracts International $g 75-01B(E).
790 $a 0035
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3596103