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

21. 发明申请

US20060176820A1 Inter-domain optimization trigger in PCE-based environment 有权
标题翻译：基于PCE的环境中的域间优化触发
公开(公告)号：US20060176820A1
公开(公告)日：2006-08-10
申请号：US11052280
申请日：2005-02-07
申请人： Jean-Philippe Vasseur , David Ward , Muthurajah Sivabalan , Stefano Previdi
发明人： Jean-Philippe Vasseur , David Ward , Muthurajah Sivabalan , Stefano Previdi
IPC分类号： H04J3/22 , H04L12/28 , H04L12/26 , H04J1/16 , H04J3/16
CPC分类号： H04L45/42 , H04L45/02 , H04L45/04 , H04L45/32 , H04L45/50
摘要： A technique triggers optimization of a traffic engineering (TE) label switched path (LSP) that 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. The technique is based on the detection of an event in the remote domain (“event domain”) that could create a more optimal TE-LSP, such as, e.g., restoration of a network element or increased available bandwidth. Specifically, a path computation element (PCE) in the event domain learns of the event and notifies other PCEs of the event through an event notification. These PCEs then flood an event notification to label switched routers (LSRs) in their respective domain. Upon receiving the notification, if an LSR has one or more TE-LSPs (or pending TE-LSPs), it responds to the PCE with an optimization request for the TE-LSPs. The PCE determines whether a particular TE-LSP may benefit from optimization based on the event domain (i.e., whether the TE-LSP uses the event domain), and processes the request accordingly.
摘要翻译：一种技术触发跨越计算机网络的多个域从本地域的头端节点到远程域的尾端节点的流量工程（TE）标签交换路径（LSP）的优化。该技术基于对远程域（“事件域”）中的事件的检测，其可以创建更优化的TE-LSP，例如网络元件的恢复或增加的可用带宽。具体地，事件域中的路径计算元素（PCE）学习事件并通过事件通知通知其他PCE事件。然后，这些PCE将事件通知泛滥到其各自域中的标签交换路由器（LSR）。在收到通知后，如果LSR有一个或多个TE-LSP（或待处理的TE-LSP），则对该TEE的优先请求响应PCE。 PCE确定特定TE-LSP是否可以从基于事件域的优化（即，TE-LSP是否使用事件域）获益，并且相应地处理该请求。

22. 发明申请

US20060171331A1 System and methods for network path detection 有权
标题翻译：网络路径检测的系统和方法
公开(公告)号：US20060171331A1
公开(公告)日：2006-08-03
申请号：US11048077
申请日：2005-02-01
申请人： Stefano Previdi , James Guichard , Jean-Philippe Vasseur , David Ward
发明人： Stefano Previdi , James Guichard , Jean-Philippe Vasseur , David Ward
IPC分类号： H04L12/56 , H04L12/28
CPC分类号： H04L45/026 , H04L43/0811 , H04L45/26 , H04L45/28 , H04L63/0272
摘要： Customer edge (CE) to CE device verification checks initiate routes from available CEs as a set of path verification messages, destined for remote CE routes serving a remote VPN. An extended community attribute, included among the attributes of the path verification message, stores the identity of the originating CE router. The path verification message propagates across the network, and transports the identity of the originating CE router because the originator identity is not overwritten by successive routing. Upon receipt by the remote CE, the originator is determinable from the extended community attribute. A further reachability field is also included in the extended community attribute and indicates whether per CE or per prefix is appropriate for the particular route in question. In this manner, CE-CE connectivity checks identify CEs which are reachable from other CEs. Accordingly, such a mechanism allows for route reachability aggregation on a per-CE or per-prefix reachability basis.
摘要翻译：客户端（CE）到CE设备验证检查从可用的CE启动路由作为一组路径验证消息，目的地是服务于远程VPN的远程CE路由。包含在路径验证消息的属性之间的扩展团体属性存储始发CE路由器的身份。路径验证消息通过网络传播，并传输始发CE路由器的身份，因为始发方身份不会被连续路由覆盖。远程CE收到后，发起者可以从扩展团体属性中确定。扩展社区属性中还包括另外的可访问性字段，并指示每个CE或每个前缀是否适合所讨论的特定路由。以这种方式，CE-CE连接检查可以识别可从其他CE接入的CE。因此，这种机制允许基于每个CE或每个前缀可达性的路由可达性聚合。

23. 发明申请

US20060165013A1 Method and apparatus for identifying an egress point to a network location 有权
标题翻译：用于识别到网络位置的出口点的方法和装置
公开(公告)号：US20060165013A1
公开(公告)日：2006-07-27
申请号：US11045015
申请日：2005-01-26
申请人： Stefano Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
发明人： Stefano Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
IPC分类号： H04L12/28
CPC分类号： H04L45/02
摘要： A method of identifying an egress point to a network location in a data communications network comprising a plurality of nodes and links there between comprises the step, performed at the identifying node, of receiving a notification through the network advertising an adjacency to a network location. The method further comprises the steps, performed at the identifying node, of deriving from the notification adjacency information and identifying, from the adjacency information, the egress point.
摘要翻译：一种识别包括在其中的多个节点和链路的数据通信网络中的网络位置的出口点的方法包括：在识别节点执行的步骤，通过网络接收通知与网络位置相邻的通知。所述方法还包括在所述识别节点处执行的从所述通知邻接信息导出并从所述邻接信息识别所述出口点的步骤。

24. 发明申请

US20060153200A1 Automatic prioritization of BGP next-hop in IGP 有权
标题翻译：在IGP中自动优先化BGP下一跳
公开(公告)号：US20060153200A1
公开(公告)日：2006-07-13
申请号：US11025251
申请日：2004-12-29
申请人： Clarence Filsfils , Stefano Previdi , Jean-Philippe Vasseur
发明人： Clarence Filsfils , Stefano Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/56
CPC分类号： H04L45/02 , H04L45/04 , H04L45/14
摘要： A technique configures an intermediate network node to automatically determine whether a route advertised by a routing protocol is important for fast convergence in a computer network. As used herein, an important route needed for fast convergence is a route advertised by the routing protocol, such as an exterior gateway routing protocol, as a next-hop address, since external connectivity relies on such a route. A routing information base process executing on the node stores the advertised route and, notably, interacts with an interior gateway routing protocol (IGP) process executing on the node to identify the route as an important route. Identification of an important route, in turn, allows IGP to process the route in a high priority fashion, thereby facilitating fast convergence.
摘要翻译：一种技术配置中间网络节点，以自动确定路由协议发布的路由是否对计算机网络中的快速收敛很重要。如本文所使用的，快速收敛所需的重要路线是路由协议（例如外部网关路由协议）作为下一跳地址通告的路由，因为外部连接依赖于这样的路由。在节点上执行的路由信息库过程存储所通告的路由，并且特别地与在节点上执行的内部网关路由协议（IGP）进程进行交互，以将该路由识别为重要路由。识别重要的路由又反过来允许IGP以高优先级的方式处理路由，从而促进快速收敛。

25. 发明申请

US20060114916A1 Inter-domain TE-LSP with IGP extensions 有权
标题翻译：具有IGP扩展的域间TE-LSP
公开(公告)号：US20060114916A1
公开(公告)日：2006-06-01
申请号：US11001459
申请日：2004-12-01
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L12/56 , H04L12/28
CPC分类号： H04L47/825 , H04L45/02 , H04L45/04 , H04L45/28 , H04L45/502 , H04L47/70 , H04L47/724 , H04L47/785
摘要： A technique propagates reachability information for a tail-end node of a traffic engineering (TE) label switched path (LSP) to a head-end node of the TE-LSP in a computer network. The TE-LSP preferably spans multiple domains of the network such that the tail-end node resides in a domain that is different (remote) from the domain of the head-end node. The inter-domain information propagation technique employs an Interior Gateway Protocol (IGP) to transmit the remote reachability information from a target node residing in the same domain as the tail-end node to the head-end node. The head-end node uses the remote information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.
摘要翻译：一种技术将流量工程（TE）标签交换路径（LSP）的尾端节点的可达性信息传播到计算机网络中的TE-LSP的前端节点。 TE-LSP优选地跨越网络的多个域，使得尾端节点驻留在与头端节点的域不同（远程）的域中。域间信息传播技术采用内部网关协议（IGP）来将远程可达性信息从驻留在与尾端节点相同的域中的目标节点传送到头端节点。前端节点使用远程信息来计算从尾端节点可到达其路由表的路由，即地址前缀和相关联的属性。

26. 发明申请

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

27. 发明申请

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.
摘要翻译：一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。在操作中，中间节点监视一组本地链路和/或节点参数。该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。

28. 发明申请

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.

29. 发明申请

US20060092952A1 System and method for reporting out-of-resources (OOR) conditions in a data network 有权
标题翻译：在数据网络中报告资源不足（OOR）条件的系统和方法
公开(公告)号：US20060092952A1
公开(公告)日：2006-05-04
申请号：US10964184
申请日：2004-10-13
申请人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
发明人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
IPC分类号： H04L12/56
CPC分类号： H04L47/125 , H04L41/06 , H04L45/00 , H04L45/50 , H04L47/2408 , H04L47/745
摘要： A system and method for advertising out-of-resources (OOR) conditions for entities, such as nodes, line cards and data links, in a manner that does not involve using a maximum cost to indicate the entity is “out-of-resources.” According to the technique, an OOR condition for an entity is advertised in one or more type-length-value (TLV) objects contained in an advertisement message. The advertisement message is flooded to nodes on a data network to inform them of the entity's OOR condition. Head-end nodes that process the advertisement message may use information contained in the TLV object to determine a path for a new label switched path (LSP) that does not include the entity associated with the OOR condition.
摘要翻译：用于以不涉及使用最大成本来指示实体的方式向诸如节点，线路卡和数据链路的实体（例如节点，线路卡和数据链路）广告外部资源（OOR）条件的系统和方法是“超出资源 “。根据该技术，在广告消息中包含的一个或多个类型长度值（TLV）对象中通告实体的OOR条件。广告消息被洪泛到数据网络上的节点，以通知他们实体的OOR条件。处理广告消息的头端节点可以使用包含在TLV对象中的信息来确定不包括与OOR条件相关联的实体的新标签交换路径（LSP）的路径。

30. 发明授权

US09185022B2 Dynamically triggered traffic engineering routing advertisements in stateful path computation element environments 有权
标题翻译：在状态路径计算元素环境中动态触发流量工程路由广告
公开(公告)号：US09185022B2
公开(公告)日：2015-11-10
申请号：US13524769
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
IPC分类号： H04L12/24 , H04J3/14 , H04L12/759 , H04L12/915 , H04L12/911 , H04L12/721 , H04L12/717
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）监视计算机网络内的隧道建立失败率，并且基于隧道建立失败率来确定是否调整路由信息的准确性。例如，隧道建立故障率高于第一阈值表示需要更高的精度。响应于隧道建立失败率高于第一阈值，设备然后可以指示一个或多个路由器缩短其在计算机网络中的路由更新间隔。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式