-
1.发明授权公开(公告)号：US07986618B2
公开(公告)日：2011-07-26
申请号：US10171395
申请日：2002-06-12
IPC分类号： G01R31/08
摘要： Systems and methods for distinguishing a node failure from a link failure are provided. By strengthening the assumption of independent failures, bandwidth sharing among backup tunnels protecting links and nodes of a network is facilitated as well as distributed computation of backup tunnel placement. Thus a backup tunnel overlay network can provide guaranteed bandwidth in the event of a failure.
摘要翻译： 提供了用于区分节点故障与链路故障的系统和方法。 通过加强独立故障的假设，便于保护网络链路和节点的备份隧道之间的带宽共享，以及备份隧道布局的分布式计算。 因此，备份隧道覆盖网络可以在发生故障时提供有保证的带宽。
-
公开(公告)号：US07230913B1
公开(公告)日：2007-06-12
申请号：US10166886
申请日：2002-06-11
IPC分类号： H04L12/56
摘要： Fast Reroute capability is added to an IP network to guarantee fast recovery to IP traffic in case of link or node failure without the need to deploy a full mesh of MPLS Traffic Engineering Label Switched Paths (LSPs). In one implementation, to protect a link, a 1-hop primary LSP is configured for the protected link and in addition a backup tunnel is configured to protect the 1-hop primary LSP. To protect a node, 2-hop primary LSPs are established for the link pairs traversing the node and backup tunnel(s) are configured to protect these 2-hop primary LSPs.
摘要翻译： 快速重路由功能被添加到IP网络，以保证在链路或节点故障的情况下快速恢复到IP流量，而不需要部署MPLS流量工程标签交换路径（LSP）的全网。 在一种实现中，为了保护链路，为受保护链路配置了1跳主LSP，另外备份隧道配置为保护1跳主LSP。 为了保护节点，建立穿越节点的链路对的2跳主LSP，并配置备份隧道来保护这些2跳主LSP。
-
公开(公告)号：US07623461B2
公开(公告)日：2009-11-24
申请号：US11054145
申请日：2005-02-09
IPC分类号： G01R31/08
CPC分类号： H04L45/42 , H04L41/0677 , H04L43/0894 , H04L45/02 , H04L45/44 , H04L45/50
摘要： A technique triggers packing of path computation requests (PCRs) for traffic engineering (TE) label switched paths (LSPs) that are sent from one or more label-switched routers (LSRs) to a path computation element (PCE) of a computer network. According to the novel technique, incoming PCRs are packed into sets in response to a certain event, and one or more TE-LSPs (paths) are computed for each PCR of a particular set based on the PCRs of that set. Specifically, the PCE detects an event in the network (“network event”) indicating that an increase in the number of incoming PCRs has occurred, or that an increase is likely to occur due to, e.g., a change in a network element. Once the network event has been detected, the PCE packs the incoming PCRs into configured-length sets, such as, e.g., for a specified time interval or a certain number of PCRs. The PCE computes paths for each PCR of a particular set while considering the other PCRs of that set, thereby reducing race conditions, signaling overhead, and set-up failures.
摘要翻译： 一种技术触发了从一个或多个标签交换路由器（LSR）发送到计算机网络的路径计算元件（PCE）的流量工程（TE）标签交换路径（LSP）的路径计算请求（PCR）的打包。 根据新技术，响应于某个事件将输入的PCR打包成集合，并且基于该集合的PCR针对特定集合的每个PCR计算一个或多个TE-LSP（路径）。 具体地，PCE检测网络中的事件（“网络事件”），其指示进入的PCR的数量的增加已经发生，或者由于例如网络元件的变化而可能发生增加。 一旦检测到网络事件，PCE将输入的PCR打包成配置长度的集合，例如，指定的时间间隔或一定数量的PCR。 PCE计算特定集合的每个PCR的路径，同时考虑该集合的其他PCR，从而减少竞争条件，信令开销和建立故障。
-
公开(公告)号：US07599349B2
公开(公告)日：2009-10-06
申请号：US10767574
申请日：2004-01-29
CPC分类号： H04L45/48 , H04L45/04 , H04L45/124 , H04L45/50
摘要： Systems and methods for computing the paths of MPLS Traffic Engineering LSPs across Autonomous System and/or area boundaries. A distributed path computation algorithm exploits multiple path computation elements (PCEs) to develop a virtual shortest path tree (VSPT) resulting in computation of an end-to-end optimal (shortest) path. In some implementations, the VSPT is computed recursively across all the Autonomous Systems and/or areas between the head-end and tail-end of the Traffic Engineering LSP.
摘要翻译： 用于计算跨自治系统和/或区域边界的MPLS流量工程LSP路径的系统和方法。 分布式路径计算算法利用多路径计算元素（PCE）开发虚拟最短路径树（VSPT），导致端对端最优（最短）路径的计算。 在一些实现中，VSPT被递归地跨越所有自治系统和/或交通工程LSP的前端和尾端之间的区域计算。
-
公开(公告)号：US07359386B2
公开(公告)日：2008-04-15
申请号：US10725606
申请日：2003-12-02
CPC分类号： H04L45/00 , H04L29/06 , H04L45/50 , H04L47/10 , H04L47/2433 , H04L47/245 , H04L47/70 , H04L47/74 , H04L47/765 , H04L47/805 , H04L47/824 , H04L47/825 , H04L47/826 , H04L69/28
摘要： Systems and methods for preemption of Traffic Engineering LSPs such that preemption decisions are made in a coordinated fashion along the path of a new LSP and computation of a new path for a preempted LSP can take advantage of knowledge of newly unavailable links. The efficiency of the preemption mechanism is greatly increased and the undesirable effects of heterogeneous preemption decisions are limited. The amount of signaling may also be significantly reduced. In one implementation, these advantages are achieved by exploiting an upstream preemption feedback mechanism that uses an incremental timer to delay preemption decisions until feedback is available.
摘要翻译： 流量工程LSP抢占的系统和方法，使得沿着新LSP的路径以协调的方式进行抢占决策，并为抢占的LSP计算新的路径，可以利用新的不可用链路的知识。 抢占机制的效率大大提高，异质抢占决策的不良影响有限。 信号量也可以显着降低。 在一个实现中，这些优点通过利用上游抢占反馈机制来实现，该机制使用增量定时器来延迟抢占决定，直到反馈可用。
-
公开(公告)号：US07031262B2
公开(公告)日：2006-04-18
申请号：US10848744
申请日：2004-05-19
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/04 , H04L45/125 , H04L45/42 , H04L45/44 , H04L45/50 , H04L45/70 , H04L47/125 , H04L47/762 , H04L47/822 , H04L47/825
摘要： A mechanism to alleviate bandwidth fragmentation in a network employing path computation element(s) to place MPLS Traffic Engineering tunnels. One application is a multiple Autonomous System or multiple area network employing distributed computation of MPLS Traffic Engineering LSPs. A particular path computation element may determine that bandwidth fragmentation is present based on monitoring of path computation failures where desired paths are blocked due to bandwidth constraints. In response to the detected bandwidth fragmentation condition, the path computation element floods a routing notification within its Autonomous System or area. Nodes respond to the routing notification by requesting reoptimization of their own previously requested Traffic Engineering LSPs allowing the path computation element an opportunity to alleviate bandwidth fragmentation.
摘要翻译： 一种减轻使用路径计算元素的网络中带宽分段的放置MPLS流量工程隧道的机制。 一个应用是采用MPLS流量工程LSP的分布式计算的多自治系统或多区域网络。 特定路径计算元件可以基于由于带宽限制阻止期望路径的路径计算失败的监视来确定存在带宽分段。 响应于检测到的带宽分段条件，路径计算元件在其自治系统或区域内泛洪路由通知。 节点通过请求重新优化自己先前请求的流量工程LSP来响应路由通知，允许路径计算元素减轻带宽分段的机会。
-
7.发明授权Method and apparatus for determining network routing information based on shared risk link group information 有权基于共享风险链路组信息确定网络路由信息的方法和装置公开(公告)号：US07428213B2
公开(公告)日：2008-09-23
申请号：US10719003
申请日：2003-11-21
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04B1/71635 , H04L45/02 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/46 , H04L45/48 , H04L45/50 , H04W88/06 , H04W88/10
摘要： A method and apparatus are disclosed for performing a shortest path first network routing path determination in a data communications network based in part on information about links that are associated as shared risk link groups. Micro-loops are avoided in computing shortest path first trees by considering whether links are within shared risk link groups. In a first approach, for each link state packet in a link state database, listed adjacencies are removed if the link between the node originating the LSP and the reported adjacency belongs to a shared risk link group for which one component (local link) is known as down, and a shortest path first computation is then performed. In a second approach, during the SPT computation and after having added a first node to a path, each neighboring node is added to a tentative tree if and only if, a link between the first node and the neighboring node does not belong to a shared risk link group for which one component (local link) is known as down.
摘要翻译： 公开了一种用于在数据通信网络中执行最短路径第一网络路由路径确定的方法和装置，部分地基于关于作为共享风险链路组关联的链路的信息。 通过考虑链路是否在共享风险链路组内，避免了计算最短路径树的微循环。 在第一种方法中，对于链路状态数据库中的每个链路状态分组，如果发起LSP的节点和报告的邻接关系之间的链路属于已知一个组件（本地链路）的共享风险链路组，则删除列出的邻接关系 然后执行最短路径优先计算。 在第二种方法中，在SPT计算期间，并且在将第一节点添加到路径之后，当且仅当第一节点和相邻节点之间的链路不属于共享时，每个相邻节点被添加到暂定树 一个组件（本地链路）被称为down的风险链路组。
-
公开(公告)号：US07626925B1
公开(公告)日：2009-12-01
申请号：US10465179
申请日：2003-06-19
IPC分类号： H04J1/00
摘要： Methods and apparatus for unambiguously identifying merge points associated with backup label switched paths (LSPs) which substantially bypass border routers included along a primary LSP are disclosed. According to one aspect of the present invention, a method for finding a merge point between a primary LSP and a backup LSP which has a head-end and a tail-end in different regions includes obtaining identifying information, which identifies nodes on the path of the primary LSP, from a record route object associated with the primary LSP. The method also includes comparing a node address of the identifying information with a destination address of the backup LSP or a node address present in a node identifier (node-ID) subobject of the backup LSP to identify the merge point.
摘要翻译： 公开了用于明确地标识与沿着主LSP包括的边界路由器基本上绕过的备份标签交换路径（LSP）相关联的合并点的方法和装置。 根据本发明的一个方面，一种在不同区域中具有头端和尾端的主LSP和备用LSP之间的合并点的方法包括：获得识别信息，其识别路径上的节点 主LSP，与主LSP关联的记录路由对象。 该方法还包括将识别信息的节点地址与备份LSP的目的地址或存在于备份LSP的子节点的节点标识符（node-ID）中的节点地址进行比较，以标识合并点。
-
公开(公告)号：US20140029610A1
公开(公告)日：2014-01-30
申请号：US13561985
申请日：2012-07-30
IPC分类号： H04L12/56
CPC分类号： H04L45/025 , H04L45/14 , H04L45/22 , H04L45/28
摘要： In one embodiment, a node (e.g., a root-node) of a currently known directed acyclic graph (DAG) topology of a computer network can identify a sub-DAG of one or more nodes that are unreachable. The node can further determine a scope of the unreachable nodes of the sub-DAG and tunnel a redirected message to a reachable node of the DAG topology that is adjacent to at least one of the unreachable nodes of the sub-DAG. The redirected message may cause the reachable node to distribute the redirected message to one or more of the unreachable nodes of the sub-DAG based on the scope.
摘要翻译： 在一个实施例中，计算机网络的当前已知的有向无环图（DAG）拓扑的节点（例如，根节点）可以标识不可达的一个或多个节点的子DAG。 节点可以进一步确定子DAG的不可达节点的范围，并且将重定向消息隧道传送到与子DAG的至少一个不可达节点相邻的DAG拓扑的可到达节点。 重定向消息可以使可达节点基于范围将重定向消息分发到子DAG的一个或多个不可达节点。
-
10.发明授权Method and apparatus for determining a preferred backup tunnel to protect point-to-multipoint label switch paths 有权用于确定优选备份隧道以保护点对多点标签交换路径的方法和装置公开(公告)号：US07675860B2
公开(公告)日：2010-03-09
申请号：US11363840
申请日：2006-02-27
IPC分类号： H04J1/16
摘要： A method, apparatus and computer program product for determining a preferred backup path to protect a point-to-multipoint label switching path is presented. A point-to-multipoint backup path is computed for each node located upstream from a branching node, the backup path originating at the node and including a set of nodes downstream from said branching node. A cost metric associated with each backup path is determined, as is a distance metric associated with each backup path. From the cost and distance metrics associated with each backup path a preferred backup path is selected using a distributed algorithm.
摘要翻译： 提出了一种用于确定保护点对多点标签交换路径的优选备份路径的方法，装置和计算机程序产品。 针对位于分支节点上游的每个节点计算点对多点备份路径，源自节点的备份路径，并且包括从所述分支节点下游的一组节点。 确定与每个备份路径相关联的成本度量，以及与每个备份路径相关联的距离度量。 根据与每个备份路径相关联的成本和距离度量，使用分布式算法选择优选备份路径。
-
-
-
-
-
-
-
-
-
搜索结果
15 条记录 (耗时 0.027 秒)
