DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs

Authors

  • Elnaz Bigdeli Electrical Engineering and Computer Science, University of Ottawa, Ontario, Canada.
  • Manouchehr Zaker Mathematics and Computer Science Department, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran.
  • Maryam Rahmaninia Department of Computer Engineering, Islamic Azad University, Ghasr-E-Shirin Branch, Kermanshah, Iran.
Abstract:

Network environments always can be invaded by intruder agents. In networks where nodes 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 that 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 networks with special structures such as ring or tori while our algorithm establishes these upper bounds on networks with arbitrary structure.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

dald:-distributed-asynchronous-local-decontamination algorithm in arbitrary graphs

network environments always can be invaded by intruder agents. in networks where nodes 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 mos...

full text

Asynchronous Distributed Incremental Computation on Evolving Graphs

Graph algorithms have become an essential component in many real-world applications. An essential property of graphs is that they are often dynamic. Many applications must update the computation result periodically on the new graph so as to keep it up-to-date. Incremental computation is a promising technique for this purpose. Traditionally, incremental computation is typically performed synchro...

full text

Distributed Quadratic Programming over Arbitrary Graphs

In this paper, the locality features of infinitedimensional quadratic programming (QP) optimization problems are studied. Our approach is based on tools from operator theory and ideas from Multi Parametric Quadratic Programming (MPQP). The key idea is to use the spatially decaying operators (SD), which has been recently developed to study spatially distributed systems in [1], to capture couplin...

full text

Distributed Optimization with Arbitrary Local Solvers

With the growth of data and necessity for distributed optimization methods, solvers that work well on a single machine must be re-designed to leverage distributed computation. Recent work in this area has been limited by focusing heavily on developing highly specific methods for the distributed environment. These special-purpose methods are often unable to fully leverage the competitive perform...

full text

Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus

We present a local routing algorithm which guarantees delivery in all connected graphs embedded on a known surface of genus g. The algorithm transports O(g log n) memory and finishes in time O(gn), where n is the size of the graph. It requires access to a homology basis for the surface. This algorithm, GFR, may be viewed as a suitable generalization of Face Routing (FR), the well-known algorith...

full text

A Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems

Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 1

pages  21- 27

publication date 2014-04-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023