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

61. 发明授权

US07551551B2 Fast reroute (FRR) protection at the edge of a RFC 2547 network 有权
标题翻译：在RFC 2547网络边缘的快速重路由（FRR）保护
公开(公告)号：US07551551B2
公开(公告)日：2009-06-23
申请号：US11010225
申请日：2004-12-10
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： 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.
摘要翻译：可以部署在具有耦合到相邻路由域的第一和第二边缘设备的网络边缘的快速重路由（FRR）技术。如果第一边缘设备检测到阻止其与相邻域通信的节点或链路故障，则第一边缘设备将寻址到相邻域的至少一些数据分组路由到第二边缘设备。第二边缘设备接收重新路由的报文，然后将报文转发给邻近的域。值得注意的是，第二边缘设备不允许第二次重新路由所接收的分组，例如在识别出另一个域间节点或链路故障时。因此，在网络的边缘避免了循环，并且与先前的实现相比，分组被更快地和更有效地重新路由到相邻路由域。

62. 发明授权

US08264962B2 System and method for dynamically responding to event-based traffic redirection 有权
标题翻译：用于动态响应基于事件的流量重定向的系统和方法
公开(公告)号：US08264962B2
公开(公告)日：2012-09-11
申请号：US11168694
申请日：2005-06-27
申请人： Jean-Philippe Vasseur , David D. Ward , Stefano B. Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , David D. Ward , Stefano B. Previdi , Clarence Filsfils
IPC分类号： G01R31/08
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带宽适配到任何接收到的重定向业务。

63. 发明授权

US07411963B2 Method for dissemination of non-routing information using the IS-IS protocol 有权
标题翻译：使用IS-IS协议传播非路由信息的方法
公开(公告)号：US07411963B2
公开(公告)日：2008-08-12
申请号：US11040629
申请日：2005-01-19
申请人： David D. Ward , Jean-Philippe Vasseur , Stefano B. Previdi
发明人： David D. Ward , Jean-Philippe Vasseur , Stefano B. Previdi
IPC分类号： H04L12/26 , H04J3/14 , G08C15/00 , G06F11/00
CPC分类号： H04L45/50 , H04L45/02 , H04L45/52
摘要： A method and apparatus for the dissemination of non-routing information to nodes of a network is provided. A new type of IS-IS packet (called a NRI IS-IS packet) is described that exclusively carries non-routing information. When the NRI IS-IS packet is received by a router, the router may send the NRI IS-IS packet to an appropriate component responsible for processing non-routing information, without analyzing, verifying, and validating the information carried in each TLV and sub-TLV of the NRI IS-IS packet. Advantageously, the time it takes for routers of the network to achieve convergence is decreased since a IS-IS packet reader need not analyze, verify, and validate information not related to network topology and IP routing. Therefore, when NRI IS-IS packets are received, there is no impact in the convergence time of nodes in the network.
摘要翻译：提供了一种用于将非路由信息传播到网络节点的方法和装置。描述了一种新型的IS-IS分组（称为NRI IS-IS分组），其独有地携带非路由信息。当路由器接收到NRI IS-IS报文时，路由器可以将NRI IS-IS报文发送给负责处理非路由信息的适当组件，而无需分析，验证和验证每个TLV和Sub -TLV的NRI IS-IS包。有利的是，由于IS-IS分组读取器不需要分析，验证和验证与网络拓扑和IP路由不相关的信息，所以网络路由器实现收敛所需的时间被减少。因此，当收到NRI IS-IS报文时，网络节点的收敛时间不会有任何影响。

64. 发明授权

US08717899B2 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
IPC分类号： H04L12/26 , 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）条件的系统和方法是“超出资源。“根据该技术，实体的OOR条件在广告消息中包含的一个或多个类型长度值（TLV）对象中通告。广告消息被洪泛到数据网络上的节点，以通知他们实体的OOR条件。处理广告消息的头端节点可以使用包含在TLV对象中的信息来确定不包括与OOR条件相关联的实体的新标签交换路径（LSP）的路径。

65. 发明授权

US08320255B2 Inter-domain path computation technique 有权
标题翻译：域间路径计算技术
公开(公告)号：US08320255B2
公开(公告)日：2012-11-27
申请号：US11049587
申请日：2005-02-02
申请人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David D. Ward
发明人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David D. Ward
IPC分类号： G01R31/08
CPC分类号： H04L45/04 , H04J3/14 , H04J3/16 , H04L45/02 , H04L45/42 , H04L45/44 , H04L45/50
摘要： A technique computes 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 novel inter-domain TE-LSP computation technique comprises a computation algorithm executed by the head-end node, which utilizes Path Computation Elements (PCEs) located within the remote domains (i.e., other than the local domain). Specifically, the head-end node requests path segments from a PCE in each of the remote domains, in which the path segments represent paths between all entry border routers to either all exit border routers of the particular remote domain (i.e., through the domain), or to the tail-end node. Upon receiving path segments from each remote domain, the head-end node combines the path segments with local domain information, and performs a forward path computation from the head-end node to the tail-end node to find the best (i.e., “shortest”) path.
摘要翻译：一种技术计算跨越计算机网络的多个域的流量工程（TE）标签交换路径（LSP），从本地域的头端节点到远程域的尾端节点。新颖的域间TE-LSP计算技术包括由前端节点执行的计算算法，其利用位于远程域内的路径计算元素（PCE）（即，除本地域之外）。特别地，前端节点从每个远程域中的PCE请求路径段，其中路径段表示所有入口边界路由器之间到特定远程域的所有出口边界路由器（即，通过域）的路径，，或到尾端节点。在从每个远程域接收到路径段时，前端节点将路径段与本地域信息相结合，并且执行从前端节点到尾端节点的前向路径计算，以找到最佳（即最短）路径。

66. 发明授权

US07983153B2 Fast reroute (FRR) protection at the edge of a RFC 2547 network 有权
标题翻译：在RFC 2547网络边缘的快速重路由（FRR）保护
公开(公告)号：US07983153B2
公开(公告)日：2011-07-19
申请号：US12481411
申请日：2009-06-09
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： In one embodiment, an edge device in a first routing domain is configured to communicate with a second routing domain via a data link. The edge device receives a data packet containing a destination address that is reachable via the second routing domain and an indication that the data packet is a protected packet that was previously rerouted from another edge device in the first routing domain via a Multi-Protocol Label Switching (MPLS) Fast Reroute (FRR) backup path. The edge device determines if communication with the second routing domain is still available via the data link, and if so, removes the indication that the data packet is a protected packet and forwards the data packet to the second routing domain, and, if not, drops the data packet to prevent the data packet from being rerouted a second time in the first routing domain on another MPLS FRR backup path.
摘要翻译：在一个实施例中，第一路由域中的边缘设备被配置为经由数据链路与第二路由域进行通信。边缘设备接收包含经由第二路由域可到达的目的地地址的数据分组，以及指示数据分组是先前通过多协议标签交换在第一路由域中从另一边缘设备重新路由的受保护分组的指示（MPLS）快速重路由（FRR）备份路径。边缘设备确定与第二路由域的通信是否仍然通过数据链路可用，如果是，则删除数据分组是受保护分组的指示，并将数据分组转发到第二路由域，如果不是，删除数据包，以防止数据包在另一个MPLS FRR备份路径上的第一个路由域再次被重新路由。

67. 发明授权

US07961600B2 Loop prevention technique for MPLS using service labels 有权
标题翻译：使用服务标签的MPLS环路防护技术
公开(公告)号：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
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标签堆栈中不包括服务标签的确定，所接收的数据分组被重新路由到计算机网络的第二边缘设备以转发到相邻路由域。

68. 发明申请

US20080123532A1 Dynamic weighted-fair load-balancing 有权
标题翻译：动态加权平衡负载均衡
公开(公告)号：US20080123532A1
公开(公告)日：2008-05-29
申请号：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分类号： 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.
摘要翻译：在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率最佳路径

69. 发明申请

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

70. 发明授权

US09319962B2 Local path repair in a wireless deterministic network 有权
标题翻译：无线确定性网络中的本地路径修复
公开(公告)号：US09319962B2
公开(公告)日：2016-04-19
申请号：US14043974
申请日：2013-10-02
申请人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
发明人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
IPC分类号： H04W40/04 , H04W72/04 , H04W40/34 , H04W40/38 , H04L12/721 , H04L12/707 , H04L12/703
CPC分类号： H04W40/04 , H04L45/12 , H04L45/22 , H04L45/28 , H04W40/34 , H04W40/38 , H04W72/0446 , Y02D70/144 , Y02D70/32
摘要： In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.
摘要翻译：在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式