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

41. 发明授权

US08799510B2 Managing host routes for local computer networks with a plurality of field area routers 有权
标题翻译：管理具有多个场地路由器的本地计算机网络的主机路由
公开(公告)号：US08799510B2
公开(公告)日：2014-08-05
申请号：US13176301
申请日：2011-07-05
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
IPC分类号： G06F15/173
CPC分类号： H04L45/22 , H04L45/64
摘要： In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network.
摘要翻译：在一个实施例中，具有多个FAR的本地计算机网络（例如，网状网络）中的特定场区域路由器（FAR）将分配给本地计算机网络的公共子网前缀通告给全局计算机网络。本地计算机网络的多个FAR中的每一个被配置为接受去往本地计算机网络的任何流量，并且在多个FAR之间建立隧道覆盖。一旦在特定的FAR上收到一个目的地是本地计算机网络中的特定设备的分组，并且响应于特定的FAR没有到该特定设备的主机路由，它将隧道覆盖上的分组转发到多个本地计算机网络的FAR。

42. 发明申请

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）监视计算机网络内的隧道建立失败率，并且基于隧道建立失败率来确定是否调整路由信息的准确性。例如，隧道建立故障率高于第一阈值表示需要更高的精度。响应于隧道建立失败率高于第一阈值，设备然后可以指示一个或多个路由器缩短其在计算机网络中的路由更新间隔。

43. 发明申请

US20130336103A1 INTER-DOMAIN SIGNALING TO UPDATE REMOTE PATH COMPUTATION ELEMENTS AFTER A CALL SET-UP FAILURE 有权
标题翻译：呼叫建立失败后的域内信号更新远程路径计算元素
公开(公告)号：US20130336103A1
公开(公告)日：2013-12-19
申请号：US13524168
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L29/14 , H04L12/26 , H04L12/24
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。

44. 发明申请

US20120233473A1 Power Management in Networks 审中-公开
标题翻译：网络中的电源管理
公开(公告)号：US20120233473A1
公开(公告)日：2012-09-13
申请号：US13043169
申请日：2011-03-08
申请人： Jean-Philippe Vasseur , Yegnanarayanan Chandramouli , Stefano Previdi , Aravind Sitaraman
发明人： Jean-Philippe Vasseur , Yegnanarayanan Chandramouli , Stefano Previdi , Aravind Sitaraman
IPC分类号： G06F1/00 , G06F15/173
CPC分类号： G06F1/3206 , G06Q10/06 , G06Q50/06
摘要： In one implementation, the power consumption by network devices may be managed by accessing a routing protocol that manages an allocation of processing resources in a network. The routing protocol may be used for generating a first configuration, for which a utilization of resources may be determined. A first cost for the first configuration may be determined. A second configuration may be identified to support the utilization of the resources. A second cost may be determined for the second configuration. The first cost may be compared to the second cost. The prospective performance of the network for the second configuration may be assessed. Based on the results of the comparison and the assessment, the network may be configured to use the second configuration. Processing resources may be activated on inactive network devices to support the second configuration and deactivated on active network devices that are not utilized in the second configuration.
摘要翻译：在一个实现中，可以通过访问管理网络中的处理资源的分配的路由协议来管理网络设备的功耗。路由协议可以用于生成可以确定资源利用的第一配置。可以确定第一配置的第一个成本。可以识别第二配置以支持资源的利用。可以针对第二配置确定第二成本。第一个成本可以与第二个成本进行比较。可以评估网络对于第二配置的预期性能。基于比较和评估的结果，可以将网络配置为使用第二配置。可以在非活动网络设备上激活处理资源以支持第二配置，并在第二配置中未使用的活动网络设备上停用。

45. 发明授权

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.
摘要翻译：系统在第一节点处接收分组。数据包将发往第二个节点。该系统从多个网络设备中识别完整的路由节点。完整路由节点能够为多个网络设备内的每个节点提供路由信息。多个网络设备包括节点的子集，以及完整路由节点的子集。节点的子集不能为多个网络设备内的每个节点提供路由信息。系统将数据包发送到完整路由节点，以便将来传输到第二个节点。

46. 发明申请

US20060209716A1 Dynamic retrieval of routing information for inter-AS TE-LSPs 有权
公开(公告)号：US20060209716A1
公开(公告)日：2006-09-21
申请号：US11081097
申请日：2005-03-15
申请人： Stefano Previdi , Jean-Philippe Vasseur
发明人： Stefano Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L47/825 , H04L45/02 , H04L45/04 , H04L45/50 , H04L47/15 , H04L47/70 , H04L47/724 , H04L47/785
摘要： A technique dynamically triggers an exchange of reachability information between a tail-end (remote) domain target node (e.g., a tail-end node) of a traffic engineering (TE) label switched path (LSP) and a local domain head-end node of the TE-LSP in a computer network. The inter-domain information retrieval technique is illustratively based on triggering a Border Gateway Protocol (BGP) session whereby at least a portion of the reachability, i.e., routing, information of the tail-end node is transmitted to the head-end node of the TE-LSP in accordance with BGP. Specifically, once a TE-LSP is established between the head-end node and the tail-end node, the head-end node triggers the tail-end node, e.g., through extensions to a request/response signaling exchange, to establish the BGP session. Establishment of the BGP session enables transmission of the routing information from the tail-end node to the head-end node. The head-end node uses the routing information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.

47. 发明申请

US20060200579A1 Computation of a shortest inter-domain TE-LSP across a set of autonomous systems 有权
标题翻译：跨一组自治系统的最短域间TE-LSP的计算
公开(公告)号：US20060200579A1
公开(公告)日：2006-09-07
申请号：US11073348
申请日：2005-03-04
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano 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。

48. 发明申请

US20060120288A1 Inter-domain TE-LSP selection 有权
标题翻译：域间TE-LSP选择
公开(公告)号：US20060120288A1
公开(公告)日：2006-06-08
申请号：US11001784
申请日：2004-12-02
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04J1/16 , H04L12/56
CPC分类号： H04L47/10 , H04L45/04 , H04L45/24 , H04L45/50 , H04L47/125
摘要： A technique selects a traffic engineering (TE) label switched path (LSP) from among a plurality of TE-LSPs, each of which spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain, in order to reach one or more address prefixes within the remote domain. The inter-domain TE-LSP selection technique comprises a selection algorithm executed by the head-end node and based on predetermined TE-LSP attributes (e.g., bandwidth, cost, etc.) and/or address prefix reachability attributes (e.g., cost from a tail-end node to the prefix) to select an appropriate inter-domain TE-LSP for the reachable address prefix. The selection algorithm is embodied in one of two modes: (i) a hierarchical selection mode, or (ii) a weighted selection mode. In addition, the technique comprises a load balancing aspect that cooperates with the selection algorithm to enable the head-end node to balance traffic loads among the multiple TE-LSPs based on the results of the selection algorithm.
摘要翻译：一种技术从多个TE-LSP中选择流量工程（TE）标签交换路径（LSP），每个TE-LSP跨越从本地域的头端节点到终端节点的计算机网络的多个域的远程域，以便达到远程域内的一个或多个地址前缀。域间TE-LSP选择技术包括由前端节点执行并基于预定的TE-LSP属性（例如，带宽，成本等）和/或地址前缀可达性属性（例如，来自到前缀的尾端节点）为可达地址前缀选择适当的域间TE-LSP。选择算法以两种模式之一体现：（i）分层选择模式，或（ii）加权选择模式。此外，该技术包括与选择算法配合的负载平衡方面，以使头端节点能够基于选择算法的结果来平衡多个TE-LSP之间的业务负载。

49. 发明申请

US20060117110A1 Propagation of routing information in RSVP-TE for inter-domain TE-LSPs 有权
公开(公告)号：US20060117110A1
公开(公告)日：2006-06-01
申请号：US11001349
申请日：2004-12-01
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： G06F15/16
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.

50. 发明授权

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信息中检索与一个或多个内容服务器中的每一个的非循环路径相关联的多个属性值。对于所述一个或多个内容服务器中的每一个，所检索的属性值包括：指示来自该内容服务器的非循环路径上的一个或多个通信链路的容量的一个或多个容量值; 以及指示来自该内容服务器的非循环路径上的一个或多个通信链路的利用的一个或多个利用率值。然后，该逻辑基于所检索的属性值选择一个内容服务器，并且将该内容的请求发送到所选择的内容服务器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式