使用单个代理的网络净化
Network Decontamination with a Single Agent
摘要:
在网络环境中,故障和病毒通常通过从站点传播到相邻站点来传播。我们用图来模拟{ \em网络污染}的过程。考虑一个图$G=(V,E)$,其顶点集被污染,我们的目标是使用移动净化代理沿着$G$的边集遍历来净化集$V(G)$。时间免疫$τ(G) \ge 0$定义为$G$的净化顶点可以持续暴露于某些污染邻居而自身不被感染的时间。$G$的\emph{immunity number}($ι_k(G)$)是使用$k$试剂净化$G$所需的最小$τ$。研究了几类网络拓扑图的免疫数,给出了$ι_1(G)$的上界,在某些情况下给出了匹配的下界。这个问题的变化已被广泛研究,在文献中,但提出的算法已被限制到{ \em单调}的策略,其中一个顶点,一旦净化,可能不会被重新污染。我们利用非单调性给出的界限是严格优于那些使用单调策略。
英文摘要:
Faults and viruses often spread in networked environments by propagating from site to neighboring site. We model this process of {\em network contamination} by graphs. Consider a graph $G=(V,E)$, whose vertex set is contaminated and our goal is to decontaminate the set $V(G)$ using mobile decontamination agents that traverse along the edge set of $G$. Temporal immunity $τ(G) \ge 0$ is defined as the time that a decontaminated vertex of $G$ can remain continuously exposed to some contaminated neighbor without getting infected itself. The \emph{immunity number} of $G$, $ι_k(G)$, is the least $τ$ that is required to decontaminate $G$ using $k$ agents. We study immunity number for some classes of graphs corresponding to network topologies and present upper bounds on $ι_1(G)$, in some cases with matching lower bounds. Variations of this problem have been extensively studied in literature, but proposed algorithms have been restricted to {\em monotone} strategies, where a vertex, once decontaminated, may not be recontaminated. We exploit nonmonotonicity to give bounds which are strictly better than those derived using monotone strategies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。