容错BFS结构:加强-备份权衡
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff
摘要:
本文首先研究了混合两种正交保护机制的故障恢复网络结构:(a){ \em备份},即用许多(冗余)低成本但易出错的组件来增强结构,以及(b){ \em增强},即获取高成本但抗故障的组件。为了研究这两种机制在具体环境中的折衷,我们解决了设计$(b,r)$ { \em fault-tolerant} BFS的问题(或简称为$(b,r)$ FT-BFS)结构,即网络$G$的子图$H$由两种类型的边组成:- 一组$E' \subseteq E$ $r(n)$容错{ \em增强}边,其被假定为永不失效,以及$b(n)$易故障{ \em备份}边缘的(较大)集合$E(H) \setminus E'$,使得在单个易故障备份边缘$e \in E \setminus E'$的故障之后,$H$的幸存部分仍然包含用于($G$的幸存部分),对于每个$v \in V$和$e \in E \setminus E'$满足$dist(s,v,H\setminus \{e\}) \leq dist(s,v,G\setminus \{e\})$。我们在$b(n)$和$r(n)$之间建立了以下权衡:对于每个真实的$ε\in (0,1]$,如果$r(n) = {\tildeΘ}(n^{1-ε})$,则$b(n) = {\tildeΘ}(n^{1+ε})$是必要和充分的。
英文摘要:
This paper initiates the study of fault resilient network structures that mix two orthogonal protection mechanisms: (a) {\em backup}, namely, augmenting the structure with many (redundant) low-cost but fault-prone components, and (b) {\em reinforcement}, namely, acquiring high-cost but fault-resistant components. To study the trade-off between these two mechanisms in a concrete setting, we address the problem of designing a $(b,r)$ {\em fault-tolerant} BFS (or $(b,r)$ FT-BFS for short) structure, namely, a subgraph $H$ of the network $G$ consisting of two types of edges: a set $E' \subseteq E$ of $r(n)$ fault-resistant {\em reinforcement} edges, which are assumed to never fail, and a (larger) set $E(H) \setminus E'$ of $b(n)$ fault-prone {\em backup} edges, such that subsequent to the failure of a single fault-prone backup edge $e \in E \setminus E'$, the surviving part of $H$ still contains an BFS spanning tree for (the surviving part of) $G$, satisfying $dist(s,v,H\setminus \{e\}) \leq dist(s,v,G\setminus \{e\})$ for every $v \in V$ and $e \in E \setminus E'$. We establish the following tradeoff between $b(n)$ and $r(n)$: For every real $ε\in (0,1]$, if $r(n) = {\tildeΘ}(n^{1-ε})$, then $b(n) = {\tildeΘ}(n^{1+ε})$ is necessary and sufficient.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。