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

11. 发明申请

US20060126496A1 Fast reroute (FRR) protection at the edge of a RFC 2547 network 有权
公开(公告)号：US20060126496A1
公开(公告)日：2006-06-15
申请号：US11010225
申请日：2004-12-10
申请人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： 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.

12. 发明申请

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可以在特定时间内确定隧道在业务简档内的布置。

13. 发明申请

US20060165013A1 Method and apparatus for identifying an egress point to a network location 有权
标题翻译：用于识别到网络位置的出口点的方法和装置
公开(公告)号：US20060165013A1
公开(公告)日：2006-07-27
申请号：US11045015
申请日：2005-01-26
申请人： Stefano Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
发明人： Stefano Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
IPC分类号： H04L12/28
CPC分类号： H04L45/02
摘要： A method of identifying an egress point to a network location in a data communications network comprising a plurality of nodes and links there between comprises the step, performed at the identifying node, of receiving a notification through the network advertising an adjacency to a network location. The method further comprises the steps, performed at the identifying node, of deriving from the notification adjacency information and identifying, from the adjacency information, the egress point.
摘要翻译：一种识别包括在其中的多个节点和链路的数据通信网络中的网络位置的出口点的方法包括：在识别节点执行的步骤，通过网络接收通知与网络位置相邻的通知。所述方法还包括在所述识别节点处执行的从所述通知邻接信息导出并从所述邻接信息识别所述出口点的步骤。

14. 发明申请

US20060153200A1 Automatic prioritization of BGP next-hop in IGP 有权
标题翻译：在IGP中自动优先化BGP下一跳
公开(公告)号：US20060153200A1
公开(公告)日：2006-07-13
申请号：US11025251
申请日：2004-12-29
申请人： Clarence Filsfils , Stefano Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/56
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以高优先级的方式处理路由，从而促进快速收敛。

15. 发明授权

US09065750B2 Congestion-based notification during fast reroute operations in stateful path computation element environments 有权
标题翻译：在状态路径计算元素环境中进行快速重路由操作期间基于拥塞的通知
公开(公告)号：US09065750B2
公开(公告)日：2015-06-23
申请号：US13524135
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
IPC分类号： H04J3/14 , G06F11/00 , H04L12/729 , H04L12/707 , H04L12/703 , H04L12/801 , H04L12/911
CPC分类号： H04L45/125 , H04L45/22 , H04L45/28 , H04L47/11 , H04L47/825
摘要： In one embodiment, once activation of use of a backup tunnel is detected for a primary tunnel, then a level of congestion of the path of the backup tunnel may be determined. In response to the level being greater than a threshold, a head-end node of the primary tunnel is triggered to reroute the primary tunnel (e.g., requesting to a path computation element). Conversely, in response to the level not being greater than the threshold, the backup tunnel is allowed to remain activated.
摘要翻译：在一个实施例中，一旦检测到主隧道的备用隧道的使用的激活，则可以确定备用隧道的路径的拥塞级别。响应于该级别大于阈值，主隧道的前端节点被触发以重新路由主隧道（例如，请求到路径计算元件）。相反，响应级别不大于阈值，允许备份隧道保持激活。

16. 发明申请

US20130336107A1 DYNAMICALLY TRIGGERED TRAFFIC ENGINEERING ROUTING ADVERTISEMENTS IN STATEFUL PATH COMPUTATION ELEMENT ENVIRONMENTS 有权
标题翻译：动态路由计算元素环境下的动态交通工程路由广告
公开(公告)号：US20130336107A1
公开(公告)日：2013-12-19
申请号：US13524769
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
IPC分类号： H04L12/24
CPC分类号： H04L45/028 , H04L41/0654 , H04L45/42 , H04L45/44 , H04L47/785 , H04L47/825
摘要： In one embodiment, a device (e.g., a path computation element, PCE) monitors a tunnel set-up failure rate within a computer network, and determines whether to adjust an accuracy of routing information based on the tunnel set-up failure rate. For instance, the tunnel set-up failure rate being above a first threshold indicates a need for greater accuracy. In response to the tunnel set-up failure rate being above the first threshold, the device may then instruct one or more routers to shorten their routing update interval in the computer network.
摘要翻译：在一个实施例中，设备（例如，路径计算元件，PCE）监视计算机网络内的隧道建立失败率，并且基于隧道建立失败率来确定是否调整路由信息的准确性。例如，隧道建立故障率高于第一阈值表示需要更高的精度。响应于隧道建立失败率高于第一阈值，设备然后可以指示一个或多个路由器缩短其在计算机网络中的路由更新间隔。

17. 发明授权

US08855014B2 Distributed stateful path computation element overlay architecture 有权
标题翻译：分布状态路径计算元素覆盖架构
公开(公告)号：US08855014B2
公开(公告)日：2014-10-07
申请号：US13524071
申请日：2012-06-15
申请人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
发明人： Stefano Previdi , Jean-Philippe Vasseur , Jan Medved , David Ward
IPC分类号： H04L12/28 , H04L1/00
CPC分类号： H04L45/50 , H04L45/04
摘要： In one embodiment, a particular device in a computer network maintains a locally owned tunnel-state table, and joins a distributed hash table (DHT) ring. In addition, the locally owned tunnel-state table is shared with other devices of the DHT ring to establish a DHT-owned tunnel-state table. The particular device (and other devices) determines ownership of link-state advertisements (LSAs) for a specific portion of a traffic engineering database (TED) according to the DHT ring. As such, when the particular device (or any device) computes a path for a tunnel using a local TED, the particular device may request permission to use resources along the computed path that were advertised in particular LSAs from owners of those particular LSAs when not owned by the particular device.
摘要翻译：在一个实施例中，计算机网络中的特定设备维护本地拥有的隧道状态表，并且连接分布式散列表（DHT）环。此外，本地拥有的隧道状态表与DHT环的其他设备共享，以建立DHT拥有的隧道状态表。特定设备（和其他设备）根据DHT环确定针对流量工程数据库（TED）的特定部分的链路状态通告（LSA）的所有权。因此，当特定设备（或任何设备）使用本地TED计算隧道的路径时，特定设备可以请求允许沿着所计算的路径使用资源，这些资源在特定LSA的特定LSA中被发布，来自那些特定LSA的所有者由特定设备拥有。

18. 发明授权

US08817591B2 Inter-domain signaling to update remote path computation elements after a call set-up failure 有权
标题翻译：呼叫建立失败后更新远程路径计算元素的域间信令
公开(公告)号：US08817591B2
公开(公告)日：2014-08-26
申请号：US13524168
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L1/00 , H04L12/26
CPC分类号： H04L41/12 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50 , H04L47/724 , H04L47/785 , H04L47/825
摘要： In one embodiment, a router in a non-originating domain receives a signal to establish a tunnel, the signal having an identification (ID) of an originating path computation element (PCE) of an originating domain from where the signal to establish the tunnel originated. In response to determining that establishment of the tunnel fails, the router may signal the failure of the establishment to a local PCE of the non-originating domain, the signaling indicating the ID of the originating PCE to cause the local PCE to provide updated routing information of the non-originating domain to the originating PCE.
摘要翻译：在一个实施例中，非起始域中的路由器接收建立隧道的信号，该信号具有始发域的始发路径计算元件（PCE）的标识（ID），其中建立隧道的信号源自。响应于确定隧道的建立失败，路由器可以将建立的失败信号发送到非始发域的本地PCE，该信令指示发起PCE的ID，以使本地PCE提供更新的路由信息的非始发域到原始PCE。

19. 发明申请

US20070047469A1 Efficient constrained shortest path first optimization technique 有权
标题翻译：有效约束最短路径优化技术
公开(公告)号：US20070047469A1
公开(公告)日：2007-03-01
申请号：US11210910
申请日：2005-08-24
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/02 , H04L45/028 , H04L45/28 , H04L45/302 , H04L45/50
摘要： A technique performs an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. The novel CSPF technique is triggered upon the detection of an event in the computer network that could create a more optimal path, such as, e.g., a new or restored network element or increased path resources. Once the novel CSPF technique is triggered, the computing node (e.g., a head-end node of the TE-LSP or a Path Computation Element, PCE) determines the set of nodes adjacent to the event, and further determines which of those adjacent nodes are within the TE-LSP (“attached nodes”). The computing node performs a CSPF computation rooted at the closest attached node to determine whether a new computed path cost is less than a current path cost (e.g., by a configurable amount), and if so, triggers optimization of the TE-LSP along the new path.
摘要翻译：一种技术在计算机网络中执行流量工程（TE）标签交换路径（LSP）的有效约束最短路径优先（CSPF）优化。检测到计算机网络中可能产生更为优化的路径（例如，新的或恢复的网络元件或增加的路径资源）的事件触发了新的CSPF技术。一旦新颖的CSPF技术被触发，计算节点（例如，TE-LSP的头端节点或路径计算元件PCE）确定与事件相邻的节点集合，并进一步确定那些相邻节点中的哪一个在TE-LSP（“附属节点”）内。计算节点执行根据最接近的附加节点的CSPF计算，以确定新的计算路径开销是否小于当前路径开销（例如，通过可配置的量），如果是，则触发TE-LSP沿着新途径

20. 发明授权

US07433320B2 System and methods for network path detection 有权
标题翻译：网络路径检测的系统和方法
公开(公告)号：US07433320B2
公开(公告)日：2008-10-07
申请号：US11048077
申请日：2005-02-01
申请人： Stefano Previdi , James N. Guichard , Jean-Philippe Vasseur , David D. Ward
发明人： Stefano Previdi , James N. Guichard , Jean-Philippe Vasseur , David D. Ward
IPC分类号： H04L12/28 , H04L12/46
CPC分类号： H04L45/026 , H04L43/0811 , H04L45/26 , H04L45/28 , H04L63/0272
摘要： Customer edge (CE) to CE device verification checks initiate routes from available CEs as a set of path verification messages, destined for remote CE routes serving a remote VPN. An extended community attribute, included among the attributes of the path verification message, stores the identity of the originating CE router. The path verification message propagates across the network, and transports the identity of the originating CE router because the originator identity is not overwritten by successive routing. Upon receipt by the remote CE, the originator is determinable from the extended community attribute. A further reachability field is also included in the extended community attribute and indicates whether per CE or per prefix is appropriate for the particular route in question. In this manner, CE-CE connectivity checks identify CEs which are reachable from other CEs. Accordingly, such a mechanism allows for route reachability aggregation on a per-CE or per-prefix reachability basis.
摘要翻译：客户端（CE）到CE设备验证检查从可用的CE启动路由作为一组路径验证消息，目的地是服务于远程VPN的远程CE路由。包含在路径验证消息的属性之间的扩展团体属性存储始发CE路由器的身份。路径验证消息通过网络传播，并传输始发CE路由器的身份，因为始发方身份不会被连续路由覆盖。远程CE收到后，发起者可以从扩展团体属性中确定。扩展社区属性中还包括另外的可访问性字段，并指示每个CE或每个前缀是否适合所讨论的特定路由。以这种方式，CE-CE连接检查可以识别可从其他CE接入的CE。因此，这种机制允许基于每个CE或每个前缀可达性的路由可达性聚合。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式