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

1. 发明授权

US07747777B2 Optimizing network resources usage within an administrative boundary 有权
标题翻译：优化管理边界内的网络资源使用情况
公开(公告)号：US07747777B2
公开(公告)日：2010-06-29
申请号：US11948799
申请日：2007-11-30
申请人： Stefano Previdi , Robert Raszuk , David Ward , Jean-Phillippe Vasseur
发明人： Stefano Previdi , Robert Raszuk , David Ward , Jean-Phillippe Vasseur
IPC分类号： G06F15/173
CPC分类号： H04L45/18 , H04L45/04
摘要： In one embodiment, an apparatus comprises logic for optimizing network resources usage. The logic is operable to store IGP information, where the IGP information includes a set of attribute values associated with each of a set of content servers. When the logic receives a request for content from a remote peer, the logic determines one or more content servers that can provide the requested content. The logic then retrieves, from the IGP information, a plurality of attribute values associated with a non-looping path from each of the one or more content servers. For each of the one or more content servers, the retrieved attribute values include: one or more capacity values indicating capacities of one or more communication links on the non-looping path from that content server; and one or more utilization values indicating utilizations of the one or more communication links on the non-looping path from that content server. The logic then selects a content server based on the retrieved attribute values, and causes the request for the content to be sent to the selected content server.
摘要翻译：在一个实施例中，一种装置包括用于优化网络资源使用的逻辑。逻辑可操作地存储IGP信息，其中IGP信息包括与一组内容服务器中的每一个相关联的一组属性值。当逻辑从远程对等体接收到对内容的请求时，逻辑确定可以提供所请求的内容的一个或多个内容服务器。然后，逻辑从IGP信息中检索与一个或多个内容服务器中的每一个的非循环路径相关联的多个属性值。对于所述一个或多个内容服务器中的每一个，所检索的属性值包括：指示来自该内容服务器的非循环路径上的一个或多个通信链路的容量的一个或多个容量值; 以及指示来自该内容服务器的非循环路径上的一个或多个通信链路的利用的一个或多个利用率值。然后，该逻辑基于所检索的属性值选择一个内容服务器，并且将该内容的请求发送到所选择的内容服务器。

2. 发明申请

US20090144390A1 OPTIMIZING NETWORK RESOURCES USAGE WITHIN AN ADMINISTRATIVE BOUNDARY 有权
标题翻译：优化网络资源在行政边界内使用
公开(公告)号：US20090144390A1
公开(公告)日：2009-06-04
申请号：US11948799
申请日：2007-11-30
申请人： Stefano Previdi , Robert Raszuk , David Ward , Jean-Phillippe Vasseur
发明人： Stefano Previdi , Robert Raszuk , David Ward , Jean-Phillippe Vasseur
IPC分类号： G06F15/16
CPC分类号： H04L45/18 , H04L45/04
摘要： In one embodiment, an apparatus comprises logic for optimizing network resources usage. The logic is operable to store IGP information, where the IGP information includes a set of attribute values associated with each of a set of content servers. When the logic receives a request for content from a remote peer, the logic determines one or more content servers that can provide the requested content. The logic then retrieves, from the IGP information, a plurality of attribute values associated with a non-looping path from each of the one or more content servers. For each of the one or more content servers, the retrieved attribute values include: one or more capacity values indicating capacities of one or more communication links on the non-looping path from that content server; and one or more utilization values indicating utilizations of the one or more communication links on the non-looping path from that content server. The logic then selects a content server based on the retrieved attribute values, and causes the request for the content to be sent to the selected content server.
摘要翻译：在一个实施例中，一种装置包括用于优化网络资源使用的逻辑。逻辑可操作地存储IGP信息，其中IGP信息包括与一组内容服务器中的每一个相关联的一组属性值。当逻辑从远程对等体接收到对内容的请求时，逻辑确定可以提供所请求的内容的一个或多个内容服务器。然后，逻辑从IGP信息中检索与一个或多个内容服务器中的每一个的非循环路径相关联的多个属性值。对于所述一个或多个内容服务器中的每一个，所检索的属性值包括：指示来自该内容服务器的非循环路径上的一个或多个通信链路的容量的一个或多个容量值; 以及指示来自该内容服务器的非循环路径上的一个或多个通信链路的利用的一个或多个利用率值。然后，该逻辑基于所检索的属性值选择一个内容服务器，并且将该内容的请求发送到所选择的内容服务器。

3. 发明申请

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路由反射器系统将路由反射服务器软件分发到专用控制板，使得处理路由反射功能不会影响转发表的汇聚转发或协议实例。

4. 发明申请

US20060193248A1 Loop prevention technique for MPLS using service labels 有权
标题翻译：使用服务标签的MPLS环路防护技术
公开(公告)号：US20060193248A1
公开(公告)日：2006-08-31
申请号：US11068081
申请日：2005-02-28
申请人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
发明人： Clarence Filsfils , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Jim Guichard , Robert Raszuk
IPC分类号： H04J3/14 , H04L12/56 , H04J1/16 , H04L12/28
CPC分类号： H04L45/18 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50
摘要： A local fast reroute (FRR) technique is implemented at the edge of a computer network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. The backup edge device identifies protected data packets as those which contain a predetermined “service” label in their MPLS label stacks. In other words, the service label is used as an identifier for packets that have been FRR rerouted. Upon receiving a data packet containing a service label, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.
摘要翻译：本地快速重路由（FRR）技术在计算机网络的边缘实现。根据该技术，如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障，则边缘设备将至少一些寻址到该域的数据分组重新路由到备用边缘设备，将数据包转发到相邻域。重新路由的数据包在被转发到备份边缘设备之前被指定为“保护”（即重新路由）数据分组。备份边缘设备将受保护的数据包标识为在其MPLS标签堆栈中包含预定“服务”标签的数据包。换句话说，服务标签被用作已被FRR重新路由的数据包的标识符。在接收到包含服务标签的数据分组时，不允许备份边缘设备第二次重新路由该分组，例如响应于另一个域间节点或链路故障，从而防止在网络边缘发展的环路。

5. 发明申请

US20080225852A1 Methods and apparatus providing two stage tunneling 有权
标题翻译：提供两级隧道的方法和装置
公开(公告)号：US20080225852A1
公开(公告)日：2008-09-18
申请号：US11725157
申请日：2007-03-15
申请人： Robert Raszuk , Stefano Previdi , Jean-Philippe Vasseur
发明人： Robert Raszuk , Stefano Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/56
CPC分类号： H04L45/50 , H04L12/4633 , H04L45/04
摘要： A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.
摘要翻译：系统在第一节点处接收分组。数据包将发往第二个节点。该系统从多个网络设备中识别完整的路由节点。完整路由节点能够为多个网络设备内的每个节点提供路由信息。多个网络设备包括节点的子集，以及完整路由节点的子集。节点的子集不能为多个网络设备内的每个节点提供路由信息。系统将数据包发送到完整路由节点，以便将来传输到第二个节点。

6. 发明申请

US20060164975A1 Loop prevention technique for MPLS using two labels 有权
公开(公告)号：US20060164975A1
公开(公告)日：2006-07-27
申请号：US11046163
申请日：2005-01-26
申请人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
发明人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
IPC分类号： H04L12/28 , G08C15/00
CPC分类号： H04L45/00 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/50 , H04W12/02
摘要： A fast reroute (FRR) technique is implemented at the edge of a network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. To differentiate which data packets are protected and which are not, the backup edge device employs different sets of VPN label values for protected and non-protected network traffic. That is, the backup edge device may allocate two different VPN label values for at least some destination address prefixes that are reachable through the neighboring domain: a first VPN label value for FRR protected traffic and a second VPN label value for non-protected traffic. Upon receiving a data packet containing a protected VPN label value, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.

7. 发明授权

US08077721B2 Methods and apparatus providing two stage tunneling 有权
标题翻译：提供两级隧道的方法和装置
公开(公告)号：US08077721B2
公开(公告)日：2011-12-13
申请号：US11725157
申请日：2007-03-15
申请人： Robert Raszuk , Stefano Previdi , Jean-Philippe Vasseur
发明人： Robert Raszuk , Stefano Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28
CPC分类号： H04L45/50 , H04L12/4633 , H04L45/04
摘要： A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.
摘要翻译：系统在第一节点处接收分组。数据包将发往第二个节点。该系统从多个网络设备中识别完整的路由节点。完整路由节点能够为多个网络设备内的每个节点提供路由信息。多个网络设备包括节点的子集，以及完整路由节点的子集。节点的子集不能为多个网络设备内的每个节点提供路由信息。系统将数据包发送到完整路由节点，以便将来传输到第二个节点。

8. 发明申请

US20060209719A1 System and method for routing ISIS traffic through unidirectional links of a computer network 有权
公开(公告)号：US20060209719A1
公开(公告)日：2006-09-21
申请号：US11084387
申请日：2005-03-18
申请人： Stefano Previdi , David Ward , Jonathan Barth , John Harper , Ian Shand
发明人： Stefano Previdi , David Ward , Jonathan Barth , John Harper , Ian Shand
IPC分类号： H04L12/28
CPC分类号： H04L45/22 , H04L12/4633 , H04L45/00 , H04L45/02 , H04L45/026 , H04L2212/00
摘要： A system and method routes data traffic over a unidirectional link of a computer network configured to implement a routing protocol, such as the ISIS routing protocol. To that end, the invention extends the ISIS routing protocol to allow dynamic discovery of neighboring routers (i.e., neighbors) that are connected via the unidirectional link and subsequent establishment of an adjacency between the neighbors over the link. Adjacency establishment is illustratively effected through the use of novel type/length/value (TLV) encoded formats appended to ISIS Hello packets to convey information between the neighbors.

9. 发明申请

US20060140111A1 Method and apparatus to compute local repair paths taking into account link resources and attributes 有权
标题翻译：考虑链路资源和属性来计算局部修复路径的方法和装置
公开(公告)号：US20060140111A1
公开(公告)日：2006-06-29
申请号：US11025179
申请日：2004-12-29
申请人： Jean-Philippe Vasseur , Stefano Previdi , David Ward
发明人： Jean-Philippe Vasseur , Stefano Previdi , David Ward
IPC分类号： H04L12/26 , H04J1/16 , H04J3/14 , H04L12/56 , H04L12/28
CPC分类号： H04L45/28 , H04J3/14 , H04L45/02
摘要： A technique for calculating local repair paths through a computer network using one or more dynamically measured parameters in place of, or in addition to, statically assigned cost metrics. The dynamically measured parameters include various statistical measures of resources and attributes associated with data links and/or network nodes in the computer network. In operation, an intermediate node monitors a set of local link and/or node parameters. The node may generate an advertisement in response to at least one of its monitored parameters crossing a predetermined threshold value or changing value by a predetermined percentage or amount. The advertisement is “flooded” so as to advertise the dynamically measured parameter value to other neighboring intermediate nodes. After receiving the advertisement, each node may recalculate one or more local repair paths based on the advertised parameter value. The node may utilize a recalculated repair path if it provides an appreciably lower-cost path, e.g., by a predetermined percentage, as compared with the currently deployed repair path.
摘要翻译：一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。在操作中，中间节点监视一组本地链路和/或节点参数。该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。

10. 发明申请

US20060126495A1 System and methods for detecting network failure 有权
公开(公告)号：US20060126495A1
公开(公告)日：2006-06-15
申请号：US11001149
申请日：2004-12-01
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , Clarence Filsfils , David Ward , Stefano Previdi
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , Clarence Filsfils , David Ward , Stefano Previdi
IPC分类号： H04J1/16
CPC分类号： H04L45/22 , H04L41/0677 , H04L43/50 , H04L45/02 , H04L45/28
摘要： A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a suspected path identifies forwarding plane problems for effecting changes at the control plane level. The messages include a command requesting interrogation of a further remote node for obtaining information about the path between the node receiving the PVP message and the further remote node. The node receiving the PVP message replies with a command response indicative of the outcome of attempts to reach the further remote node. The series of messages collectively covers a set of important routing points along a path from the originator to the recipient. The aggregate command responses to the series of PVP messages is analyzed to identify not only whether the entire path is operational, but also the location and nature of the problem.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式