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

1. 发明授权

US09143431B2 Hiding a service node in a network from a network routing topology 有权
标题翻译：从网络路由拓扑中隐藏网络中的服务节点
公开(公告)号：US09143431B2
公开(公告)日：2015-09-22
申请号：US12981444
申请日：2010-12-29
申请人： Pradosh Mohapatra , Stefano B. Previdi , Clarence Filsfils , David Ward
发明人： Pradosh Mohapatra , Stefano B. Previdi , Clarence Filsfils , David Ward
IPC分类号： H04L12/28 , H04L12/751
CPC分类号： H04L45/025
摘要： Hiding a service node in a network from a network topology is provided. In one embodiment, for example, an apparatus for hiding a service node in a network from a network topology, the apparatus comprising: a network interface; a processor; and one or more stored sequences of instructions which, when executed by the processor, cause the processor to perform: discovering a service node in a data network in accordance with a link-state protocol wherein the service node provides a network topology dependent service other than packet forwarding; establishing a link-state adjacency with the service node and one or more packet forwarding nodes in accordance with the link-state protocol; receiving a link-state advertisement; in response to identifying the link-state advertisement as an originating link-state advertisement sent from the service node, suppressing flooding of the received link-state advertisement to the one or more packet forwarding nodes.
摘要翻译：提供了从网络拓扑中隐藏网络中的服务节点。在一个实施例中，例如，一种用于从网络拓扑中隐藏网络中的服务节点的装置，所述装置包括：网络接口; 处理器以及一个或多个存储的指令序列，当由所述处理器执行时，所述指令序列使所述处理器执行：根据链路状态协议在数据网络中发现服务节点，其中所述服务节点提供除分组转发; 根据链路状态协议与服务节点和一个或多个分组转发节点建立链路状态邻接; 接收链接状态广告; 响应于将所述链路状态广告识别为从所述服务节点发送的始发链路状态广告，抑制所接收的链路状态广告对所述一个或多个分组转发节点的洪泛。

2. 发明申请

US20120170486A1 HIDING A SERVICE NODE IN A NETWORK FROM A NETWORK ROUTING TOPOLOGY 有权
标题翻译：在网络路由拓扑中隐藏网络中的服务节点
公开(公告)号：US20120170486A1
公开(公告)日：2012-07-05
申请号：US12981444
申请日：2010-12-29
申请人： Pradosh Mohapatra , Stefano B. Previdi , Clarence Filsfils
发明人： Pradosh Mohapatra , Stefano B. Previdi , Clarence Filsfils
IPC分类号： H04L12/28
CPC分类号： H04L45/025
摘要： Hiding a service node in a network from a network topology is provided. In one embodiment, for example, an apparatus for hiding a service node in a network from a network topology, the apparatus comprising: a network interface; a processor; and one or more stored sequences of instructions which, when executed by the processor, cause the processor to perform: discovering a service node in a data network in accordance with a link-state protocol wherein the service node provides a network topology dependent service other than packet forwarding; establishing a link-state adjacency with the service node and one or more packet forwarding nodes in accordance with the link-state protocol; receiving a link-state advertisement; in response to identifying the link-state advertisement as an originating link-state advertisement sent from the service node, suppressing flooding of the received link-state advertisement to the one or more packet forwarding nodes.
摘要翻译：提供了从网络拓扑中隐藏网络中的服务节点。在一个实施例中，例如，一种用于从网络拓扑中隐藏网络中的服务节点的装置，所述装置包括：网络接口; 处理器以及一个或多个存储的指令序列，所述指令当由处理器执行时使得处理器执行：根据链路状态协议在数据网络中发现服务节点，其中所述服务节点提供除分组转发; 根据链路状态协议与服务节点和一个或多个分组转发节点建立链路状态邻接; 接收链接状态广告; 响应于将所述链路状态广告识别为从所述服务节点发送的始发链路状态广告，抑制所接收的链路状态广告对所述一个或多个分组转发节点的洪泛。

3. 发明授权

US07428213B2 Method and apparatus for determining network routing information based on shared risk link group information 有权
标题翻译：基于共享风险链路组信息确定网络路由信息的方法和装置
公开(公告)号：US07428213B2
公开(公告)日：2008-09-23
申请号：US10719003
申请日：2003-11-21
申请人： Jean Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils , David Ward
发明人： Jean Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils , David Ward
IPC分类号： 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的风险链路组。

4. 发明申请

US20110228785A1 AUTOMATIC ROUTE TAGGING OF BGP NEXT-HOP ROUTES IN IGP 有权
标题翻译： BGP下一个路由器的自动路由标记
公开(公告)号：US20110228785A1
公开(公告)日：2011-09-22
申请号：US13149535
申请日：2011-05-31
申请人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28
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在路由域内通告标记的路由。

5. 发明授权

US07983153B2 Fast reroute (FRR) protection at the edge of a RFC 2547 network 有权
标题翻译：在RFC 2547网络边缘的快速重路由（FRR）保护
公开(公告)号：US07983153B2
公开(公告)日：2011-07-19
申请号：US12481411
申请日：2009-06-09
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： In one embodiment, an edge device in a first routing domain is configured to communicate with a second routing domain via a data link. The edge device receives a data packet containing a destination address that is reachable via the second routing domain and an indication that the data packet is a protected packet that was previously rerouted from another edge device in the first routing domain via a Multi-Protocol Label Switching (MPLS) Fast Reroute (FRR) backup path. The edge device determines if communication with the second routing domain is still available via the data link, and if so, removes the indication that the data packet is a protected packet and forwards the data packet to the second routing domain, and, if not, drops the data packet to prevent the data packet from being rerouted a second time in the first routing domain on another MPLS FRR backup path.
摘要翻译：在一个实施例中，第一路由域中的边缘设备被配置为经由数据链路与第二路由域进行通信。边缘设备接收包含经由第二路由域可到达的目的地地址的数据分组，以及指示数据分组是先前通过多协议标签交换在第一路由域中从另一边缘设备重新路由的受保护分组的指示（MPLS）快速重路由（FRR）备份路径。边缘设备确定与第二路由域的通信是否仍然通过数据链路可用，如果是，则删除数据分组是受保护分组的指示，并将数据分组转发到第二路由域，如果不是，删除数据包，以防止数据包在另一个MPLS FRR备份路径上的第一个路由域再次被重新路由。

6. 发明授权

US07961600B2 Loop prevention technique for MPLS using service labels 有权
标题翻译：使用服务标签的MPLS环路防护技术
公开(公告)号：US07961600B2
公开(公告)日：2011-06-14
申请号：US12694038
申请日：2010-01-26
申请人： Clarence Filsfils , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
发明人： Clarence Filsfils , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
IPC分类号： H04L12/26
CPC分类号： H04L45/18 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50
摘要： In one embodiment, a loss of communication is detected between a first edge device of a computer network and a neighboring routing domain. A data packet is received at the first edge device, where the received data packet contains a destination address that is reachable via the neighboring routing domain. A determination is made whether a service label is located in a Multi-Protocol Label Switching (MPLS) label stack included in the received data packet. A service label in the MPLS label stack indicates that the received data packet was previously rerouted in accordance with fast reroute (FRR) operations. In response to a determination that the received data packet does not include a service label in the MPLS label stack, the received data packet is rerouted to a second edge device of the computer network for forwarding to the neighboring routing domain.
摘要翻译：在一个实施例中，在计算机网络的第一边缘设备和相邻路由域之间检测到通信丢失。在第一边缘设备处接收数据分组，其中所接收的数据分组包含经由相邻路由域可到达的目的地地址。确定服务标签是否位于包含在所接收的数据分组中的多协议标签交换（MPLS）标签栈中。 MPLS标签堆栈中的服务标签表示接收到的数据包是根据快速重路由（FRR）操作先前重新路由的。响应于接收到的数据分组在MPLS标签堆栈中不包括服务标签的确定，所接收的数据分组被重新路由到计算机网络的第二边缘设备以转发到相邻路由域。

7. 发明授权

US07864669B2 Method of constructing a backup path in an autonomous system 有权
标题翻译：在自治系统中构建备份路径的方法
公开(公告)号：US07864669B2
公开(公告)日：2011-01-04
申请号：US11254587
申请日：2005-10-20
申请人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David D. Ward , John Galen Scudder , Stefano B. Previdi , Ian Michael Charles Shand , Gargi Nalawade
发明人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David D. Ward , John Galen Scudder , Stefano B. Previdi , Ian Michael Charles Shand , Gargi Nalawade
IPC分类号： H04L12/26
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间路径并构建到备用路径上的终点的隧道。

8. 发明授权

US07639688B2 Automatic protection of an SP infrastructure against exterior traffic 有权
标题翻译：自动保护SP基础设施免受外部流量的影响
公开(公告)号：US07639688B2
公开(公告)日：2009-12-29
申请号：US11183381
申请日：2005-07-18
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. 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.
摘要翻译：一种用于保护自治系统网络内有价值资源的方法和系统。系统中的地址前缀被指定为有价值的，并且标志位与网络的路由器的路由表中的地址相关联。识别到边界路由器的接口，并且当在这些接口处接收到分组时，分组被标记为标志或标记位。将接收到的分组的目的地地址与与有价值的资源前缀相关联的标志位进行比较，并且如果分组指向该资源，则分组被丢弃和/或记录，但是分组不被转发到该资源。在特定情况下，来自外部源的接口可以被配置为不创建标志或标记位，其中该分组将被传递到分组的目的地前缀。

9. 发明申请

US20090232031A1 RECEIVER-BASED CONSTRUCTION OF POINT-TO-MULTIPOINT TREES USING PATH COMPUTATION ELEMENTS IN A COMPUTER NETWORK 有权
标题翻译：使用计算机网络中的路径计算元素的基于接收器的点到多点路径的构造
公开(公告)号：US20090232031A1
公开(公告)日：2009-09-17
申请号：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.
摘要翻译：在一个实施例中，检测到向计算机网络的多播组添加叶节点的触发器，并且叶节点可以确定多播组的根节点以请求隧道树和多播的叶节点之间的路径组。响应于具有现有树的多播组，使用计算的路径从根节点接收回复，以将叶节点添加到树的所选节点处的树。然后可以通过所选节点处的计算路径将叶节点添加到多播组隧道树中。

10. 发明申请

US20080123532A1 Dynamic weighted-fair load-balancing 有权
标题翻译：动态加权平衡负载均衡
公开(公告)号：US20080123532A1
公开(公告)日：2008-05-29
申请号：US11604461
申请日：2006-11-27
申请人： David D. Ward , Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
发明人： David D. Ward , Clarence Filsfils , Stefano B. Previdi , Jean-Philippe Vasseur
IPC分类号： G01R31/08
CPC分类号： H04L47/10 , H04L45/125 , H04L47/125
摘要： In one embodiment, a node identifies a plurality of equal cost best paths to a destination, the best paths having one or more associated links. The node receives dynamic link utilization information for the associated links, and determines an amount of traffic to the destination to forward over each of the equal cost best paths, the amount being dynamically dependent upon the dynamic link utilization of the associated links for each equal cost best path.
摘要翻译：在一个实施例中，节点识别到目的地的多个相等成本最佳路径，最佳路径具有一个或多个相关联的链路。节点接收相关联链路的动态链路利用信息，并且确定到目的地的业务量，以在每个相等成本最佳路径上转发，该数量动态地依赖于每个相等成本的相关链路的动态链路利用率最佳路径

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式