東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

DIAS: Distributed interest-based ad...

Liu, Ning.

FindBook

Google Book

Amazon

博客來

DIAS: Distributed interest-based adaptive search for P2P networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	DIAS: Distributed interest-based adaptive search for P2P networks./
作者:	Liu, Ning.
面頁冊數:	80 p.
附註:	Source: Masters Abstracts International, Volume: 42-02, page: 0617.
Contained By:	Masters Abstracts International42-02.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1416076

DIAS: Distributed interest-based adaptive search for P2P networks.
Liu, Ning.

DIAS: Distributed interest-based adaptive search for P2P networks. - 80 p.

Source: Masters Abstracts International, Volume: 42-02, page: 0617.

Thesis (M.S.)--Michigan State University, 2003.

Content search in decentralized P2P networks is a challenging problem. Gnutella, a widely used P2P system, employs the query flooding approach. Although this approach is simple and robust, its efficiency is fairly low.Subjects--Topical Terms:

626642
Computer Science.

DIAS: Distributed interest-based adaptive search for P2P networks.
LDR:02027nmm 2200277 4500 001 1864383
005 20041217072324.5
008 130614s2003 eng d
035 $a (UnM)AAI1416076
035 $a AAI1416076
040 $a UnM $c UnM
100 1 $a Liu, Ning. $3 1278109
245 1 0 $a DIAS: Distributed interest-based adaptive search for P2P networks.
300 $a 80 p.
500 $a Source: Masters Abstracts International, Volume: 42-02, page: 0617.
500 $a Advisers: Lionel Ni; Li Xiao.
502 $a Thesis (M.S.)--Michigan State University, 2003.
520 $a Content search in decentralized P2P networks is a challenging problem. Gnutella, a widely used P2P system, employs the query flooding approach. Although this approach is simple and robust, its efficiency is fairly low.
520 $a In this thesis, we propose an efficient P2P information retrieval system DIAS that supports state-of-the-art content search in the semantic layer. DIAS avoids the inefficient random flooding used in Gnutella by using an interest-based search scheme. Peers in a DIAS system sharing the common interest set are call "buddies". Each DIAS peer creates and updates its buddy list by computing the degree of interest similarity between its neighboring peer and itself periodically. Different interest groups are generated and maintained according to the buddy-relationship between any two peers. DIAS peers will issue and forward queries mostly within the interest groups associated with them. Our simulation result verifies that DIAS could achieve satisfactory search efficiency without producing too more traffic overhead, while retaining the simplicity and fairness of Gnutella. The implementation of DIAS on top of JXTA shows that it is a feasible system.
590 $a School code: 0128.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Michigan State University. $3 676168
773 0 $t Masters Abstracts International $g 42-02.
790 1 0 $a Ni, Lionel, $e advisor
790 1 0 $a Xiao, Li, $e advisor
790 $a 0128
791 $a M.S.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1416076