专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07646706B2 Restoration time in mesh networks 有权
标题翻译：网状网络中的恢复时间
公开(公告)号：US07646706B2
公开(公告)日：2010-01-12
申请号：US10673056
申请日：2003-09-26
申请人： Abdo Y. Alfakih , Gary W. Atkinson , Carol L. Janczewski , Kamala Murti , Ramesh Nagarajan
发明人： Abdo Y. Alfakih , Gary W. Atkinson , Carol L. Janczewski , Kamala Murti , Ramesh Nagarajan
IPC分类号： G01R31/08 , H04L12/26
CPC分类号： H04L41/0668 , H04L43/0811
摘要： A restoration path planner that minimizes the worst-case number of cross-connections that must be performed in a network in the event of a single element failure involves a two-phase optimization. The first phase involves finding two node-disjoint paths for each service demand within a network such that the maximum link bandwidth in the network is minimized and the link bandwidths within the network are leveled. The second phase involves identifying the primary and restoration paths for each service demand within the network such that the worst-case number of cross-connections at any node within the network is minimized across all possible single-event failures. Embodiments also consider service demand-bundling that groups service demands with the same source-destination node pairs and routes them along identical primary and restoration paths, and banding, which consolidates multiple low-rate demands into a high-rate demand and consequently decreases cross-connections required in the event of a failure.
摘要翻译：在单个单元故障的情况下，最小化必须在网络中执行的最坏情况数量的交叉连接的恢复路径规划涉及两阶段优化。第一阶段涉及为网络内的每个服务需求找到两个节点不相交路径，使得网络中的最大链路带宽最小化，并且网络内的链路带宽被调平。第二阶段涉及识别网络中每个服务需求的主路径和恢复路径，使得网络中任何节点处的最坏情况数量的交叉连接在所有可能的单个事件故障中最小化。实施例还考虑服务需求捆绑，其将服务需求与相同的源 - 目的地节点对进行分组，并将它们沿着相同的主和恢复路径和条带进行路由，并将多个低速率需求合并为高速率需求，发生故障时所需的连接。

IPRDB

热门服务

关于我们

友情链接

联系方式