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

1. 发明申请

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属性。

2. 发明授权

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属性。

3. 发明授权

US07359386B2 Soft preemption feedback 有权
标题翻译：软抢占反馈
公开(公告)号：US07359386B2
公开(公告)日：2008-04-15
申请号：US10725606
申请日：2003-12-02
申请人： Jean Philippe Vasseur , Ramesh Uppili , Carol Iturralde , Muthurajah Sivabalan
发明人： Jean Philippe Vasseur , Ramesh Uppili , Carol Iturralde , Muthurajah Sivabalan
IPC分类号： H04L12/28 , H04L12/54
CPC分类号： H04L45/00 , H04L29/06 , H04L45/50 , H04L47/10 , H04L47/2433 , H04L47/245 , H04L47/70 , H04L47/74 , H04L47/765 , H04L47/805 , H04L47/824 , H04L47/825 , H04L47/826 , H04L69/28
摘要： Systems and methods for preemption of Traffic Engineering LSPs such that preemption decisions are made in a coordinated fashion along the path of a new LSP and computation of a new path for a preempted LSP can take advantage of knowledge of newly unavailable links. The efficiency of the preemption mechanism is greatly increased and the undesirable effects of heterogeneous preemption decisions are limited. The amount of signaling may also be significantly reduced. In one implementation, these advantages are achieved by exploiting an upstream preemption feedback mechanism that uses an incremental timer to delay preemption decisions until feedback is available.
摘要翻译：流量工程LSP抢占的系统和方法，使得沿着新LSP的路径以协调的方式进行抢占决策，并为抢占的LSP计算新的路径，可以利用新的不可用链路的知识。抢占机制的效率大大提高，异质抢占决策的不良影响有限。信号量也可以显着降低。在一个实现中，这些优点通过利用上游抢占反馈机制来实现，该机制使用增量定时器来延迟抢占决定，直到反馈可用。

4. 发明授权

US07623461B2 Trigger for packing path computation requests 有权
标题翻译：用于打包路径计算请求的触发器
公开(公告)号：US07623461B2
公开(公告)日：2009-11-24
申请号：US11054145
申请日：2005-02-09
申请人： Jean Philippe Vasseur , Carol Iturralde , Robert Goguen
发明人： Jean Philippe Vasseur , Carol Iturralde , Robert Goguen
IPC分类号： G01R31/08
CPC分类号： H04L45/42 , H04L41/0677 , H04L43/0894 , H04L45/02 , H04L45/44 , H04L45/50
摘要： A technique triggers packing of path computation requests (PCRs) for traffic engineering (TE) label switched paths (LSPs) that are sent from one or more label-switched routers (LSRs) to a path computation element (PCE) of a computer network. According to the novel technique, incoming PCRs are packed into sets in response to a certain event, and one or more TE-LSPs (paths) are computed for each PCR of a particular set based on the PCRs of that set. Specifically, the PCE detects an event in the network (“network event”) indicating that an increase in the number of incoming PCRs has occurred, or that an increase is likely to occur due to, e.g., a change in a network element. Once the network event has been detected, the PCE packs the incoming PCRs into configured-length sets, such as, e.g., for a specified time interval or a certain number of PCRs. The PCE computes paths for each PCR of a particular set while considering the other PCRs of that set, thereby reducing race conditions, signaling overhead, and set-up failures.
摘要翻译：一种技术触发了从一个或多个标签交换路由器（LSR）发送到计算机网络的路径计算元件（PCE）的流量工程（TE）标签交换路径（LSP）的路径计算请求（PCR）的打包。根据新技术，响应于某个事件将输入的PCR打包成集合，并且基于该集合的PCR针对特定集合的每个PCR计算一个或多个TE-LSP（路径）。具体地，PCE检测网络中的事件（“网络事件”），其指示进入的PCR的数量的增加已经发生，或者由于例如网络元件的变化而可能发生增加。一旦检测到网络事件，PCE将输入的PCR打包成配置长度的集合，例如，指定的时间间隔或一定数量的PCR。 PCE计算特定集合的每个PCR的路径，同时考虑该集合的其他PCR，从而减少竞争条件，信令开销和建立故障。

5. 发明授权

US07986618B2 Distinguishing between link and node failure to facilitate fast reroute 有权
标题翻译：区分链路和节点故障，以方便快速重路由
公开(公告)号：US07986618B2
公开(公告)日：2011-07-26
申请号：US10171395
申请日：2002-06-12
申请人： Anna Charny , Robert Goguen , Carol Iturralde , Elisheva Hochberg , Jean Philippe Vasseur
发明人： Anna Charny , Robert Goguen , Carol Iturralde , Elisheva Hochberg , Jean Philippe Vasseur
IPC分类号： G01R31/08
CPC分类号： H04L45/28 , H04L45/00 , H04L45/22 , H04L45/50
摘要： Systems and methods for distinguishing a node failure from a link failure are provided. By strengthening the assumption of independent failures, bandwidth sharing among backup tunnels protecting links and nodes of a network is facilitated as well as distributed computation of backup tunnel placement. Thus a backup tunnel overlay network can provide guaranteed bandwidth in the event of a failure.
摘要翻译：提供了用于区分节点故障与链路故障的系统和方法。通过加强独立故障的假设，便于保护网络链路和节点的备份隧道之间的带宽共享，以及备份隧道布局的分布式计算。因此，备份隧道覆盖网络可以在发生故障时提供有保证的带宽。

6. 发明申请

US20120183000A1 DYNAMICALLY AND EFFICIENTLY FORMING HIERARCHICAL TUNNELS 有权
标题翻译：动态和有效地形成分层隧道
公开(公告)号：US20120183000A1
公开(公告)日：2012-07-19
申请号：US13433011
申请日：2012-03-28
申请人： Jean-Philippe Vasseur , Carol Iturralde
发明人： Jean-Philippe Vasseur , Carol Iturralde
IPC分类号： H04L12/56
CPC分类号： H04L12/4633
摘要： In one embodiment, a hierarchical tunnel that encapsulates a plurality of child tunnels along a shared path segment is used. The shared path segment extends from a head-end node across one or more intermediate nodes to a tail-end node. A state of a child tunnel of the plurality of child tunnels encapsulated within the hierarchical tunnel is refreshed by the head-end node sending one or more refresh messages along the child tunnel that include a request that the one or more intermediate nodes remove the state of the child tunnel without sending error messages, and sending one or more encapsulated refresh messages within the hierarchical tunnel that cause the tail-end node to continue propagation of refresh messages along the child tunnel.
摘要翻译：在一个实施例中，使用沿共享路径段封装多个子隧道的分层隧道。共享路径段从头端节点跨越一个或多个中间节点延伸到尾端节点。封装在分级隧道内的多个子隧道的子隧道的状态由头端节点刷新，该端隧道沿着子隧道发送一个或多个刷新消息，该消息包括一个或多个中间节点去除子隧道，而不发送错误消息，并且在分层隧道内发送一个或多个封装的刷新消息，使得尾端节点继续沿着子隧道传播刷新消息。

7. 发明授权

US07599349B2 Computing inter-autonomous system MPLS traffic engineering LSP paths 有权
标题翻译：计算自治系统MPLS流量工程LSP路径
公开(公告)号：US07599349B2
公开(公告)日：2009-10-06
申请号：US10767574
申请日：2004-01-29
申请人： Jean Philippe Vasseur , Muthurajah Sivabalan , Anca Zamfir , Carol Iturralde
发明人： Jean Philippe Vasseur , Muthurajah Sivabalan , Anca Zamfir , Carol Iturralde
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/48 , H04L45/04 , H04L45/124 , H04L45/50
摘要： Systems and methods for computing the paths of MPLS Traffic Engineering LSPs across Autonomous System and/or area boundaries. A distributed path computation algorithm exploits multiple path computation elements (PCEs) to develop a virtual shortest path tree (VSPT) resulting in computation of an end-to-end optimal (shortest) path. In some implementations, the VSPT is computed recursively across all the Autonomous Systems and/or areas between the head-end and tail-end of the Traffic Engineering LSP.
摘要翻译：用于计算跨自治系统和/或区域边界的MPLS流量工程LSP路径的系统和方法。分布式路径计算算法利用多路径计算元素（PCE）开发虚拟最短路径树（VSPT），导致端对端最优（最短）路径的计算。在一些实现中，VSPT被递归地跨越所有自治系统和/或交通工程LSP的前端和尾端之间的区域计算。

8. 发明授权

US08363571B2 Dynamically and efficiently forming hierarchical tunnels 有权
标题翻译：动态有效地形成等级隧道
公开(公告)号：US08363571B2
公开(公告)日：2013-01-29
申请号：US13433011
申请日：2012-03-28
申请人： Jean-Philippe Vasseur , Carol Iturralde
发明人： Jean-Philippe Vasseur , Carol Iturralde
IPC分类号： H04L12/28 , H04L12/26 , H04L12/56 , G08C15/00 , H04J3/14 , G06F15/16
CPC分类号： H04L12/4633
摘要： In one embodiment, a hierarchical tunnel that encapsulates a plurality of child tunnels along a shared path segment is used. The shared path segment extends from a head-end node across one or more intermediate nodes to a tail-end node. A state of a child tunnel of the plurality of child tunnels encapsulated within the hierarchical tunnel is refreshed by the head-end node sending one or more refresh messages along the child tunnel that include a request that the one or more intermediate nodes remove the state of the child tunnel without sending error messages, and sending one or more encapsulated refresh messages within the hierarchical tunnel that cause the tail-end node to continue propagation of refresh messages along the child tunnel.
摘要翻译：在一个实施例中，使用沿共享路径段封装多个子隧道的分层隧道。共享路径段从前端节点跨越一个或多个中间节点延伸到尾端节点。封装在分级隧道内的多个子隧道的子隧道的状态由头端节点刷新，该端隧道沿着子隧道发送一个或多个刷新消息，该消息包括一个或多个中间节点去除子隧道，而不发送错误消息，并且在分层隧道内发送一个或多个封装的刷新消息，使得尾端节点继续沿着子隧道传播刷新消息。

9. 发明授权

US08199642B2 Dynamically and efficiently forming hierarchical tunnels 有权
标题翻译：动态有效地形成等级隧道
公开(公告)号：US08199642B2
公开(公告)日：2012-06-12
申请号：US11589600
申请日：2006-10-30
申请人： Jean-Philippe Vasseur , Carol Iturralde
发明人： Jean-Philippe Vasseur , Carol Iturralde
IPC分类号： G08C15/00 , H04L12/28 , H04L12/56 , G06F15/173
CPC分类号： H04L12/4633
摘要： In one embodiment, a node (e.g., a grooming node) determines a set of attribute groups (AGs) of existing child tunnels through the network, where an AG is a group of one or more compatible attributes among child tunnels, e.g., excluding bandwidth. The grooming node also determines a set of corresponding child tunnels that belong to a particular AG and that follow a shared path segment through the network, and may establish an hierarchical tunnel that encapsulates the set of corresponding child tunnels along the shared path segment. In another embodiment, a node requests that the one or more intermediate nodes of the hierarchical tunnel each remove the state of a child tunnel without sending any error messages, and sends refresh messages encapsulated within the hierarchical tunnel in a manner that allows a tail-end node to continue any necessary propagation of refresh messages along the child tunnel.
摘要翻译：在一个实施例中，节点（例如，修饰节点）通过网络确定现有子隧道的一组属性组（AG），其中AG是子隧道中的一个或多个兼容属性的组，例如排除带宽。梳理节点还确定属于特定AG并且通过网络遵循共享路径段的一组对应子隧道，并且可以建立沿共享路径段封装相应子隧道集合的分层隧道。在另一个实施例中，节点请求分层隧道的一个或多个中间节点每个消除子隧道的状态，而不发送任何错误消息，并且以允许后端的方式发送封装在分级隧道内的刷新消息节点继续沿着子隧道进行刷新消息的任何必要的传播。

10. 发明申请

US20080069007A1 Dynamically and efficiently forming hierarchical tunnels 有权
标题翻译：动态有效地形成等级隧道
公开(公告)号：US20080069007A1
公开(公告)日：2008-03-20
申请号：US11589600
申请日：2006-10-30
申请人： Jean-Philippe Vasseur , Carol Iturralde
发明人： Jean-Philippe Vasseur , Carol Iturralde
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L12/4633
摘要： In one embodiment, a node (e.g., a grooming node) determines a set of attribute groups (AGs) of existing child tunnels through the network, where an AG is a group of one or more compatible attributes among child tunnels, e.g., excluding bandwidth. The grooming node also determines a set of corresponding child tunnels that belong to a particular AG and that follow a shared path segment through the network, and may establish an hierarchical tunnel that encapsulates the set of corresponding child tunnels along the shared path segment. In another embodiment, a node requests that the one or more intermediate nodes of the hierarchical tunnel each remove the state of a child tunnel without sending any error messages, and sends refresh messages encapsulated within the hierarchical tunnel in a manner that allows a tail-end node to continue any necessary propagation of refresh messages along the child tunnel.
摘要翻译：在一个实施例中，节点（例如，修饰节点）通过网络确定现有子隧道的一组属性组（AG），其中AG是子隧道中的一个或多个兼容属性的组，例如排除带宽。梳理节点还确定属于特定AG并且通过网络遵循共享路径段的一组对应子隧道，并且可以建立沿着共享路径段封装相应子隧道集合的分层隧道。在另一个实施例中，节点请求分层隧道的一个或多个中间节点每个消除子隧道的状态，而不发送任何错误消息，并且以允许后端的方式发送封装在分级隧道内的刷新消息节点继续沿着子隧道进行刷新消息的任何必要的传播。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式