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

1. 发明授权

US08717936B1 Optimal automated exploration of hierarchical multiprotocol label switching label switch paths 有权
标题翻译：分层多协议标签交换标签交换路径的最佳自动化探索
公开(公告)号：US08717936B1
公开(公告)日：2014-05-06
申请号：US13358290
申请日：2012-01-25
申请人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
发明人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
IPC分类号： H04L12/28
CPC分类号： H04L45/50 , H04L45/24
摘要： Optimal automated exploration of hierarchical Multiprotocol Label Switching Label Switch Paths (MPLS LSPs) is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received.
摘要翻译：披露了分层多协议标签交换标签交换路径（MPLS LSP）的最佳自动化探索。从初始路由器发送路径验证消息（PVM）。 PVM标签堆栈中的每个标签对应于层次结构层，并与生存时间（TTL）字段相关联。当前层的标签的TTL字段设置为使PVM从初始路由器传播一跳。作为响应，接收到指示PVM到达其目的地的应答消息。

2. 发明授权

US08116227B1 Optimal automated exploration of hierarchical multiprotocol label switching label switch paths 有权
标题翻译：分层多协议标签交换标签交换路径的最佳自动化探索
公开(公告)号：US08116227B1
公开(公告)日：2012-02-14
申请号：US11642473
申请日：2006-12-20
申请人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
发明人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/50 , H04L45/24
摘要： Optimal automated exploration of hierarchical MPLS LSPs is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received. These steps are then repeated. For each successive PVM transmitted, the TTL field associated with a label corresponding to the current hierarchy layer is incremented. For any reply message including information describing a non-current layer, modify the next PVM's label stack and increment the TTL field of the label for the described different layer; any other TTL fields are unchanged. If any received reply message indicates a destination router was reached, the process terminates.
摘要翻译：公开了分层MPLS LSP的最佳自动化探索。从初始路由器发送路径验证消息（PVM）。 PVM标签堆栈中的每个标签对应于层次结构层，并与生存时间（TTL）字段相关联。当前层的标签的TTL字段设置为使PVM从初始路由器传播一跳。作为响应，接收到指示PVM到达其目的地的应答消息。然后重复这些步骤。对于发送的每个连续的PVM，与当前层级层相对应的标签相关联的TTL字段递增。对于包含描述非当前层的信息的任何回复消息，修改下一个PVM的标签栈，并增加描述的不同层的标签的TTL字段; 任何其他TTL字段都不变。如果任何接收到的回复消息指示到达目的地路由器，则该过程终止。

3. 发明授权

US08531976B2 Locating tunnel failure based on next-next hop connectivity in a computer network 有权
标题翻译：基于计算机网络中的下一跳连接定位隧道故障
公开(公告)号：US08531976B2
公开(公告)日：2013-09-10
申请号：US12044620
申请日：2008-03-07
申请人： Jean-Philippe Vasseur , Danny Prairie
发明人： Jean-Philippe Vasseur , Danny Prairie
IPC分类号： H04J1/16
CPC分类号： H04L41/0677 , H04L43/0811
摘要： In one embodiment, a trigger is signaled to protect a tunnel from a head-end node to one or more tail-end nodes in a computer network via one or more intermediate nodes along the tunnel. One or more receiving nodes along the tunnel receive the trigger, and in response, establish a tunnel connectivity verification session from the receiving node to a corresponding downstream next-next-hop (NNHOP) node along the tunnel. Illustratively, the head-end node may thus recompute a new tunnel path excluding a path segment corresponding to a particular failed tunnel connectivity verification session.
摘要翻译：在一个实施例中，通过沿着隧道的一个或多个中间节点，用信号通知触发器以保护隧道从计算机网络中的头端节点到一个或多个尾端节点。沿着隧道的一个或多个接收节点接收触发，并且作为响应，建立从接收节点到沿着隧道的对应的下游下一跳（NNHOP）节点的隧道连接性验证会话。说明性地，头端节点因此可以重新计算除了对应于特定故障隧道连通性验证会话的路径段的新隧道路径。

4. 发明申请

US20090225652A1 LOCATING TUNNEL FAILURE BASED ON NEXT-NEXT HOP CONNECTIVITY IN A COMPUTER NETWORK 有权
标题翻译：基于计算机网络中下一个下一个HOP连接的定位隧道故障
公开(公告)号：US20090225652A1
公开(公告)日：2009-09-10
申请号：US12044620
申请日：2008-03-07
申请人： Jean-Philippe Vasseur , Danny Prairie
发明人： Jean-Philippe Vasseur , Danny Prairie
IPC分类号： G01R31/08
CPC分类号： H04L41/0677 , H04L43/0811
摘要： In one embodiment, a trigger is signaled to protect a tunnel from a head-end node to one or more tail-end nodes in a computer network via one or more intermediate nodes along the tunnel. One or more receiving nodes along the tunnel receive the trigger, and in response, establish a tunnel connectivity verification session from the receiving node to a corresponding downstream next-next-hop (NNHOP) node along the tunnel. Illustratively, the head-end node may thus recompute a new tunnel path excluding a path segment corresponding to a particular failed tunnel connectivity verification session.
摘要翻译：在一个实施例中，通过沿着隧道的一个或多个中间节点，用信号通知触发器以保护隧道从计算机网络中的头端节点到一个或多个尾端节点。沿着隧道的一个或多个接收节点接收触发，并且作为响应，建立从接收节点到沿着隧道的对应的下游下一跳（NNHOP）节点的隧道连接性验证会话。说明性地，头端节点因此可以重新计算除了对应于特定故障隧道连通性验证会话的路径段的新隧道路径。

5. 发明授权

US07583593B2 System and methods for detecting network failure 有权
标题翻译：检测网络故障的系统和方法
公开(公告)号：US07583593B2
公开(公告)日：2009-09-01
申请号：US11001149
申请日：2004-12-01
申请人： James N. Guichard , Jean-Philippe Vasseur , Thomas D. Nadeau , Clarence A. M. Filsfils , David D. Ward , Stefano Previdi
发明人： James N. Guichard , Jean-Philippe Vasseur , Thomas D. Nadeau , Clarence A. M. Filsfils , David D. Ward , Stefano Previdi
IPC分类号： G01R31/08 , H04L12/26
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.
摘要翻译：列出沿着可疑路径发送到一组节点或路由器的一系列消息的路径验证协议（PVP）识别用于在控制平面级别实现改变的转发平面问题。消息包括请求询问另一个远程节点以获取关于接收PVP消息的节点与另外的远程节点之间的路径的信息的命令。接收PVP消息的节点用指示响应到达远程节点的结果的命令响应来回复。一系列消息共同地涵盖沿着始发者到接收者的路径的一组重要的路由点。对一系列PVP消息的聚合命令响应进行分析，不仅可以识别整个路径是否可操作，还可以确定问题的位置和性质。

6. 发明授权

US09197508B2 Time-based scheduling for tunnels computed by a stateful path computation element 有权
标题翻译：由状态路径计算元素计算的隧道的基于时间的调度
公开(公告)号：US09197508B2
公开(公告)日：2015-11-24
申请号：US13524751
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
IPC分类号： H04L12/24 , H04L12/26 , H04L12/911
CPC分类号： H04L41/0896 , H04L41/147 , H04L47/823 , H04L47/825 , H04L47/826
摘要： In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.
摘要翻译：在一个实施例中，计算机网络中的路径计算元件（PCE）接收一个或多个路径计算请求（PCReq），并记录每个PCReq的时间和相应的请求带宽。基于该信息，PCE可以确定计算机网络的流量简档，并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库（TED）。因此，在特定时间之前，PCE可以在特定时间内确定隧道在业务简档内的布置。

7. 发明申请

US20070208871A1 Technique for dynamically restoring original TE-LSP attributes for interdomain TE-LSPs 有权
标题翻译：用于动态恢复域间TE-LSP的原始TE-LSP属性的技术
公开(公告)号：US20070208871A1
公开(公告)日：2007-09-06
申请号：US11368160
申请日：2006-03-03
申请人： Jean-Philippe Vasseur , Carol Iturralde , George Swallow
发明人： Jean-Philippe Vasseur , Carol Iturralde , George Swallow
IPC分类号： G06F15/16
CPC分类号： H04L45/50 , H04L45/04
摘要： A technique dynamically restores original attributes of a Traffic Engineering La-bel Switched Path (TE-LSP) that are provided in a source domain for a destination domain when traversing one or more intermediate domains that may translate the TE-LSP attributes in a computer network. According to the novel technique, a head-end node requests an interdomain TE-LSP having one or more original TE-LSP attributes (e.g., priority, bandwidth, etc.) using a signaling exchange. The head-end node may also request restoration of the original TE-LSP attributes upon entrance into the destination domain. Intermediate domains (e.g., border routers of the domains) receiving the request may translate the original TE-LSP attributes into corresponding intermediate domain TE-LSP attributes. When the request reaches the destination domain, the intermediate domain TE-LSP attributes of the requested TE-LSP are restored into the original TE-LSP attributes.
摘要翻译：一种技术动态地恢复在遍历可能转换计算机网络中的TE-LSP属性的一个或多个中间域时为目的地域提供的源域中提供的流量工程La-bel交换路径（TE-LSP）的原始属性。根据该新技术，前端节点使用信令交换请求具有一个或多个原始TE-LSP属性（例如，优先级，带宽等）的域间TE-LSP。前端节点还可以在进入目的地域时请求恢复原始TE-LSP属性。接收请求的中间域（例如，域的边界路由器）可以将原始TE-LSP属性转换为相应的中间域TE-LSP属性。当请求到达目的域时，请求的TE-LSP的中间域TE-LSP属性恢复为原始TE-LSP属性。

8. 发明授权

US09077615B2 Global state resynchronization for path computation element failure during a reoptimization process 有权
标题翻译：重新优化过程中路径计算元素故障的全局状态重新同步
公开(公告)号：US09077615B2
公开(公告)日：2015-07-07
申请号：US13524632
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , David Ward , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , David Ward , George Swallow
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故障而恢复到一个或多个隧道的原始状态。

9. 发明授权

US08966113B2 Technique for dynamically restoring original TE-LSP attributes for interdomain TE-LSPs 有权
标题翻译：用于动态恢复域间TE-LSP的原始TE-LSP属性的技术
公开(公告)号：US08966113B2
公开(公告)日：2015-02-24
申请号：US11368160
申请日：2006-03-03
申请人： Jean-Philippe Vasseur , Carol Iturralde , George Swallow
发明人： Jean-Philippe Vasseur , Carol Iturralde , George Swallow
IPC分类号： G06F15/173 , H04L12/723 , H04L12/715 , G06F15/16
CPC分类号： H04L45/50 , H04L45/04
摘要： A technique dynamically restores original attributes of a Traffic Engineering Label Switched Path (TE-LSP) that are provided in a source domain for a destination domain when traversing one or more intermediate domains that may translate the TE-LSP attributes in a computer network. According to the novel technique, a head-end node requests an interdomain TE-LSP having one or more original TE-LSP attributes (e.g., priority, bandwidth, etc.) using a signaling exchange. The head-end node may also request restoration of the original TE-LSP attributes upon entrance into the destination domain. Intermediate domains (e.g., border routers of the domains) receiving the request may translate the original TE-LSP attributes into corresponding intermediate domain TE-LSP attributes. When the request reaches the destination domain, the intermediate domain TE-LSP attributes of the requested TE-LSP are restored into the original TE-LSP attributes.
摘要翻译：当遍历可能转换计算机网络中的TE-LSP属性的一个或多个中间域时，技术动态地恢复在目的地域的源域中提供的流量工程标签交换路径（TE LSP）的原始属性。根据该新技术，前端节点使用信令交换请求具有一个或多个原始TE-LSP属性（例如，优先级，带宽等）的域间TE-LSP。前端节点还可以在进入目的地域时请求恢复原始TE-LSP属性。接收请求的中间域（例如，域的边界路由器）可以将原始TE-LSP属性转换为相应的中间域TE-LSP属性。当请求到达目的域时，请求的TE-LSP的中间域TE-LSP属性恢复为原始TE-LSP属性。

10. 发明申请

US20130336126A1 TIME-BASED SCHEDULING FOR TUNNELS COMPUTED BY A STATEFUL PATH COMPUTATION ELEMENT 有权
标题翻译：一个稳定的路径计算元素计算的隧道的基于时间的调度
公开(公告)号：US20130336126A1
公开(公告)日：2013-12-19
申请号：US13524751
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
IPC分类号： H04L12/24 , H04L12/26
CPC分类号： H04L41/0896 , H04L41/147 , H04L47/823 , H04L47/825 , H04L47/826
摘要： In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.
摘要翻译：在一个实施例中，计算机网络中的路径计算元件（PCE）接收一个或多个路径计算请求（PCReq），并记录每个PCReq的时间和相应的请求带宽。基于该信息，PCE可以确定计算机网络的流量简档，并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库（TED）。因此，在特定时间之前，PCE可以在特定时间内确定隧道在业务简档内的布置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式