arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.0076eess.SYcs.SYmath.DS
收藏

具有级联故障的动态网络中的鲁棒分布式路由

Robust Distributed Routing in Dynamical Networks with Cascading Failures

Lund University(隆德大学);Massachusetts Institute of Technology(麻省理工学院)

Giacomo Como, Ketan Savla, Daron Acemoglu, Munther A. Dahleh, Emilio Frazzoli

AI总结:

针对具有级联故障的动态网络,提出一种基于常微分方程和有限容量链接的分布式路由策略,并分析其对流量函数扰动的鲁棒性。

摘要:

路由策略的鲁棒性是一个核心问题,随着对保护关键基础设施网络免受自然和人为干扰的日益关注,这一问题越来越受到重视。在有限信息下进行路由以及网络中可能发生的级联现象给这一问题带来了严峻挑战。本文考虑了我们早期工作[1,2]中引入的动态网络框架,其中网络由基于有向无环图上的质量守恒定律导出的常微分方程组建模,具有单一源-目的地对和源处的恒定流入。网络每条链路上粒子密度的变化率等于该链路的流入与流出之差。后者被建模为通过流量函数依赖于该链路上的当前粒子密度。本文的新建模元素是假设每条链路具有有限的粒子密度容量,并且流量函数被建模为当密度从零增加到最大密度容量时严格递增,在最大密度容量处不连续,且该点的流量函数值为零。这一特性尤其允许我们的模型中存在回溢的可能性。在本文中,我们展示了在分布式路由下,此类网络对降低链路流量函数的扰动的弹性结果。

英文摘要:

Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited information and the possibility of cascades through the network adds serious challenges to this problem. This abstract considers the framework of dynamical networks introduced in our earlier work [1,2], where the network is modeled by a system of ordinary differential equations derived from mass conservation laws on directed acyclic graphs with a single origin-destination pair and a constant inflow at the origin. The rate of change of the particle density on each link of the network equals the difference between the inflow and the outflow on that link. The latter is modeled to depend on the current particle density on that link through a flow function. The novel modeling element in this paper is that every link is assumed to have finite capacity for particle density and that the flow function is modeled to be strictly increasing as density increases from zero up to the maximum density capacity, and is discontinuous at the maximum density capacity, with the flow function value being zero at that point. This feature, in particular, allows for the possibility of spill-backs in our model. In this paper, we present our results on resilience of such networks under distributed routing, towards perturbations that reduce link-wise flow functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑