多树中的字典最小值置乱
Lexico-minimum Replica Placement in Multitrees
摘要:
在这项工作中,我们考虑的问题,将副本放在数据中心或存储区域网络,表示为一个有向图,以便字典最小化以前提出的可靠性措施,最大限度地减少所有故障事件的影响,在模型中的严重程度降序。以前的工作集中在特殊情况下,其中的有向图是一个树形图。在这项工作中,我们考虑了更广泛的一类多树:有向图,其中的子图诱导顶点可达从一个固定的节点形成一棵树。我们parameterized多树的“根”(节点的度为零)的数量,并排除成员的固定参数易处理的问题(FPT)的类,通过显示,找到最佳的副本放置在多树3根是NP-难的。在积极的一面,我们发现,在类的\emph{untangled}多树找到最佳副本放置的问题是FPT,参数化的复制因子$ρ$和根数$k$。我们的方法结合了动态规划(DP)与一种新的树分解,找到一个最佳的位置$ρ$副本的叶子上的多树与$n$节点和$k$根在$O(n^2ρ^{2k+3})$的时间。
英文摘要:
In this work, we consider the problem of placing replicas in a data center or storage area network, represented as a digraph, so as to lexico-minimize a previously proposed reliability measure which minimizes the impact of all failure events in the model in decreasing order of severity. Prior work focuses on the special case in which the digraph is an arborescence. In this work, we consider the broader class of multitrees: digraphs in which the subgraph induced by vertices reachable from a fixed node forms a tree. We parameterize multitrees by their number of "roots" (nodes with in-degree zero), and rule out membership in the class of fixed-parameter tractable problems (FPT) by showing that finding optimal replica placements in multitrees with 3 roots is NP-hard. On the positive side, we show that the problem of finding optimal replica placements in the class of \emph{untangled} multitrees is FPT, as parameterized by the replication factor $ρ$ and the number of roots $k$. Our approach combines dynamic programming (DP) with a novel tree decomposition to find an optimal placement of $ρ$ replicas on the leaves of a multitree with $n$ nodes and $k$ roots in $O(n^2ρ^{2k+3})$ time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。