公开(公告)号：US07561534B2

公开(公告)日：2009-07-14

申请号：US10880887

申请日：2004-06-30

申请人： Mansoor Ali Khan Alicherry ,  Iraj Saniee ,  Sudipta Sengupta

发明人： Mansoor Ali Khan Alicherry ,  Iraj Saniee ,  Sudipta Sengupta

IPC分类号： H04L12/28

CPC分类号： H04L45/28 ,  H04L45/00 ,  H04L45/123 ,  H04L45/124 ,  H04L45/22

摘要： A number of techniques are described for routing methods that improve resistance to faults affecting groups of links subject to common risks. One of these techniques accounts for failure potentials in physical networks by considering shared risk link groups separately from performance and costs metrics in determining a primary routing path and a backup path. A shared risk link group (SRLG) is an attribute attached to a link to identify edges that have physical links in common and can therefore be simultaneously disrupted due to a single fault. Another technique considers node disjointness and provides a solution of two paths that are as node disjoint as possible and minimizes administrative costs. The techniques may further be combined in a priority order thereby providing a solution of at least two paths that are strictly SRLG disjoint, as node-disjoint as possible, and have minimum administrative costs. Due to the priority order of evaluation and typical network physical configurations of links, with the links associated common fault SRLGs, the priority ordering technique is very efficient in determining at least two paths for routing between a source and destination node.

摘要翻译： 描述了一些技术，用于路由方法，这些方法提高了对存在常见风险的链接组的故障的抵抗力。 这些技术之一通过在确定主要路由路径和备用路径时与性能和成本指标分开考虑共享风险链路组来解决物理网络中的故障潜能。 共享风险链接组（SRLG）是附加到链接的属性，用于识别具有共同物理链路的边缘，因此可能由于单个故障而同时中断。 另一种技术考虑到节点不相交，并提供了尽可能节点不相交的两条路径的解决方案，并将管理成本降至最低。 这些技术可以进一步以优先级顺序组合，从而提供严格SRLG不相交的至少两条路径的解决方案，作为节点不相交并且具有最小的管理成本。 由于评估的优先级顺序和链路的典型网络物理配置，链路与公共故障SRLGs相关联，所以优先级排序技术在确定用于在源节点和目的地节点之间路由的至少两个路径方面是非常有效的。

公开(公告)号：US07453796B2

公开(公告)日：2008-11-18

申请号：US10860948

申请日：2004-06-04

申请人： Mansoor Ali Khan Alicherry ,  Randeep Singh Bhatia ,  Yung-Chun Wan

发明人： Mansoor Ali Khan Alicherry ,  Randeep Singh Bhatia ,  Yung-Chun Wan

IPC分类号： G01R31/08 ,  G06F11/00 ,  G08C15/00 ,  H04J1/16 ,  H04J3/14 ,  H04L1/00 ,  H04L12/26

CPC分类号： H04L41/0663 ,  H04J3/14 ,  H04L41/0806 ,  H04L41/0896 ,  H04L41/12 ,  H04L41/145 ,  H04L45/10 ,  H04L45/22 ,  H04L45/28 ,  H04L45/48 ,  H04L45/50 ,  H04L47/70 ,  H04L47/728 ,  H04L47/746 ,  H04L47/825 ,  H04L47/829

摘要： Improved network design techniques are provided. More particularly, the invention provides network design techniques that support fast restoration. In one aspect of the invention, a technique for designing a protection capacity to be reserved in a network comprises the following steps/operations. Link capacities associated with a network topology and existing working traffic in the network are obtained. Capacity partitions are determined for links in the network topology. Each of at least a portion of the capacity partitions comprise a protection capacity portion and a working capacity portion that equals or exceeds the existing working traffic on a corresponding link, such that upon a failure on the link, the working traffic on the link is rerouted over a pre-provisioned detour path using the protection capacity portion on one or more links on the detour path. Further, the capacity partition determination step/operation substantially guarantees protection for existing working traffic in the network. Still further, the capacity partition determining step/operation may further substantially guarantee protection for future working traffic in the network.

摘要翻译： 提供了改进的网络设计技术。 更具体地，本发明提供支持快速恢复的网络设计技术。 在本发明的一个方面，一种用于设计在网络中保留的保护容量的技术包括以下步骤/操作。 获得与网络拓扑和网络中现有工作流量相关联的链路容量。 为网络拓扑中的链路确定容量分区。 容量分区的至少一部分中的每一个包括等于或超过相应链路上的现有工作流量的保护容量部分和工作容量部分，使得在链路故障时，链路上的工作业务被重新路由 在迂回路径上的一个或多个链路上使用保护容量部分的预先设置的迂回路径。 此外，容量分区确定步骤/操作基本上保证了对网络中现有工作流量的保护。 此外，容量分区确定步骤/操作可以进一步基本上保证对网络中未来工作业务的保护。

公开(公告)号：US20080046423A1

公开(公告)日：2008-02-21

申请号：US11497065

申请日：2006-08-01

申请人： Mansoor Ali Khan Alicherry ,  Muthuprasanna Muthusrinivasan

发明人： Mansoor Ali Khan Alicherry ,  Muthuprasanna Muthusrinivasan

IPC分类号： G06F17/30

CPC分类号： G06F17/30985 ,  Y10S707/99936

摘要： Disclosed is a method and system for multi-character multi-pattern pattern matching. In the multi-character multi-pattern pattern matching method, patterns in an input stream are detected by transitioning between states of a “compressed deterministic finite state automaton (DFA)”, with each transition based on multiple characters of the input stream. The compressed DFA is created by compressing an original DFA, such as an Aho-Corasick DFA, such that each state of the compressed DFA represents multiple consecutive states of the original DFA and each transition between the states of the compressed DFA is a combination of all of the transitions between the multiple consecutive states of the original DFA. This method can be implemented using a Ternary Content-Addressable Memory (TCAM) to store the transitions of the compressed DFA and compares the transitions with multiple characters of an input stream at a time to detect patterns in the input stream.

摘要翻译： 公开了一种用于多字符多图案模式匹配的方法和系统。 在多字符多图案模式匹配方法中，通过在“压缩的确定性有限状态自动机（DFA）”的状态之间进行转换，基于输入流的多个字符进行每个转换来检测输入流中的模式。 压缩的DFA是通过压缩诸如Aho-Corasick DFA的原始DFA来创建的，使得压缩的DFA的每个状态表示原始DFA的多个连续状态，并且压缩DFA的状态之间的每个转换是所有 的原始DFA的多个连续状态之间的转换。 可以使用三元内容可寻址存储器（TCAM）来实现该方法来存储压缩DFA的转换，并将转换与一次输入流的多个字符进行比较，以检测输入流中的模式。