用于有效检测静默故障的探测调度
Probe Scheduling for Efficient Detection of Silent Failures
摘要:
大多数用于静默故障的发现系统在两个阶段中工作:通过探测数据包检测故障的存在的连续监视阶段和精确定位故障元件的定位阶段。这种分离是重要的,因为定位需要比检测更多的资源,并且应该仅在出现故障时启动。我们专注于提高检测阶段的效率,目标是平衡开销与较长故障检测时间相关的成本。我们制定了一个通用的模型,它统一处理的探测调度机制,随机或确定性,和不同的成本目标-最小化平均检测时间(SUM)或最坏情况下的检测时间(MAX)。然后,我们集中在两个类的时间表。{ \em Memoryless schedules} --随机调度的一个子类,简单且适合分布式部署。我们表明,最佳的memoryless的搜索器可以有效地计算凸程序(SUM目标)或线性程序(MAX目标),令人惊讶的是,也许,保证有预期的检测时间是不是太远(NP硬)随机最优。{ \em确定性调度}允许我们约束未检测到的故障的最大(而不是期望)成本,但像随机调度一样,NP难优化。我们开发了新的有效的确定性的可证明的近似比。在真实网络上进行的广泛的模拟研究表明,我们的无记忆和确定性算法比以前的方法具有显着的性能增益。我们的统一处理也有利于不同目标和调度机制之间的清晰比较。
英文摘要:
Most discovery systems for silent failures work in two phases: a continuous monitoring phase that detects presence of failures through probe packets and a localization phase that pinpoints the faulty element(s). This separation is important because localization requires significantly more resources than detection and should be initiated only when a fault is present. We focus on improving the efficiency of the detection phase, where the goal is to balance the overhead with the cost associated with longer failure detection times. We formulate a general model which unifies the treatment of probe scheduling mechanisms, stochastic or deterministic, and different cost objectives - minimizing average detection time (SUM) or worst-case detection time (MAX). We then focus on two classes of schedules. {\em Memoryless schedules} -- a subclass of stochastic schedules which is simple and suitable for distributed deployment. We show that the optimal memorlyess schedulers can be efficiently computed by convex programs (for SUM objectives) or linear programs (for MAX objectives), and surprisingly perhaps, are guaranteed to have expected detection times that are not too far off the (NP hard) stochastic optima. {\em Deterministic schedules} allow us to bound the maximum (rather than expected) cost of undetected faults, but like stochastic schedules, are NP hard to optimize. We develop novel efficient deterministic schedulers with provable approximation ratios. An extensive simulation study on real networks, demonstrates significant performance gains of our memoryless and deterministic schedulers over previous approaches. Our unified treatment also facilitates a clear comparison between different objectives and scheduling mechanisms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。