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

31. 发明授权

US08467394B2 Automatic route tagging of BGP next-hop routes in IGP 有权
标题翻译：在IGP中自动路由标记BGP下一跳路由
公开(公告)号：US08467394B2
公开(公告)日：2013-06-18
申请号：US13149535
申请日：2011-05-31
申请人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/04 , H04L45/02 , H04L45/026 , H04L45/28 , H04L45/52
摘要： In one embodiment, a router in a routing domain exchanges routing information with one or more other routers located external to the routing domain using an exterior gateway protocol (EGP). The router exchanges routing information with one or more other routers located internal to the routing domain using an interior gateway protocol (IGP). The router detects a route to be advertised by the IGP is also used as a next-hop attribute of a route advertised by the EGP. In response, the router tags the route advertised by the IGP as an important route for convergence to indicate that the tagged route is to be processed before other routes that have not been tagged during convergence processing. The tagged route is advertised within the routing domain using the IGP.
摘要翻译：在一个实施例中，路由域中的路由器使用外部网关协议（EGP）与位于路由域外部的一个或多个其他路由器交换路由信息。路由器使用内部网关协议（IGP）与位于路由域内部的一个或多个其他路由器交换路由信息。路由器检测到IGP发布的路由也被用作EGP发布的路由的下一跳属性。作为响应，路由器将IGP发布的路由标记为收敛的重要路由，以指示在收敛处理期间未标记的其他路由之前要标记的路由将被处理。使用IGP在路由域内通告标记的路由。

32. 发明授权

US07978708B2 Automatic route tagging of BGP next-hop routes in IGP 有权
标题翻译：在IGP中自动路由标记BGP下一跳路由
公开(公告)号：US07978708B2
公开(公告)日：2011-07-12
申请号：US11025203
申请日：2004-12-29
申请人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/04 , H04L45/02 , H04L45/026 , H04L45/28 , H04L45/52
摘要： 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 (EGP) process executing on the node, as a next-hop address, since external connectivity relies on such a route. Notably, the EGP process 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.
摘要翻译：一种技术配置中间网络节点，以自动确定路由协议发布的路由是否对计算机网络中的快速收敛很重要。如本文所使用的，快速收敛所需的重要路由是路由协议所通告的路由，例如在节点上执行的外部网关路由协议（EGP）过程作为下一跳地址，因为外部连接依赖于路线。值得注意的是，EGP进程与在节点上执行的内部网关路由协议（IGP）进程交互，以将路由标识为重要路由。识别重要的路由又反过来允许IGP以高优先级的方式处理路由，从而促进快速收敛。

33. 发明授权

US07814227B2 Computation of a shortest inter-domain TE-LSP across a set of autonomous systems 有权
标题翻译：跨一组自治系统计算最短域间TE-LSP
公开(公告)号：US07814227B2
公开(公告)日：2010-10-12
申请号：US11073348
申请日：2005-03-04
申请人： Jean-Philippe Vasseur , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Stefano B. Previdi
IPC分类号： G06F15/173
CPC分类号： H04L45/12 , H04L45/04 , H04L45/42 , H04L45/50
摘要： A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.
摘要翻译：一种技术计算从本地域中的头端节点到计算机网络中远程域的尾端节点的流量工程（TE）标签交换路径（LSP）的最短路径。新颖的路径计算技术确定了一组不同的远程域，TE-LSP可以通过该组来遍历尾端节点（例如沿着“域路由”）。一旦确定了可能的路由集合，则前端节点向其本地域的一个或多个路径计算元件（PCE）发送路径计算请求，请求每个域路由的计算路径。在接收每个可能的域路由的路径响应时，前端节点选择最优（最短）路径，并相应建立TE-LSP。

34. 发明授权

US07801137B2 Receiver-based construction of point-to-multipoint trees using path computation elements in a computer network 有权
标题翻译：在计算机网络中使用路径计算元素的基于接收器的点对多点树的构造
公开(公告)号：US07801137B2
公开(公告)日：2010-09-21
申请号：US12045749
申请日：2008-03-11
申请人： Jean-Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils
IPC分类号： H04L12/28
CPC分类号： H04L45/16 , H04L12/185 , H04L45/00 , H04L45/04 , H04L45/48 , H04L45/50
摘要： In one embodiment, a trigger to add a leaf node to a multicast group of a computer network is detected, and the leaf node may determine a root node of the multicast group to request a path between a tunnel tree and the leaf node of the multicast group. In response to the multicast group having an existing tree, a reply is received from the root node with a computed path to add the leaf node to the tree at a selected node of the tree. The leaf node may then be added to the multicast group tunnel tree over the computed path at the selected node.
摘要翻译：在一个实施例中，检测到向计算机网络的多播组添加叶节点的触发器，并且叶节点可以确定多播组的根节点以请求隧道树和多播的叶节点之间的路径组。响应于具有现有树的多播组，使用计算的路径从根节点接收回复，以将叶节点添加到树的所选节点处的树。然后可以通过所选节点处的计算路径将叶节点添加到多播组隧道树中。

35. 发明申请

US20100146149A1 DYNAMIC PATH COMPUTATION ELEMENT LOAD BALANCING WITH BACKUP PATH COMPUTATION ELEMENTS 有权
标题翻译：动态路径计算元件负载平衡与备用路径计算元件
公开(公告)号：US20100146149A1
公开(公告)日：2010-06-10
申请号：US12706567
申请日：2010-02-16
申请人： Jean-Philippe Vasseur , Abhay Kumar Roy , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Abhay Kumar Roy , Stefano B. Previdi
IPC分类号： G06F15/173 , H04L12/56
CPC分类号： H04L47/10 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/42 , H04L47/125 , H04L63/0272 , H04L2212/00
摘要： In one embodiment, one or more path computation requests from path computation clients (PCCs) in a first network domain are received at a first border router (BR) arranged at the border of the first network domain and a second network domain. The first BR learns of a path communication element (PCE) in the second network domain. The PCE in the second network domain is informed of path computation information for the first network domain. One or more tunnels are established between the first BR and the PCE in the second network domain. One or more path computation requests from PCCs in the first network domain are passed from the first BR, through the one or more tunnels, to the PCE in the second network domain, to be serviced by the PCE in the second network domain using the path computation information for the first network domain.
摘要翻译：在一个实施例中，在布置在第一网络域和第二网络域的边界处的第一边界路由器（BR）处接收来自第一网络域中的路径计算客户端（PCC）的一个或多个路径计算请求。第一个BR学习第二个网络域中的路径通信元素（PCE）。第二网域的PCE通知第一网域的路径计算信息。在第二网络域中的第一BR和PCE之间建立一个或多个隧道。来自第一网络域中的PCC的一个或多个路径计算请求从第一BR通过一个或多个隧道传递到第二网络域中的PCE，以由第二网络中的PCE使用路径第一网域的计算信息。

36. 发明申请

US20090182894A1 DYNAMIC PATH COMPUTATION ELEMENT LOAD BALANCING WITH BACKUP PATH COMPUTATION ELEMENTS 有权
标题翻译：动态路径计算元件负载平衡与备用路径计算元件
公开(公告)号：US20090182894A1
公开(公告)日：2009-07-16
申请号：US12013096
申请日：2008-01-11
申请人： Jean-Philippe Vasseur , Abhay Kumar Roy , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Abhay Kumar Roy , Stefano B. Previdi
IPC分类号： G06F15/173
CPC分类号： H04L47/10 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/42 , H04L47/125 , H04L63/0272 , H04L2212/00
摘要： In one embodiment, a first path computation element (PCE) operates between first and second network domains, and is adapted to service requests from path computation clients (PCCs) in at least the first domain. In response to a backup event (e.g., failure of a second PCE), a backup PCE in the second domain may be informed of path computation information for the first domain used by the first PCE, and tunnels may be bi-directionally established between the first PCE and the backup PCE. Once the tunnels are established, the backup PCE may be advertised into the first domain, and the backup PCE may operate to load balance service requests for the first domain through the bi-directionally established tunnels.
摘要翻译：在一个实施例中，第一路径计算元件（PCE）在第一和第二网络域之间操作，并且适于在至少第一域中对来自路径计算客户端（PCC）的请求进行服务。响应于备份事件（例如，第二PCE的故障），可以向第二域中的备用PCE通知第一PCE使用的第一域的路径计算信息，并且隧道可以在第二域之间双向建立第一个PCE和备份PCE。一旦建立了隧道，备用PCE可以被通告到第一域，并且备份PCE可以通过双向建立的隧道来操作以对第一域的业务请求进行负载平衡。

37. 发明授权

US07512063B2 Border router protection with backup tunnel stitching in a computer network 有权
标题翻译：边缘路由器保护，在计算机网络中备份隧道缝合
公开(公告)号：US07512063B2
公开(公告)日：2009-03-31
申请号：US11012044
申请日：2004-12-14
申请人： Jean-Philippe Vasseur , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Stefano B. Previdi
IPC分类号： H04J3/14
CPC分类号： H04L45/22 , H04L45/02 , H04L45/04 , H04L45/28 , H04L45/50 , H04L47/70 , H04L47/724 , H04L47/728 , H04L47/746 , H04L47/825
摘要： A technique protects against the failure of a border router between two domains in a computer network using Fast Reroute and backup tunnels. According to the technique, the protected border router advertises a list of all its adjacent next-hop routers (i.e., its “neighbors”). A neighbor in the first domain that is immediately upstream to the protected border router and that is configured to protect the border router (i.e., the “protecting router”) selects a neighbor in a second domain (i.e., a “next-next-hop,” NNHOP) to act as a “merge point” of all the NNHOPs of that domain. The protecting router calculates a backup tunnel to the merge point that excludes the protected border router and associates the backup tunnel with all “protected prefixes.” The merge point then “stitches” additional backup tunnels onto the backup tunnel to provide a stitched tunnel to each remaining NNHOP. When the protected border router fails, Fast Reroute is triggered, and all protected prefix traffic is rerouted onto the backup tunnel to the merge point, which either forwards the traffic to its reachable prefixes or to a corresponding stitched tunnel.
摘要翻译：一种技术可以防止计算机网络中使用快速重路由和备份隧道的两个域之间的边界路由器发生故障。根据该技术，受保护的边界路由器通告其所有相邻的下一跳路由器（即其“邻居”）的列表。紧邻受保护边界路由器上游并被配置为保护边界路由器（即，“保护路由器”）的第一域中的邻居选择第二域中的邻居（即，下一跳），“NNHOP”）作为该域的所有NNHOP的“合并点”。保护路由器计算到合并点的备用隧道，排除受保护的边界路由器，并将备份隧道与所有“受保护的前缀”相关联。合并点然后将其他备用隧道“缝合”到备份隧道上，为每个剩余的NNHOP提供缝合隧道。当受保护的边界路由器发生故障时，快速重路由被触发，并且所有保护的前缀流量被重新路由到到合并点的备份隧道，该合并点将流量转发到其可达到的前缀或相应的缝合隧道。

38. 发明申请

US20080225711A1 DYNAMIC RESPONSE TO TRAFFIC BURSTS IN A COMPUTER NETWORK 有权
标题翻译：对计算机网络中的交通冲突的动态响应
公开(公告)号：US20080225711A1
公开(公告)日：2008-09-18
申请号：US11685837
申请日：2007-03-14
申请人： Robert Raszuk , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Robert Raszuk , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04J3/14
CPC分类号： H04L47/10 , H04L45/00 , H04L45/04 , H04L45/306 , H04L47/22 , H04L47/29 , H04L47/32
摘要： In one embodiment, a node receives traffic sent from one or more sources toward one or more destinations (e.g., Multipoint-to-Point, MP2P traffic). The node may detect a burst of received traffic based on one or more characteristics of the burst traffic, and, in response, may dynamically apply traffic shaping to the burst traffic. The traffic shaping is adapted to forward burst traffic received below a configurable threshold at a configurable pace and to drop burst traffic received above the configurable threshold. In addition, the node may also store the burst traffic dropped by traffic shaping, and forwards the stored burst traffic toward its destination after a configurable delay.
摘要翻译：在一个实施例中，节点接收从一个或多个源向一个或多个目的地（例如，多点到点，MP2P业务）发送的业务。节点可以基于突发业务的一个或多个特性来检测接收到的流量的突发，并且作为响应，可以动态地将流量整形应用于突发业务。流量整形适于以可配置的速度转发在可配置的阈值以下接收的突发流量，并且将接收到高于可配置阈值的突发流量丢弃。此外，节点还可以存储由流量整形丢失的突发流量，并且在可配置的延迟之后将存储的突发业务转发到其目的地。

39. 发明授权

US08549176B2 Propagation of routing information in RSVP-TE for inter-domain TE-LSPs 有权
标题翻译：在RSVP-TE中进行域间TE-LSP的路由信息的传播
公开(公告)号：US08549176B2
公开(公告)日：2013-10-01
申请号：US11001349
申请日：2004-12-01
申请人： Jean-Philippe Vasseur , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , Stefano B. Previdi
IPC分类号： G06F15/173 , H04L12/28 , H04L12/56
CPC分类号： H04L45/507 , H04L45/00 , H04L45/04 , H04L45/50
摘要： A technique dynamically retrieves reachability information from a target node, including a tail-end or any intermediate node, along a traffic engineering (TE) label switched path (LSP) that spans multiple domains in a computer network. The interdomain information retrieval technique is illustratively based on a request/response signaling exchange whereby at least a portion of the reachability, i.e., routing, information maintained by the target node is propagated to a head-end node of the TE-LSP. The routing information may comprise a list of address prefixes reachable by the target node, but may optionally include next-hop and metric attributes associated with those prefixes. The head-end node uses the retrieved routing information to calculate routes reachable from the target node for insertion into its routing table.
摘要翻译：一种技术从跨越计算机网络中的多个域的流量工程（TE）标签交换路径（LSP）动态地从目标节点（包括尾端或任何中间节点）检索可达性信息。域间信息检索技术说明性地基于请求/响应信令交换，由此目的节点维护的可达性即路由信息的至少一部分被传播到TE-LSP的头端节点。路由信息可以包括目标节点可达到的地址前缀的列表，但是可以可选地包括与这些前缀相关联的下一跳和度量属性。前端节点使用检索到的路由信息来计算从目标节点可到达的路由，以插入其路由表。

40. 发明授权

US08089968B2 Automatic prioritization of BGP next-hop in IGP convergence 有权
标题翻译：在IGP收敛中自动优先化BGP下一跳
公开(公告)号：US08089968B2
公开(公告)日：2012-01-03
申请号：US12204568
申请日：2008-09-04
申请人： 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
摘要： 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.
摘要翻译：在一个实施例中，域间路由协议存储具有相关联的下一跳地址的域间路由协议路由。搜索路由表寻找可用于到达域间路由协议路由的下一跳地址的域内路由协议路由。这种路线被标记为收敛的重要路线。之后，为了响应需要路由表更新的网络的变化，在处理任何其他域内路由协议路由之前，通过域内路由协议来处理标记为收敛的重要路由的域内路由协议路由，没有被标记为收敛的重要路线。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式