专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08131873B2 Technique for selecting a path computation element 有权
标题翻译：选择路径计算元素的技术
公开(公告)号：US08131873B2
公开(公告)日：2012-03-06
申请号：US10983280
申请日：2004-11-05
申请人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
IPC分类号： G06F15/173
CPC分类号： H04L45/42 , H04L45/04 , H04L45/12 , H04L45/127 , H04L45/44 , H04L45/58
摘要： 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）来服务路径计算请求。

2. 发明授权

US08068411B2 Method and apparatus to compute local repair paths taking into account link resources and attributes 有权
标题翻译：考虑链路资源和属性来计算局部修复路径的方法和装置
公开(公告)号：US08068411B2
公开(公告)日：2011-11-29
申请号：US11025179
申请日：2004-12-29
申请人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward
发明人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward
IPC分类号： H04J1/16 , H04L1/00
CPC分类号： H04L45/28 , H04J3/14 , H04L45/02
摘要： 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.
摘要翻译：一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。在运行中，中间节点监视一组本地链路和/或节点参数。该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。

3. 发明申请

US20100118732A1 LOOP PREVENTION TECHNIQUE FOR MPLS USING SERVICE LABELS 有权
标题翻译：使用服务标签的MPLS环路预防技术
公开(公告)号：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
IPC分类号： H04L12/26 , H04L12/56
CPC分类号： H04L45/18 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50
摘要： 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标签堆栈中不包括服务标签的确定，所接收的数据分组被重新路由到计算机网络的第二边缘设备以转发到相邻路由域。

4. 发明授权

US07664013B2 Loop prevention technique for MPLS using service labels 有权
标题翻译：使用服务标签的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
CPC分类号： H04L45/18 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50
摘要： 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重新路由的数据包的标识符。在接收到包含服务标签的数据分组时，不允许备份边缘设备第二次重新路由该分组，例如响应于另一个域间节点或链路故障，从而防止在网络边缘发展的环路。

5. 发明申请

US20080320166A1 AUTOMATIC PRIORITIZATION OF BGP NEXT-HOP IN IGP CONVERGENCE 有权
标题翻译： BGP下一个HOP在IGP融合中的自动优化
公开(公告)号：US20080320166A1
公开(公告)日：2008-12-25
申请号：US12204568
申请日：2008-09-04
申请人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： G06F15/16
CPC分类号： H04L45/02 , H04L45/04 , H04L45/14
摘要： In one embodiment, an inter-domain routing protocol stores an inter-domain routing protocol route having an associated next-hop address. A routing table is searched for an for an intra-domain routing protocol route that may be used to reach the next-hop address of the inter-domain routing protocol route. Such route is marked as an important route for convergence. Later, in response to a change in the network requiring a routing table update, the intra-domain routing protocol route marked as an important route for convergence is processed by an intra domain routing protocol before any other intra-domain routing protocol routes are processed that are not marked as important routes for convergence.
摘要翻译：在一个实施例中，域间路由协议存储具有相关联的下一跳地址的域间路由协议路由。搜索路由表寻找可用于到达域间路由协议路由的下一跳地址的域内路由协议路由。这种路线被标记为收敛的重要路线。之后，为了响应需要路由表更新的网络的变化，在处理任何其他域内路由协议路由之前，通过域内路由协议来处理标记为收敛的重要路由的域内路由协议路由，没有被标记为收敛的重要路线。

6. 发明授权

US07460481B2 Inter-domain TE-LSP with IGP extensions 有权
标题翻译：具有IGP扩展的域间TE-LSP
公开(公告)号：US07460481B2
公开(公告)日：2008-12-02
申请号：US11001459
申请日：2004-12-01
申请人： Jean-Philippe Vasseur , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Stefano B. Previdi
IPC分类号： H04L12/26
CPC分类号： H04L47/825 , H04L45/02 , H04L45/04 , H04L45/28 , H04L45/502 , H04L47/70 , H04L47/724 , H04L47/785
摘要： A technique propagates 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 that is different (remote) from the domain of the head-end node. The inter-domain information propagation technique employs an Interior Gateway Protocol (IGP) to transmit the remote reachability information from a target node residing in the same domain as the tail-end node to the head-end node. 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）来将远程可达性信息从驻留在与尾端节点相同的域中的目标节点传送到头端节点。前端节点使用远程信息来计算从尾端节点可到达其路由表的路由，即地址前缀和相关联的属性。

7. 发明授权

US07457248B1 Graceful shutdown of network resources in data networks 有权
标题翻译：数据网络中网络资源的正常关闭
公开(公告)号：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. 发明授权

US07436838B2 Automatic prioritization of BGP next-hop in IGP 有权
标题翻译：在IGP中自动优先化BGP下一跳
公开(公告)号：US07436838B2
公开(公告)日：2008-10-14
申请号：US11025251
申请日：2004-12-29
申请人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04L1/00 , H04L12/26
CPC分类号： H04L45/02 , H04L45/04 , H04L45/14
摘要： 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, as a next-hop address, since external connectivity relies on such a route. A routing information base process executing on the node stores the advertised route and, notably, 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.
摘要翻译：一种技术配置中间网络节点，以自动确定路由协议发布的路由是否对计算机网络中的快速收敛很重要。如本文所使用的，快速收敛所需的重要路线是路由协议（例如外部网关路由协议）作为下一跳地址通告的路由，因为外部连接依赖于这样的路由。在节点上执行的路由信息库过程存储所通告的路由，并且特别地与在节点上执行的内部网关路由协议（IGP）进程进行交互，以将该路由识别为重要路由。识别重要的路由又反过来允许IGP以高优先级的方式处理路由，从而促进快速收敛。

9. 发明授权

US08374092B2 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）。

10. 发明授权

US08094555B2 Dynamic weighted-fair load-balancing 有权
标题翻译：动态加权平衡负载均衡
公开(公告)号：US08094555B2
公开(公告)日：2012-01-10
申请号：US11604461
申请日：2006-11-27
申请人： David D. Ward , Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： David D. Ward , Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
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.
摘要翻译：在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率最佳路径

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式