DALD:distributed asynchronous local decontamination algorithm in arbitrary graphs
سال انتشار: 1393
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 553
فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JECEI-2-1_004
تاریخ نمایه سازی: 15 آذر 1394
چکیده مقاله:
network environments always can be invaded by intrruder agents.in network where are performing some computations, intruder agents might contaminate some nodes.therefore,problem of decontaminating a network infected by intruder agents is one of the major problems in these networks.in this paper,we present a distributed asynchronous local algorithm for decontaminating a network.in most of prior algorithms, there is a coordinator agent taht starts from a node and decontaminates the network.since this procedure is handled by an agent and in centralized mode decontamination algorithm is very slow.in our algorithm the network is decomposed to some clusters and a coordinator is advocated to each cluster.therefore,there is more than one coordinator that each of them starts from different nodes in the network and decontaminates network,independently.in this case,network is decontaminated faster.in addition,in previous works the upper bound of the number of moves and the number of cleaner agents required to decontaminate network are given only for network with special structures such as ring or tori while our algorithm establishes these upper bounds on networks with arbitrary structre.
کلیدواژه ها:
network decontamination-mobile agents-distributed algorithm
نویسندگان
maryam rahmaninia
department of computer engineering islamic azad university ,ghasr-Eshirin branch,kermanshah,iran
elnaz bigdeli
electrical engineering and computer science,university of ottawa,ontario,canada.
manouchehr zaker
mathematics and computr science department,institute for advanced studies in basic sciences,zanjan,iran