-
1.发明授权System and method for reporting out-of-resources (OOR) conditions in a data network 有权在数据网络中报告资源不足（OOR）条件的系统和方法公开(公告)号：US08717899B2
公开(公告)日：2014-05-06
申请号：US10964184
申请日：2004-10-13
申请人： Sami Boutros , Muthurajah Sivabalan , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad A. Rahman
发明人： Sami Boutros , Muthurajah Sivabalan , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad A. Rahman
CPC分类号： H04L47/125 , H04L41/06 , H04L45/00 , H04L45/50 , H04L47/2408 , H04L47/745
摘要： A system and method for advertising out-of-resources (OOR) conditions for entities, such as nodes, line cards and data links, in a manner that does not involve using a maximum cost to indicate the entity is “out-of-resources.” According to the technique, an OOR condition for an entity is advertised in one or more type-length-value (TLV) objects contained in an advertisement message. The advertisement message is flooded to nodes on a data network to inform them of the entity's OOR condition. Head-end nodes that process the advertisement message may use information contained in the TLV object to determine a path for a new label switched path (LSP) that does not include the entity associated with the OOR condition.
摘要翻译： 用于以不涉及使用最大成本来指示实体的方式向诸如节点，线路卡和数据链路的实体（例如节点，线路卡和数据链路）广告外部资源（OOR）条件的系统和方法是“超出资源 。“根据该技术，实体的OOR条件在广告消息中包含的一个或多个类型长度值（TLV）对象中通告。 广告消息被洪泛到数据网络上的节点，以通知他们实体的OOR条件。 处理广告消息的头端节点可以使用包含在TLV对象中的信息来确定不包括与OOR条件相关联的实体的新标签交换路径（LSP）的路径。
-
公开(公告)号：US08131873B2
公开(公告)日：2012-03-06
申请号：US10983280
申请日：2004-11-05
IPC分类号： G06F15/173
摘要： A technique efficiently selects a Path Computation Element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, using (i) a low-pass filter algorithm to compute such resources, and (ii) threshold determinations to control distribution of those advertisements. To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to a Path Computation Client (PCC) by way of the controlled advertisements. In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
摘要翻译： 一种技术有效地选择路径计算元素（PCE）来计算计算机网络的节点之间的路径。 PCE选择技术说明性地基于PCE可用路径计算资源的动态广告，使用（i）低通滤波器算法来计算这样的资源，以及（ii）阈值确定以控制这些广告的分布。 为此，新技术使得一个或多个PCE能够通过受控广告动态地向路径计算客户端（PCC）发送（通告）它们的可用路径计算资源。 此外，该技术使得PCC能够基于这些可用资源有效地选择PCE（或一组PCE）来服务路径计算请求。
-
公开(公告)号：US07684351B2
公开(公告)日：2010-03-23
申请号：US11052280
申请日：2005-02-07
IPC分类号： H04L12/28
摘要： A technique triggers optimization of a traffic engineering (TE) label switched path (LSP) that spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain. The technique is based on the detection of an event in the remote domain (“event domain”) that could create a more optimal TE-LSP, such as, e.g., restoration of a network element or increased available bandwidth. Specifically, a path computation element (PCE) in the event domain learns of the event and notifies other PCEs of the event through an event notification. These PCEs then flood an event notification to label switched routers (LSRs) in their respective domain. Upon receiving the notification, if an LSR has one or more TE-LSPs (or pending TE-LSPs), it responds to the PCE with an optimization request for the TE-LSPs. The PCE determines whether a particular TE-LSP may benefit from optimization based on the event domain (i.e., whether the TE-LSP uses the event domain), and processes the request accordingly.
摘要翻译： 一种技术触发跨越计算机网络的多个域从本地域的头端节点到远程域的尾端节点的流量工程（TE）标签交换路径（LSP）的优化。 该技术基于对远程域（“事件域”）中的事件的检测，其可以创建更优化的TE-LSP，例如网络元件的恢复或增加的可用带宽。 具体地，事件域中的路径计算元素（PCE）学习事件并通过事件通知通知其他PCE事件。 然后，这些PCE将事件通知泛滥到其各自域中的标签交换路由器（LSR）。 在收到通知后，如果LSR有一个或多个TE-LSP（或待处理的TE-LSP），则对该TEE的优先请求响应PCE。 PCE确定特定TE-LSP是否可以从基于事件域的优化（即，TE-LSP是否使用事件域）获益，并且相应地处理该请求。
-
4.发明授权Method and apparatus to compute local repair paths taking into account link resources and attributes 有权考虑链路资源和属性来计算局部修复路径的方法和装置公开(公告)号：US08068411B2
公开(公告)日：2011-11-29
申请号：US11025179
申请日：2004-12-29
摘要： A technique for calculating local repair paths through a computer network using one or more dynamically measured parameters in place of, or in addition to, statically assigned cost metrics. The dynamically measured parameters include various statistical measures of resources and attributes associated with data links and/or network nodes in the computer network. In operation, an intermediate node monitors a set of local link and/or node parameters. The node may generate an advertisement in response to at least one of its monitored parameters crossing a predetermined threshold value or changing value by a predetermined percentage or amount. The advertisement is “flooded” so as to advertise the dynamically measured parameter value to other neighboring intermediate nodes. After receiving the advertisement, each node may recalculate one or more local repair paths based on the advertised parameter value. The node may utilize a recalculated repair path if it provides an appreciably lower-cost path, e.g., by a predetermined percentage, as compared with the currently deployed repair path.
摘要翻译： 一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。 动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。 在运行中，中间节点监视一组本地链路和/或节点参数。 该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。 广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。 在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。 如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。
-
公开(公告)号：US20100118732A1
公开(公告)日：2010-05-13
申请号：US12694038
申请日：2010-01-26
申请人： Clarence Filsfils , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
发明人： Clarence Filsfils , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
摘要： In one embodiment, a loss of communication is detected between a first edge device of a computer network and a neighboring routing domain. A data packet is received at the first edge device, where the received data packet contains a destination address that is reachable via the neighboring routing domain. A determination is made whether a service label is located in a Multi-Protocol Label Switching (MPLS) label stack included in the received data packet. A service label in the MPLS label stack indicates that the received data packet was previously rerouted in accordance with fast reroute (FRR) operations. In response to a determination that the received data packet does not include a service label in the MPLS label stack, the received data packet is rerouted to a second edge device of the computer network for forwarding to the neighboring routing domain.
摘要翻译： 在一个实施例中，在计算机网络的第一边缘设备和相邻路由域之间检测到通信丢失。 在第一边缘设备处接收数据分组，其中所接收的数据分组包含经由相邻路由域可到达的目的地地址。 确定服务标签是否位于包含在所接收的数据分组中的多协议标签交换（MPLS）标签栈中。 MPLS标签堆栈中的服务标签表示接收到的数据包是根据快速重路由（FRR）操作先前重新路由的。 响应于接收到的数据分组在MPLS标签堆栈中不包括服务标签的确定，所接收的数据分组被重新路由到计算机网络的第二边缘设备以转发到相邻路由域。
-
公开(公告)号：US07664013B2
公开(公告)日：2010-02-16
申请号：US11068081
申请日：2005-02-28
申请人： Clarence Filsfils , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
发明人： Clarence Filsfils , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
IPC分类号： H04L12/26
摘要： A local fast reroute (FRR) technique is implemented at the edge of a computer network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. The backup edge device identifies protected data packets as those which contain a predetermined “service” label in their MPLS label stacks. In other words, the service label is used as an identifier for packets that have been FRR rerouted. Upon receiving a data packet containing a service label, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.
摘要翻译： 本地快速重路由（FRR）技术在计算机网络的边缘实现。 根据该技术，如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障，则边缘设备将至少一些寻址到该域的数据分组重新路由到备用边缘设备， 将数据包转发到相邻域。 重新路由的数据包在被转发到备份边缘设备之前被指定为“保护”（即重新路由）数据分组。 备份边缘设备将受保护的数据包标识为在其MPLS标签堆栈中包含预定“服务”标签的数据包。 换句话说，服务标签被用作已被FRR重新路由的数据包的标识符。 在接收到包含服务标签的数据分组时，不允许备份边缘设备第二次重新路由该分组，例如响应于另一个域间节点或链路故障，从而防止在网络边缘发展的环路 。
-
公开(公告)号：US07457248B1
公开(公告)日：2008-11-25
申请号：US10775855
申请日：2004-02-10
申请人： Zafar Ali , Anca Zamfir , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Peter Psenak
发明人： Zafar Ali , Anca Zamfir , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Peter Psenak
IPC分类号： G01R31/08
CPC分类号： H04L43/0811 , H04L41/0681 , H04W48/08
摘要： A technique gracefully shuts down network resources, such as nodes, interfaces and protocols, in a data network in a manner that minimizes network disruption. The technique may be used with both connectionless and connection-oriented networking systems. A node gracefully shuts down a network resource associated with the node by i) notifying other nodes in the network that the resource is being gracefully shutdown, ii) waiting for a condition to occur, and iii) when the condition occurs, shutting down the resource. The condition may include the expiration of a predetermined amount of time and/or monitoring the resource to determine if the resource has reached a certain level of activity. In response to receiving a notification that a resource is being gracefully shutdown, a node takes action to reroute traffic around the resource. If no alternative route is available, the node may continue to route traffic to the resource until it is shut down.
摘要翻译： 一种技术以最小化网络中断的方式，在数据网络中正常地关闭网络资源，如节点，接口和协议。 该技术可以与无连接和面向连接的网络系统一起使用。 一个节点通过i）通知网络中的其他节点资源被正常地关闭，从而正常地关闭与该节点相关联的网络资源，ii）等待状况发生，以及iii）当该情况发生时，关闭该资源 。 条件可以包括预定时间量的到期和/或监视资源以确定资源是否已经达到一定的活动水平。 响应收到资源正常关闭的通知，节点将采取行动重新路由资源周围的流量。 如果没有替代路由可用，节点可以继续将流量路由到资源，直到其被关闭。
-
8.发明授权Technique for protecting against failure of a network element using multi-topology repair routing (MTRR) 有权使用多拓扑修复路由（MTRR）防止网元故障的技术公开(公告)号：US08374092B2
公开(公告)日：2013-02-12
申请号：US11511128
申请日：2006-08-28
申请人： Stefano B. Previdi , David D. Ward , Jean-Philippe Vasseur , Ian Michael Charles Shand , Stewart Bryant
发明人： Stefano B. Previdi , David D. Ward , Jean-Philippe Vasseur , Ian Michael Charles Shand , Stewart Bryant
IPC分类号： G01R31/08
CPC分类号： H04L41/0668 , H04L41/5003 , H04L43/00 , H04L43/0882 , H04L43/16 , H04L45/02 , H04L45/12 , H04L45/22 , H04L45/28
摘要： A technique protects against failure of a network element using Multi-Topology Repair Routing (MTRR) in a computer network. According to the novel technique, a protecting node (e.g., a router) maintains Multi-Topology Routing (MTR) databases for a first topology and at least a second topology. The protecting node determines whether any acceptable repair paths are available in the first topology for a protected network element (e.g., node, link, etc.) of the first topology. If not, the protecting node may establish a repair path (e.g., for Fast ReRoute, FRR) in the second topology for the protected network element.
摘要翻译： 一种技术可以防止网络元件在计算机网络中使用多拓扑修复路由（MTRR）的故障。 根据新颖技术，保护节点（例如，路由器）维护用于第一拓扑和至少第二拓扑的多拓扑路由（MTR）数据库。 保护节点确定第一拓扑中的受保护网络元件（例如，节点，链路等）的第一拓扑中是否有可接受的修复路径可用。 如果不是，保护节点可以在受保护网络元件的第二拓扑中建立修复路径（例如，用于Fast ReRoute，FRR）。
-
公开(公告)号：US08094555B2
公开(公告)日：2012-01-10
申请号：US11604461
申请日：2006-11-27
IPC分类号： H04J1/16
CPC分类号： H04L47/10 , H04L45/125 , H04L47/125
摘要： In one embodiment, a node identifies a plurality of equal cost best paths to a destination, the best paths having one or more associated links. The node receives dynamic link utilization information for the associated links, and determines an amount of traffic to the destination to forward over each of the equal cost best paths, the amount being dynamically dependent upon the dynamic link utilization of the associated links for each equal cost best path.
摘要翻译： 在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。 节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率 最佳路径
-
公开(公告)号：US07675848B2
公开(公告)日：2010-03-09
申请号：US10891704
申请日：2004-07-15
IPC分类号： G01R31/08
摘要： A technique treats a protected forwarding adjacency (FA) as a dynamic entity in that it allows a backup tunnel associated with the FA to carry traffic for the FA, when it's primary tunnel has failed, up to a predetermined amount of time. If after the predetermined amount of time has elapsed and the FA has not recovered (e.g., the primary tunnel has not been reestablished), a network topology change is automatically triggered causing the network to converge on a new network topology. By triggering the network topology change, a path that is more optimal than the path associated with the backup tunnel may be subsequently determined to carry the traffic.
摘要翻译： 一种技术将受保护的转发邻接（FA）视为动态实体，因为当主隧道发生故障时，它允许与FA相关联的备用隧道携带FA的流量，直到预定的时间量。 如果经过了预定的时间量并且FA没有恢复（例如，主隧道没有被重新建立），则自动地触发网络拓扑变化，导致网络收敛在新的网络拓扑上。 通过触发网络拓扑变化，可以随后确定比与备用隧道相关联的路径更优化的路径来承载流量。
-
-
-
-
-
-
-
-
-
搜索结果
63 条记录 (耗时 0.039 秒)
