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...

OBJECTIVES To determine the effect on mortality of selective digestive decontamination, selective oropharyngeal decontamination, and topical oropharyngeal chlorhexidine in adult patients in general intensive care units and to compare these interventions with each other in a network meta-analysis. DESIGN Systematic review, conventional meta-analysis, and network meta-analysis. Medline, Embase,...

We consider the problem of decontaminating an infected network using as few mobile cleaning agents as possible and avoiding recontamination. After a cleaning agent has left a vertex v, this vertex will become recontaminated if m or more of its neighbours are infected, where m ≥ 1 is a threshold parameter of the system indicating the local immunity level of the network. This network decontaminat...

Exploration in an unsafe environment is one of the major problems that can be seen as a basic block for many distributed mobile protocols. In such environment we consider that either the nodes (hosts) or the agents can pose some danger to the network. Two cases are considered. In the first case, the dangerous node is a called black hole, a node where incoming agents are trapped, and the problem...

We consider the problem of decontaminating a network infected by a mobile virus. The goal is to perform the task using as small a team of antiviral agents as possible, avoiding recontamination of disinfected areas. In all the existing literature, it is assumed that the immunity level of a decontaminated site is nil; that is, a decontaminated node, in absence of an antiviral agent on site, may b...

Faults and viruses often spread in networked environments by propa10 gating from site to neighboring site. We model this process of network contamina11 tion by graphs. Consider a graph G = (V,E), whose vertex set is contaminated 12 and our goal is to decontaminate the set V (G) using mobile decontamination 13 agents that traverse along the edge set of G. Temporal immunity τ(G) ≥ 0 is 14 defined...

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...