-
公开(公告)号：US07961600B2
公开(公告)日：2011-06-14
申请号：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
IPC分类号： H04L12/26
摘要： 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标签堆栈中不包括服务标签的确定，所接收的数据分组被重新路由到计算机网络的第二边缘设备以转发到相邻路由域。
-
22.发明授权Dynamic path computation element load balancing with backup path computation elements 有权动态路径计算元素与备份路径计算元素的负载平衡公开(公告)号：US07668971B2
公开(公告)日：2010-02-23
申请号：US12013096
申请日：2008-01-11
IPC分类号： G06F15/173
CPC分类号： H04L47/10 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/42 , H04L47/125 , H04L63/0272 , H04L2212/00
摘要： In one embodiment, a first path computation element (PCE) operates between first and second network domains, and is adapted to service requests from path computation clients (PCCs) in at least the first domain. In response to a backup event (e.g., failure of a second PCE), a backup PCE in the second domain may be informed of path computation information for the first domain used by the first PCE, and tunnels may be bi-directionally established between the first PCE and the backup PCE. Once the tunnels are established, the backup PCE may be advertised into the first domain, and the backup PCE may operate to load balance service requests for the first domain through the bi-directionally established tunnels.
摘要翻译： 在一个实施例中，第一路径计算元件（PCE）在第一和第二网络域之间操作，并且适于在至少第一域中对来自路径计算客户端（PCC）的请求进行服务。 响应于备份事件（例如，第二PCE的故障），可以向第二域中的备用PCE通知第一PCE使用的第一域的路径计算信息，并且隧道可以在第二域之间双向建立 第一个PCE和备份PCE。 一旦建立了隧道，备用PCE可以被通告到第一域，并且备份PCE可以通过双向建立的隧道来操作以对第一域的业务请求进行负载平衡。
-
公开(公告)号：US07646719B2
公开(公告)日：2010-01-12
申请号：US11001784
申请日：2004-12-02
IPC分类号： G01R31/08
CPC分类号： H04L47/10 , H04L45/04 , H04L45/24 , H04L45/50 , H04L47/125
摘要： A technique selects a traffic engineering (TE) label switched path (LSP) from among a plurality of TE-LSPs, each of which 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, in order to reach one or more address prefixes within the remote domain. The inter-domain TE-LSP selection technique comprises a selection algorithm executed by the head-end node and based on predetermined TE-LSP attributes (e.g., bandwidth, cost, etc.) and/or address prefix reachability attributes (e.g., cost from a tail-end node to the prefix) to select an appropriate inter-domain TE-LSP for the reachable address prefix. The selection algorithm is embodied in one of two modes: (i) a hierarchical selection mode, or (ii) a weighted selection mode. In addition, the technique comprises a load balancing aspect that cooperates with the selection algorithm to enable the head-end node to balance traffic loads among the multiple TE-LSPs based on the results of the selection algorithm.
摘要翻译： 一种技术从多个TE-LSP中选择流量工程（TE）标签交换路径（LSP），每个TE-LSP跨越从本地域的头端节点到终端节点的计算机网络的多个域 的远程域，以便达到远程域内的一个或多个地址前缀。 域间TE-LSP选择技术包括由前端节点执行并基于预定的TE-LSP属性（例如，带宽，成本等）和/或地址前缀可达性属性（例如，来自 到前缀的尾端节点）为可达地址前缀选择适当的域间TE-LSP。 选择算法以两种模式之一体现：（i）分层选择模式，或（ii）加权选择模式。 此外，该技术包括与选择算法配合的负载平衡方面，以使头端节点能够基于选择算法的结果来平衡多个TE-LSP之间的业务负载。
-
24.发明申请RECEIVER-BASED CONSTRUCTION OF POINT-TO-MULTIPOINT TREES USING PATH COMPUTATION ELEMENTS IN A COMPUTER NETWORK 有权使用计算机网络中的路径计算元素的基于接收器的点到多点路径的构造公开(公告)号：US20090232031A1
公开(公告)日：2009-09-17
申请号：US12045749
申请日：2008-03-11
IPC分类号： H04L12/28
摘要： In one embodiment, a trigger to add a leaf node to a multicast group of a computer network is detected, and the leaf node may determine a root node of the multicast group to request a path between a tunnel tree and the leaf node of the multicast group. In response to the multicast group having an existing tree, a reply is received from the root node with a computed path to add the leaf node to the tree at a selected node of the tree. The leaf node may then be added to the multicast group tunnel tree over the computed path at the selected node.
摘要翻译： 在一个实施例中，检测到向计算机网络的多播组添加叶节点的触发器，并且叶节点可以确定多播组的根节点以请求隧道树和多播的叶节点之间的路径 组。 响应于具有现有树的多播组，使用计算的路径从根节点接收回复，以将叶节点添加到树的所选节点处的树。 然后可以通过所选节点处的计算路径将叶节点添加到多播组隧道树中。
-
公开(公告)号：US07554996B2
公开(公告)日：2009-06-30
申请号：US11226889
申请日：2005-09-14
IPC分类号： H04L12/28
摘要： A technique controls distribution of reachability information for a tail-end node of a traffic engineering (TE) label switched path (LSP) to a head-end node of the TE-LSP in a computer network. The TE-LSP preferably spans multiple domains of the network such that the tail-end node resides in a domain (“tail-end domain”) that is different (remote) from the domain of the head-end node (“head-end domain”). According to the inter-domain information distribution technique, the head-end node requests the remote reachability information from the tail-end node, which may employ an Interior Gateway Protocol (IGP) to transmit the information to a border router of the tail-end domain. The tail-end domain border router then shares this information with at least a head-end domain border router. The head-end node thereafter requests that the head-end domain border router release the reachability information into the head-end domain. The head-end node uses the remote information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.
摘要翻译： 一种技术控制流量工程（TE）标签交换路径（LSP）的尾端节点到计算机网络中TE-LSP的前端节点的可达性信息的分发。 TE-LSP优选地跨越网络的多个域，使得尾端节点驻留在与头端节点（“头端”）不同（远程）的域（“尾端域”）中 域”）。 根据域间信息分配技术，前端节点从尾端节点请求远端可达性信息，后端节点可采用内部网关协议（IGP）将信息发送到尾端边界路由器 域。 然后，尾端域边界路由器与至少一个前端域边界路由器共享该信息。 前端节点此后请求前端域边界路由器将可达性信息发布到前端域。 前端节点使用远程信息来计算从尾端节点可到达其路由表的路由，即地址前缀和相关联的属性。
-
公开(公告)号：US20080123532A1
公开(公告)日：2008-05-29
申请号：US11604461
申请日：2006-11-27
IPC分类号： G01R31/08
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.
摘要翻译： 在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。 节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率 最佳路径
-
27.发明申请Technique for protecting against failure of a network element using Multi-Topology Repair Routing (MTRR) 有权使用多拓扑修复路由（MTRR）防止网元故障的技术公开(公告)号：US20080049622A1
公开(公告)日：2008-02-28
申请号：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分类号： H04L12/26
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）。
-
28.发明授权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）的路径。
-
公开(公告)号：US08467394B2
公开(公告)日：2013-06-18
申请号：US13149535
申请日：2011-05-31
CPC分类号： H04L45/04 , H04L45/02 , H04L45/026 , H04L45/28 , H04L45/52
摘要： In one embodiment, a router in a routing domain exchanges routing information with one or more other routers located external to the routing domain using an exterior gateway protocol (EGP). The router exchanges routing information with one or more other routers located internal to the routing domain using an interior gateway protocol (IGP). The router detects a route to be advertised by the IGP is also used as a next-hop attribute of a route advertised by the EGP. In response, the router tags the route advertised by the IGP as an important route for convergence to indicate that the tagged route is to be processed before other routes that have not been tagged during convergence processing. The tagged route is advertised within the routing domain using the IGP.
摘要翻译： 在一个实施例中，路由域中的路由器使用外部网关协议（EGP）与位于路由域外部的一个或多个其他路由器交换路由信息。 路由器使用内部网关协议（IGP）与位于路由域内部的一个或多个其他路由器交换路由信息。 路由器检测到IGP发布的路由也被用作EGP发布的路由的下一跳属性。 作为响应，路由器将IGP发布的路由标记为收敛的重要路由，以指示在收敛处理期间未标记的其他路由之前要标记的路由将被处理。 使用IGP在路由域内通告标记的路由。
-
公开(公告)号：US07978708B2
公开(公告)日：2011-07-12
申请号：US11025203
申请日：2004-12-29
CPC分类号： H04L45/04 , H04L45/02 , H04L45/026 , H04L45/28 , H04L45/52
摘要： A technique configures an intermediate network node to automatically determine whether a route advertised by a routing protocol is important for fast convergence in a computer network. As used herein, an important route needed for fast convergence is a route advertised by the routing protocol, such as an exterior gateway routing protocol (EGP) process executing on the node, as a next-hop address, since external connectivity relies on such a route. Notably, the EGP process interacts with an interior gateway routing protocol (IGP) process executing on the node to identify the route as an important route. Identification of an important route, in turn, allows IGP to process the route in a high priority fashion, thereby facilitating fast convergence.
摘要翻译： 一种技术配置中间网络节点，以自动确定路由协议发布的路由是否对计算机网络中的快速收敛很重要。 如本文所使用的，快速收敛所需的重要路由是路由协议所通告的路由，例如在节点上执行的外部网关路由协议（EGP）过程作为下一跳地址，因为外部连接依赖于 路线。 值得注意的是，EGP进程与在节点上执行的内部网关路由协议（IGP）进程交互，以将路由标识为重要路由。 识别重要的路由又反过来允许IGP以高优先级的方式处理路由，从而促进快速收敛。
-
-
-
-
-
-
-
-
-
搜索结果
63 条记录 (耗时 0.023 秒)
