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

41. 发明申请

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。

42. 发明申请

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.
摘要翻译：在一个实现中，可以通过访问管理网络中的处理资源的分配的路由协议来管理网络设备的功耗。路由协议可以用于生成可以确定资源利用的第一配置。可以确定第一配置的第一个成本。可以识别第二配置以支持资源的利用。可以针对第二配置确定第二成本。第一个成本可以与第二个成本进行比较。可以评估网络对于第二配置的预期性能。基于比较和评估的结果，可以将网络配置为使用第二配置。可以在非活动网络设备上激活处理资源以支持第二配置，并在第二配置中未使用的活动网络设备上停用。

43. 发明授权

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

44. 发明申请

US20060262772A1 System and methods for providing a network path verification protocol 审中-公开
标题翻译：提供网络路径验证协议的系统和方法
公开(公告)号：US20060262772A1
公开(公告)日：2006-11-23
申请号：US11135253
申请日：2005-05-23
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward , Stefano Previdi
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward , Stefano Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/308 , H04L43/0811 , H04L43/12 , H04L45/04 , H04L45/302 , H04L45/70 , H04L47/24 , H04L63/029
摘要： A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a network path identifies connectivity and transmission characteristic attributes by defining, implementing, and analyzing path verification messages (PVMs) in a VPN environment. Typical VPN environments are characterized by service level agreements (SLAs) between service providers which specify particular service level and/or bandwidth level guarantees, typically in terms of megabits per second (MB/s) or other qualitative transfer criteria. Such guarantees are often expressed in contractual terms as Quality of Service (QoS) criteria. Configurations herein provide a mechanism for determination of paths and/or routes that satisfy a QoS or other delivery speed/bandwidth guarantee. Such a mechanism may therefore be employed to perform routing decisions for QoS based traffic. Further, such a mechanism is employable to verify QoS levels and related attributes related to contractual terms between service providers and customers.
摘要翻译：路径验证协议（PVP），其列举沿着网络路径发送到一组节点或路由器的一系列消息，通过在VPN环境中定义，实现和分析路径验证消息（PVM）来识别连接性和传输特性属性。典型的VPN环境的特征在于服务提供商之间的服务级别协议（SLA），其指定特定服务级别和/或带宽级别保证，通常以兆比特每秒（MB / s）或其他定性传输标准。这种保证通常以合同条款表示为服务质量（QoS）标准。本文中的配置提供了用于确定满足QoS或其他传送速度/带宽保证的路径和/或路由的机制。因此可以采用这种机制来执行基于QoS的业务的路由决策。此外，这种机制可用于验证与服务提供商和客户之间的合同条款相关的QoS等级和相关属性。

45. 发明申请

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.

46. 发明申请

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。

47. 发明申请

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之间的业务负载。

48. 发明申请

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.

49. 发明申请

US20060101142A1 Technique for selecting a path computation element 有权
标题翻译：选择路径计算元素的技术
公开(公告)号：US20060101142A1
公开(公告)日：2006-05-11
申请号：US10983280
申请日：2004-11-05
申请人： Jean-Philippe Vasseur , David Ward , Muthurajah Sivabalan , Stefano Previdi
发明人： Jean-Philippe Vasseur , David Ward , Muthurajah Sivabalan , Stefano Previdi
IPC分类号： G06F15/173
CPC分类号： H04L45/42 , H04L45/04 , H04L45/12 , H04L45/127 , H04L45/44 , H04L45/58
摘要： A technique efficiently selects a Path Computation Element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, using (i) a low-pass filter algorithm to compute such resources, and (ii) threshold determinations to control distribution of those advertisements. To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to a Path Computation Client (PCC) by way of the controlled advertisements. In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
摘要翻译：一种技术有效地选择路径计算元素（PCE）来计算计算机网络的节点之间的路径。 PCE选择技术说明性地基于PCE可用路径计算资源的动态广告，使用（i）低通滤波器算法来计算这样的资源，以及（ii）阈值确定以控制这些广告的分布。为此，新技术使得一个或多个PCE能够通过受控广告动态地向路径计算客户端（PCC）发送（通告）它们的可用路径计算资源。此外，该技术使得PCC能够基于这些可用资源有效地选择PCE（或一组PCE）来服务路径计算请求。

50. 发明申请

US20070091793A1 Method and apparatus for managing forwarding of data in an autonomous system 有权
标题翻译：用于管理自主系统中的数据转发的方法和装置
公开(公告)号：US20070091793A1
公开(公告)日：2007-04-26
申请号：US11254468
申请日：2005-10-20
申请人： Clarence Filsfils , John Scudder , Stefano Previdi
发明人： Clarence Filsfils , John Scudder , Stefano Previdi
IPC分类号： H04J3/14 , H04L12/56
CPC分类号： H04L45/22 , H04L12/4633 , H04L45/04 , H04L45/28 , H04L45/50
摘要： A method of managing forwarding of data in a first autonomous system (AS) is described. The first AS includes a plurality of border routers having inter-domain links to one or more remote AS's and an associated exterior communications protocol. The border routers use an interior communications protocol with other border routers in the first AS using primary tunnels. The method comprises the steps, performed at a first border router having a primary route via an inter-domain link to a remote AS, of constructing an alternate route to the remote AS via second border router in the first AS, instigating a backup tunnel to the second border router upon failure of the primary route and sending a failure message to the other border routers.
摘要翻译：描述了在第一自治系统（AS）中管理数据转发的方法。第一AS包括具有到一个或多个远程AS的域间链接和相关联的外部通信协议的多个边界路由器。边界路由器使用内部通信协议与第一AS中的其他边界路由器使用主隧道。该方法包括以下步骤：在具有通过到远程AS的域间链路的主路由的第一边界路由器上执行的步骤，通过第一AS中的第二边界路由器构建到远程AS的备用路由，将备用隧道引导到主路由器故障时的第二个边界路由器，并向其他边界路由器发送故障消息。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式