東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Distributed true string B-tree peer-...

Wu, Li.

FindBook

Google Book

Amazon

博客來

Distributed true string B-tree peer-to-peer overlay networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Distributed true string B-tree peer-to-peer overlay networks./
作者:	Wu, Li.
面頁冊數:	67 p.
附註:	Source: Masters Abstracts International, Volume: 44-06, page: 2861.
Contained By:	Masters Abstracts International44-06.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR14971
ISBN:	9780494149713

Distributed true string B-tree peer-to-peer overlay networks.
Wu, Li.

Distributed true string B-tree peer-to-peer overlay networks. - 67 p.

Source: Masters Abstracts International, Volume: 44-06, page: 2861.

Thesis (M.C.Sc.)--University of Ottawa (Canada), 2006.

A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks which use DHT as their core data structure, the DTSBT P2P overlay network employs a new data structure, DTSBT as its core data structure. A DTSBT is a hybrid distributed data structure, in which all peers' routing tables make up a virtual B-tree and a Patricia Trie is plugged into each peer's routing table. The performance evaluation showed that the DTSBT P2P overlay network is more scalable, decentralized, resilient to failures, and self-organized compared to its competitors.

ISBN: 9780494149713Subjects--Topical Terms:

626642
Computer Science.

Distributed true string B-tree peer-to-peer overlay networks.
LDR:01618nmm 2200241 4500 001 1835402
005 20071217104338.5
008 130610s2006 eng d
020 $a 9780494149713
035 $a (UMI)AAIMR14971
035 $a AAIMR14971
040 $a UMI $c UMI
100 1 $a Wu, Li. $3 1924026
245 1 0 $a Distributed true string B-tree peer-to-peer overlay networks.
300 $a 67 p.
500 $a Source: Masters Abstracts International, Volume: 44-06, page: 2861.
502 $a Thesis (M.C.Sc.)--University of Ottawa (Canada), 2006.
520 $a A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks which use DHT as their core data structure, the DTSBT P2P overlay network employs a new data structure, DTSBT as its core data structure. A DTSBT is a hybrid distributed data structure, in which all peers' routing tables make up a virtual B-tree and a Patricia Trie is plugged into each peer's routing table. The performance evaluation showed that the DTSBT P2P overlay network is more scalable, decentralized, resilient to failures, and self-organized compared to its competitors.
590 $a School code: 0918.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Ottawa (Canada). $3 1017488
773 0 $t Masters Abstracts International $g 44-06.
790 $a 0918
791 $a M.C.Sc.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR14971