-
公开(公告)号：US20060013125A1
公开(公告)日：2006-01-19
申请号：US10891704
申请日：2004-07-15
IPC分类号： H04L12/26
摘要： 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没有恢复（例如，主隧道没有被重新建立），则自动地触发网络拓扑变化，导致网络收敛在新的网络拓扑上。 通过触发网络拓扑变化，可以随后确定比与备用隧道相关联的路径更优化的路径来承载流量。
-
2.发明申请Method and apparatus to compute local repair paths taking into account link resources and attributes 有权考虑链路资源和属性来计算局部修复路径的方法和装置公开(公告)号：US20060140111A1
公开(公告)日：2006-06-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.
摘要翻译： 一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。 动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。 在操作中，中间节点监视一组本地链路和/或节点参数。 该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。 广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。 在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。 如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。
-
公开(公告)号：US20060126495A1
公开(公告)日：2006-06-15
申请号：US11001149
申请日：2004-12-01
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , Clarence Filsfils , David Ward , Stefano Previdi
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , Clarence Filsfils , David Ward , Stefano Previdi
IPC分类号： H04J1/16
CPC分类号： H04L45/22 , H04L41/0677 , H04L43/50 , H04L45/02 , H04L45/28
摘要： A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a suspected path identifies forwarding plane problems for effecting changes at the control plane level. The messages include a command requesting interrogation of a further remote node for obtaining information about the path between the node receiving the PVP message and the further remote node. The node receiving the PVP message replies with a command response indicative of the outcome of attempts to reach the further remote node. The series of messages collectively covers a set of important routing points along a path from the originator to the recipient. The aggregate command responses to the series of PVP messages is analyzed to identify not only whether the entire path is operational, but also the location and nature of the problem.
-
4.发明申请System and method for reporting out-of-resources (OOR) conditions in a data network 有权在数据网络中报告资源不足（OOR）条件的系统和方法公开(公告)号：US20060092952A1
公开(公告)日：2006-05-04
申请号：US10964184
申请日：2004-10-13
申请人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
发明人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
IPC分类号： H04L12/56
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）条件的系统和方法是“超出资源 “。 根据该技术，在广告消息中包含的一个或多个类型长度值（TLV）对象中通告实体的OOR条件。 广告消息被洪泛到数据网络上的节点，以通知他们实体的OOR条件。 处理广告消息的头端节点可以使用包含在TLV对象中的信息来确定不包括与OOR条件相关联的实体的新标签交换路径（LSP）的路径。
-
公开(公告)号：US08855014B2
公开(公告)日：2014-10-07
申请号：US13524071
申请日：2012-06-15
申请人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
发明人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
摘要： In one embodiment, a particular device in a computer network maintains a locally owned tunnel-state table, and joins a distributed hash table (DHT) ring. In addition, the locally owned tunnel-state table is shared with other devices of the DHT ring to establish a DHT-owned tunnel-state table. The particular device (and other devices) determines ownership of link-state advertisements (LSAs) for a specific portion of a traffic engineering database (TED) according to the DHT ring. As such, when the particular device (or any device) computes a path for a tunnel using a local TED, the particular device may request permission to use resources along the computed path that were advertised in particular LSAs from owners of those particular LSAs when not owned by the particular device.
摘要翻译： 在一个实施例中，计算机网络中的特定设备维护本地拥有的隧道状态表，并且连接分布式散列表（DHT）环。 此外，本地拥有的隧道状态表与DHT环的其他设备共享，以建立DHT拥有的隧道状态表。 特定设备（和其他设备）根据DHT环确定针对流量工程数据库（TED）的特定部分的链路状态通告（LSA）的所有权。 因此，当特定设备（或任何设备）使用本地TED计算隧道的路径时，特定设备可以请求允许沿着所计算的路径使用资源，这些资源在特定LSA的特定LSA中被发布，来自那些特定LSA的所有者 由特定设备拥有。
-
6.发明申请System and method for dynamically responding to event-based traffic redirection 有权用于动态响应基于事件的流量重定向的系统和方法公开(公告)号：US20060291391A1
公开(公告)日：2006-12-28
申请号：US11168694
申请日：2005-06-27
CPC分类号： H04L45/22 , H04L45/02 , H04L45/28 , H04L47/70 , H04L47/746 , H04L47/762 , H04L47/825 , H04L47/829
摘要： A technique dynamically resizes Traffic Engineering (TE) Label Switched Paths (LSPs) at a head-end node of the TE-LSPs in preparation to receive redirected traffic in response to an event in a computer network. The novel dynamic TE-LSP resizing technique is based on the detection of an event in the network that could cause traffic destined for one or more other (“remote”) head-end nodes of one or more TE-LSPs to be redirected to an event-detecting (“local”) head-end node of one or more TE-LSPs. An example of such a traffic redirection event is failure of a remote head-end node or failure of any of its TE-LSPs. Specifically, the local head-end node maintains TE-LSP steady state sampling and resizing frequencies to adapt the bandwidth of its TE-LSP(s) to gradual changes in the network over time. Upon detection of an event identifying possible traffic redirection, the local head-end node enters a Fast Resize (FR) state, in which the sampling and resizing frequencies are increased to quickly adapt the TE-LSP bandwidth(s) to any received redirected traffic.
摘要翻译： 技术动态地调整TE-LSP的头端节点处的流量工程（TE）标签交换路径（LSP），准备响应于计算机网络中的事件接收重定向的流量。 新型动态TE-LSP调整大小技术基于网络中可能导致一个或多个TE-LSP的一个或多个其他（“远程”）头端节点的流量被重定向到的事件的检测 一个或多个TE-LSP的事件检测（“本地”）头端节点。 这种流量重定向事件的示例是远程头端节点的故障或其任何TE-LSP的故障。 具体来说，本地前端节点维护TE-LSP稳态采样和调整频率，以适应其TE-LSP的带宽随时间逐渐变化的网络。 在检测到识别可能的业务重定向的事件时，本地前端节点进入快速调整大小（FR）状态，其中增加采样和调整大小频率以快速地将TE-LSP带宽适配到任何接收到的重定向业务 。
-
公开(公告)号：US20060193248A1
公开(公告)日：2006-08-31
申请号：US11068081
申请日：2005-02-28
申请人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
发明人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
摘要： 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重新路由的数据包的标识符。 在接收到包含服务标签的数据分组时，不允许备份边缘设备第二次重新路由该分组，例如响应于另一个域间节点或链路故障，从而防止在网络边缘发展的环路 。
-
公开(公告)号：US20060126496A1
公开(公告)日：2006-06-15
申请号：US11010225
申请日：2004-12-10
申请人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04L12/26
摘要： A fast reroute (FRR) technique that may be deployed at the edge of a network having first and second edge devices coupled to a neighboring routing domain. If the first edge device detects a node or link failure that prevents it from communicating with the neighboring domain, the first edge device reroutes at least some data packets addressed to the neighboring domain to the second edge device. The second edge device receives the rerouted packets and then forwards the packets to the neighboring domain. Notably, the second edge device is not permitted to reroute the received packets a second time, e.g., upon identifying another inter-domain node or link failure. As such, loops are avoided at the edge of the network and packets are rerouted to the neighboring routing domain faster and more efficiently than in prior implementations.
-
公开(公告)号：US09300564B2
公开(公告)日：2016-03-29
申请号：US13524057
申请日：2012-06-15
IPC分类号： H04L12/26 , H04L12/24 , H04L12/751 , H04L12/703 , H04L12/717 , H04L12/723
摘要： In one embodiment, a stateful path computation element (PCE) in a computer network determines a need to route at least a threshold number of tunnels, and in response, triggers a routing update from a determined set of routers. Having updated the routing information and available network resources for the set of routers, the stateful PCE may then compute the tunnels based on the update.
摘要翻译： 在一个实施例中，计算机网络中的有状态路径计算元件（PCE）确定需要路由至少一个阈值数量的隧道，并且作为响应，从确定的一组路由器触发路由更新。 为了更新路由器集合的路由信息和可用的网络资源，状态PCE然后可以基于更新来计算隧道。
-
10.发明授权Global state resynchronization for path computation element failure during a reoptimization process 有权重新优化过程中路径计算元素故障的全局状态重新同步公开(公告)号：US09077615B2
公开(公告)日：2015-07-07
申请号：US13524632
申请日：2012-06-15
IPC分类号： H04L1/02 , H04J3/14 , H04L12/24 , H04L12/46 , H04L12/751 , H04L12/707 , H04L12/703 , H04L12/717 , H04L12/723 , H04L12/26
CPC分类号： H04L41/0663 , H04L12/4633 , H04L43/10 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/42 , H04L45/50
摘要： In one embodiment, a router initiates reroutes of one or more tunnels at the router as part of optimization of a plurality of tunnels in a computer network, and stores an original state of the one or more tunnels at the router prior to the optimization. By detecting whether path computation element (PCE) failure occurs prior to completion of the optimization, the router may revert to the original state of the one or more tunnels in response to PCE failure prior to completion of the optimization.
摘要翻译： 在一个实施例中，路由器发起路由器处的一个或多个隧道的路由器作为计算机网络中的多个隧道的优化的一部分，并且在优化之前在路由器处存储一个或多个隧道的原始状态。 通过检测在优化完成之前是否发生路径计算元件（PCE）故障，路由器可以在完成优化之前响应于PCE故障而恢复到一个或多个隧道的原始状态。
-
-
-
-
-
-
-
-
-
搜索结果
91 条记录 (耗时 0.028 秒)
