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

51. 发明授权

US08488444B2 Fast remote failure notification 有权
公开(公告)号：US08488444B2
公开(公告)日：2013-07-16
申请号：US11824885
申请日：2007-07-03
申请人： Clarence Filsfils , Stefano Previdi , David Ward
发明人： Clarence Filsfils , Stefano Previdi , David Ward
IPC分类号： G01R31/08
CPC分类号： H04L45/22 , H04L45/02 , H04L45/28 , H04L67/14 , H04L69/40
摘要： A method and system for failure notification at a remote node in communication with a local node are disclosed. The local node is configured for faster failure detection than the remote node. In one embodiment, the method includes establishing a failure monitoring session between the local node and the remote node, receiving at the remote node, a failure notification from the local node, the failure notification sent using a protocol of the failure monitoring session, and rerouting traffic at the remote node in response to the failure notification.

52. 发明申请

US20060045024A1 Mechanism to improve concurrency in execution of routing computation and routing information dissemination 有权
公开(公告)号：US20060045024A1
公开(公告)日：2006-03-02
申请号：US10928866
申请日：2004-08-27
申请人： Stefano Previdi , Clarence Filsfils , David Ward
发明人： Stefano Previdi , Clarence Filsfils , David Ward
IPC分类号： H04L12/56 , H04L12/26
CPC分类号： H04L45/56 , H04L45/02 , H04L45/12 , H04L47/24 , H04L47/6235 , H04L49/90 , H04L49/9078
摘要： A technique enables an intermediate network node to efficiently process link-state packets using a single running context (i.e., process or thread). The intermediate network node floods received link-state packets (LSP) before performing shortest path first (SPF) calculations and routing information base (RIB) updates. In addition, the node limits the number of LSPs that are permitted to be flooded before the node performs its SPF calculations. More specifically, if the number of link-state packets that are flooded during a flooding cycle exceeds a first predetermined threshold value, the node performs the SPF calculations before additional packets may be flooded. The intermediate network node also limits how long its RIB update may be delayed in favor of flooding operations. When the number of LSPs flooded after the SPF calculations exceeds a second predetermined threshold value or there are no more packets to be flooded, the node updates the contents of its RIB based on the SPF calculations.

53. 发明申请

US20050111349A1 Method and apparatus for determining network routing information based on shared risk link group information 有权
标题翻译：基于共享风险链路组信息确定网络路由信息的方法和装置
公开(公告)号：US20050111349A1
公开(公告)日：2005-05-26
申请号：US10719003
申请日：2003-11-21
申请人： Jean Vasseur , Stefano Previdi , Clarence Filsfils , David Ward
发明人： Jean Vasseur , Stefano Previdi , Clarence Filsfils , David Ward
IPC分类号： G01S13/00 , H04B20060101 , H04B1/00 , H04B1/40 , H04B1/69 , H04L5/04 , H04L12/28 , H04L12/56 , H04M1/00 , H04W88/06 , H04W88/10 , H04L12/26
CPC分类号： H04L45/12 , H04B1/71635 , H04L45/02 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/46 , H04L45/48 , H04L45/50 , H04W88/06 , H04W88/10
摘要： A method and apparatus are disclosed for performing a shortest path first network routing path determination in a data communications network based in part on information about links that are associated as shared risk link groups. Micro-loops are avoided in computing shortest path first trees by considering whether links are within shared risk link groups. In a first approach, for each link state packet in a link state database, listed adjacencies are removed if the link between the node originating the LSP and the reported adjacency belongs to a shared risk link group for which one component (local link) is known as down, and a shortest path first computation is then performed. In a second approach, during the SPT computation and after having added a first node to a path, each neighboring node is added to a tentative tree if and only if, a link between the first node and the neighboring node does not belong to a shared risk link group for which one component (local link) is known as down.
摘要翻译：公开了一种用于在数据通信网络中执行最短路径第一网络路由路径确定的方法和装置，部分地基于关于作为共享风险链路组关联的链路的信息。通过考虑链路是否在共享风险链路组内，避免了计算最短路径树的微循环。在第一种方法中，对于链路状态数据库中的每个链路状态分组，如果发起LSP的节点和报告的邻接关系之间的链路属于已知一个组件（本地链路）的共享风险链路组，则删除列出的邻接关系然后执行最短路径优先计算。在第二种方法中，在SPT计算期间，并且在将第一节点添加到路径之后，当且仅当第一节点和相邻节点之间的链路不属于共享时，每个相邻节点被添加到暂定树一个组件（本地链路）被称为down的风险链路组。

54. 发明申请

US20050078610A1 Method and apparatus for generating routing information in a data communication network 有权
标题翻译：用于在数据通信网络中生成路由信息的方法和装置
公开(公告)号：US20050078610A1
公开(公告)日：2005-04-14
申请号：US10685622
申请日：2003-10-14
申请人： Stefano Previdi , Clarence Filsfils
发明人： Stefano Previdi , Clarence Filsfils
IPC分类号： H04L12/26 , H04L12/28 , H04L12/56
CPC分类号： H04L45/28 , H04L45/02 , H04L45/12 , H04L45/18
摘要： A method and apparatus are disclosed for generating routing information in a data communications network. A first network element (such as a router) receives information relating to a second network element, such as another node or a network link. In response, the first network element determines whether the information relating to the second network element indicates a change in the network. When information relating to a second network element indicates a change in the network, the first network element determines a new shortest path through the network from the first network element for each network element in the network. After a delay, the first network element updates routing information for the first network element based on the new shortest path for the first network element. Preferably the delay is proportional to the distance of the first network element from the second network element.
摘要翻译：公开了用于在数据通信网络中生成路由信息的方法和装置。第一网络元件（例如路由器）接收与诸如另一节点或网络链路的第二网络元件有关的信息。作为响应，第一网络元件确定与第二网络元件相关的信息是否指示网络中的改变。当与第二网元相关的信息指示网络的变化时，第一网络元件针对网络中的每个网络元件从第一网络元件确定通过网络的新的最短路径。在延迟之后，第一网元基于第一网元的新的最短路径更新第一网元的路由信息。优选地，延迟与第一网络元件与第二网络元件的距离成比例。

55. 发明申请

US20070097974A1 Distributed border gateway protocol (BGP) route reflector system 审中-公开
标题翻译：分布式边界网关协议（BGP）路由反射器系统
公开(公告)号：US20070097974A1
公开(公告)日：2007-05-03
申请号：US11262061
申请日：2005-10-28
申请人： David Ward , John Scudder , Stefano Previdi , Clarence Filsfils , Robert Raszuk
发明人： David Ward , John Scudder , Stefano Previdi , Clarence Filsfils , Robert Raszuk
IPC分类号： H04L12/56 , H04J3/22 , H04L12/28 , H04J3/16
CPC分类号： H04L45/02 , H04L45/04 , H04L45/46
摘要： A packet data router comprises one or more first circuit boards comprising one or more first processors and first logic circuits programmed to perform packet data forwarding and packet data router control plane functions; and one or more second circuit boards comprising one or more second processors and second logic circuits programmed to perform only Border Gateway Protocol (BGP) route reflection server (RRS) functions. A distributed BGP route reflector system with the disclosed architecture distributes route reflection server software to a dedicated control board so that processing route reflection functions does not impact packet forwarding or protocol instances that converge forwarding tables.
摘要翻译：分组数据路由器包括一个或多个第一电路板，包括一个或多个第一处理器和被编程为执行分组数据转发和分组数据路由器控制平面功能的第一逻辑电路; 以及一个或多个第二电路板，包括一个或多个第二处理器和第二逻辑电路，其被编程为仅执行边界网关协议（BGP）路由反射服务器（RRS）功能。具有所公开架构的分布式BGP路由反射器系统将路由反射服务器软件分发到专用控制板，使得处理路由反射功能不会影响转发表的汇聚转发或协议实例。

56. 发明申请

US20070014293A1 Automatic protection of an SP infrastructure against exterior traffic 有权
标题翻译：自动保护SP基础设施免受外部流量的影响
公开(公告)号：US20070014293A1
公开(公告)日：2007-01-18
申请号：US11183381
申请日：2005-07-18
申请人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward
发明人： Clarence Filsfils , Stefano Previdi , John Scudder , David Ward
IPC分类号： H04L12/56
CPC分类号： H04L45/742 , H04L45/04 , H04L63/10
摘要： A method and system for protecting valuable resources within an autonomous system network. Address prefixes within the system are designated as valuable and a flag bit is associated with the address within routing tables of routers of the network. Interfaces to border routers are identified and when packets are received at those interfaces, the packets are flagged with a flag or tag bit. The destination address of the received packet is compared to the flag bit associated with the valuable resource prefix, and if the packet is directed to that resource the packet is dropped and/or logged, but the packet is not forwarded to that resource. In specific cases an interface from an external source may be configured to not create the flag or tag bit, wherein that packet will be delivered to the destination prefix of the packet.
摘要翻译：一种用于保护自治系统网络内有价值资源的方法和系统。系统中的地址前缀被指定为有价值的，并且标志位与网络的路由器的路由表中的地址相关联。识别到边界路由器的接口，并且当在这些接口处接收到分组时，分组被标记为标志或标记位。将接收到的分组的目的地地址与与有价值的资源前缀相关联的标志位进行比较，并且如果分组指向该资源，则分组被丢弃和/或记录，但是分组不被转发到该资源。在特定情况下，来自外部源的接口可以被配置为不创建标志或标记位，其中该分组将被传递到分组的目的地前缀。

57. 发明申请

US20050265239A1 Method and apparatus for forwarding data in a data communications network 有权
标题翻译：用于在数据通信网络中转发数据的方法和装置
公开(公告)号：US20050265239A1
公开(公告)日：2005-12-01
申请号：US10858920
申请日：2004-06-01
申请人： Stefano Previdi , Clarence Filsfils , Jean Vasseur
发明人： Stefano Previdi , Clarence Filsfils , Jean Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/24 , H04L45/02 , H04L45/123 , H04L45/125 , H04L45/48 , H04L47/10 , H04L47/125
摘要： A method is disclosed of forwarding data in a data communications network comprising a plurality of nodes and links therebetween, each link having an associated usage cost and a load capacity. A forwarding node identifies a lowest cost route, comprising one or more links, to a destination node. If a plurality of lowest cost routes is identified, then the forwarding node allocates data for forwarding along each of the lowest cost routes dependent on a relative load capacity of that route.
摘要翻译：公开了一种在数据通信网络中转发数据的方法，其中包括多个节点和链路之间的链路，每个链路具有相关联的使用成本和负载能力。转发节点向目的地节点标识包括一个或多个链路的最低成本路由。如果识别出多个最低成本路由，则转发节点根据该路由的相对负载能力分配用于沿每个最低成本路由转发的数据。

58. 发明申请

US20090010153A1 Fast remote failure notification 有权
标题翻译：快速远程故障通知
公开(公告)号：US20090010153A1
公开(公告)日：2009-01-08
申请号：US11824885
申请日：2007-07-03
申请人： Clarence Filsfils , Stefano Previdi , David Ward
发明人： Clarence Filsfils , Stefano Previdi , David Ward
IPC分类号： H04L12/24
CPC分类号： H04L45/22 , H04L45/02 , H04L45/28 , H04L67/14 , H04L69/40
摘要： A method and system for failure notification at a remote node in communication with a local node are disclosed. The local node is configured for faster failure detection than the remote node. In one embodiment, the method includes establishing a failure monitoring session between the local node and the remote node, receiving at the remote node, a failure notification from the local node, the failure notification sent using a protocol of the failure monitoring session, and rerouting traffic at the remote node in response to the failure notification.
摘要翻译：公开了一种在与本地节点通信的远程节点处的故障通知的方法和系统。本地节点配置为比远程节点更快的故障检测。在一个实施例中，该方法包括在本地节点和远程节点之间建立故障监视会话，在远程节点接收来自本地节点的故障通知，使用故障监视会话的协议发送的故障通知和重新路由响应故障通知在远程节点的流量。

59. 发明申请

US20070091795A1 Method of constructing a backup path in an autonomous system 有权
标题翻译：在自治系统中构建备份路径的方法
公开(公告)号：US20070091795A1
公开(公告)日：2007-04-26
申请号：US11254587
申请日：2005-10-20
申请人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Shand , Gargi Nalawade
发明人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Shand , Gargi Nalawade
IPC分类号： H04J3/14 , H04L12/56
CPC分类号： H04L45/22 , H04L45/04 , H04L45/28 , H04L2212/00
摘要： A method of constructing a backup path in an autonomous system (AS) for failure of an inter-AS link is described. The method comprises identifying an alternate inter-AS path and constructing a tunnel to an end point on the alternate path.
摘要翻译：描述了在自治系统（AS）中构建用于AS间链路故障的备用路径的方法。该方法包括识别替代的AS间路径并构建到备用路径上的终点的隧道。

60. 发明申请

US20070091794A1 Method of constructing a backup path in an autonomous system 审中-公开
标题翻译：在自治系统中构建备份路径的方法
公开(公告)号：US20070091794A1
公开(公告)日：2007-04-26
申请号：US11254469
申请日：2005-10-20
申请人： Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Charles Shand , Gargi Nalawade
发明人： Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Charles Shand , Gargi Nalawade
IPC分类号： H04J3/14 , H04L12/56
CPC分类号： H04L45/22 , H04L12/66 , H04L45/04 , H04L45/28 , H04L45/50
摘要： A method of constructing a backup path in an autonomous system (AS) for failure of a first inter-AS link serving a first set of prefixes is described. The method comprises identifying an alternate inter-AS link serving said plurality of prefixes and constructing a tunnel thereto.
摘要翻译：描述了在自治系统（AS）中构建用于服务于第一组前缀的第一AS间链路故障的备用路径的方法。该方法包括：识别服务于所述多个前缀的替代的AS间链路，并构建一个隧道。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式