東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Using mobile agents for Black Hole s...

Shi, Wei.

FindBook

Google Book

Amazon

博客來

Using mobile agents for Black Hole search with tokens in multi networks.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Using mobile agents for Black Hole search with tokens in multi networks./
作者:	Shi, Wei.
面頁冊數:	215 p.
附註:	Source: Dissertation Abstracts International, Volume: 68-05, Section: B, page: 3167.
Contained By:	Dissertation Abstracts International68-05B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR27112
ISBN:	9780494271124

Using mobile agents for Black Hole search with tokens in multi networks.
Shi, Wei.

Using mobile agents for Black Hole search with tokens in multi networks. - 215 p.

Source: Dissertation Abstracts International, Volume: 68-05, Section: B, page: 3167.

Thesis (Ph.D.)--Carleton University (Canada), 2007.

A Black Hole is a highly harmful host that disposes of visiting agents upon their arrival without leaving any observable trace of such destruction. In this dissertation, we study the Black Hole search problem using mobile agents in four topologies: ring, hypercube, torus and complete network. We do so without relying on local storage. Instead we use a less-demanding and less-expensive token mechanism.

ISBN: 9780494271124Subjects--Topical Terms:

626642
Computer Science.

Using mobile agents for Black Hole search with tokens in multi networks.
LDR:02952nam 2200277 a 45 001 958743
005 20110704
008 110704s2007 ||||||||||||||||| ||eng d
020 $a 9780494271124
035 $a (UMI)AAINR27112
035 $a AAINR27112
040 $a UMI $c UMI
100 1 $a Shi, Wei. $3 907873
245 1 0 $a Using mobile agents for Black Hole search with tokens in multi networks.
300 $a 215 p.
500 $a Source: Dissertation Abstracts International, Volume: 68-05, Section: B, page: 3167.
502 $a Thesis (Ph.D.)--Carleton University (Canada), 2007.
520 $a A Black Hole is a highly harmful host that disposes of visiting agents upon their arrival without leaving any observable trace of such destruction. In this dissertation, we study the Black Hole search problem using mobile agents in four topologies: ring, hypercube, torus and complete network. We do so without relying on local storage. Instead we use a less-demanding and less-expensive token mechanism.
520 $a In the first part of this dissertation, we study in depth the black hole search problem in an anonymous ring network. We prove that with co-located agents, the problem can be solved with a minimal of two co-located agents, three tokens in total performing in theta(n log n) moves. With scattered agents, we prove that, in oriented rings, the number of moves can be reduced from O(n 2) to the optimal theta(n log n) using only O(1) tokens per agent, without any knowledge of the team size. Interestingly, the proposed algorithm also solves, with the same cost, the Leader Election problem and the Rendezvous problem for the scattered agents despite the presence of a Black Hole. Then we prove that, even if the ring is un-oriented, locating the Black Hole is feasible with a minimum of three (3) scattered agents. With a team of four (4) or more scattered agents, O(1) tokens per agent, a Black Hole can be located with theta(n log n) moves.
520 $a We study the Black Hole Search problem also for three other topologies. For the co-located agents, we show that the Black Hole can be located with minimum of 2 agents performing theta(n) moves with O(1) tokens in each of these three topologies. We present solutions for the Torus and Complete Network with scattered agents, knowing that the Black Hole Search problem was never studied with scattered agents in any of these three network topologies, neither using the whiteboard model, nor with the token model.
520 $a For these four topologies, in both the co-located and scattered agents cases, we obtain solutions with minimum number of agents and demonstrate that the number of tokens can be reduced to a constant number even if both the mobile agents and the network are anonymous.
590 $a School code: 0040.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Carleton University (Canada). $3 1018407
773 0 $t Dissertation Abstracts International $g 68-05B.
790 $a 0040
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR27112