arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.3518eess.SYcs.SY
收藏

在级联故障下的鲁棒网络路由

Robust Network Routing under Cascading Failures

University of Southern California(南加州大学);Lund University(隆德大学);Massachusetts Institute of Technology(麻省理工学院)

Ketan Savla, Giacomo Como, Munther A. Dahleh

AI总结:

本文提出了一种动态模型,用于单商品网络流中的级联故障。模型通过网络状态和链路激活状态确定网络动态,分析了在扰动过程和路由策略下链路失效的机制,并提出算法计算网络韧性上界。

摘要:

我们提出了一种动态模型,用于单商品网络流中的级联故障。在所提出的模型中,网络状态由流量和链路的激活状态组成。网络动态由一个可能依赖于状态且具有对抗性的扰动过程决定,该过程减少链路的容量,而路由策略在节点处可访问网络状态,但对扰动的存在无意识。在所提出的动态下,链路因自身过载或所有直接下游链路的过载而不可逆地失效。链路激活与流量动态之间的耦合意味着失效的链路不一定是相邻的,因此本文模型中的级联故障模式与标准级联模型有本质区别。扰动过程的幅度定义为时间与链路的累计容量减少之和,网络的韧性定义为所有扰动过程下原节点链路失效的幅度的下确界。我们提出了一种算法,用于计算在路由策略仅能访问本地网络状态信息的情况下网络韧性上界。对于路由策略更新速度与网络动态相同的情况,我们识别了网络参数下界条件,使得上界在适当路由策略下是紧致的。我们的分析依赖于将网络参数与所提出动态下网络状态演变的单调性联系起来。

英文摘要:

We propose a dynamical model for cascading failures in single-commodity network flows. In the proposed model, the network state consists of flows and activation status of the links. Network dynamics is determined by a, possibly state-dependent and adversarial, disturbance process that reduces flow capacity on the links, and routing policies at the nodes that have access to the network state, but are oblivious to the presence of disturbance. Under the proposed dynamics, a link becomes irreversibly inactive either due to overload condition on itself or on all of its immediate downstream links. The coupling between link activation and flow dynamics implies that links to become inactive successively are not necessarily adjacent to each other, and hence the pattern of cascading failure under our model is qualitatively different than standard cascade models. The magnitude of a disturbance process is defined as the sum of cumulative capacity reductions across time and links of the network, and the margin of resilience of the network is defined as the infimum over the magnitude of all disturbance processes under which the links at the origin node become inactive. We propose an algorithm to compute an upper bound on the margin of resilience for the setting where the routing policy only has access to information about the local state of the network. For the limiting case when the routing policies update their action as fast as network dynamics, we identify sufficient conditions on network parameters under which the upper bound is tight under an appropriate routing policy. Our analysis relies on making connections between network parameters and monotonicity in network state evolution under proposed dynamics.

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

↑