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

51. 发明申请

US20120117208A1 Dynamic Address Assignment for Address Aggregation in Low Power and Lossy Networks 有权
标题翻译：低功耗和有损网络中地址聚合的动态地址分配
公开(公告)号：US20120117208A1
公开(公告)日：2012-05-10
申请号：US12942979
申请日：2010-11-09
申请人： Shmuel Shaffer , Pascal Thubert , Patrick Wetterwald , Jean-Philippe Vasseur
发明人： Shmuel Shaffer , Pascal Thubert , Patrick Wetterwald , Jean-Philippe Vasseur
IPC分类号： G06F15/177
CPC分类号： H04L41/0816 , H04L29/12254 , H04L29/12273 , H04L29/12933 , H04L41/085 , H04L61/2038 , H04L61/2053 , H04L61/6068 , H04W8/26 , H04W40/248 , Y02D70/142 , Y02D70/144 , Y02D70/22 , Y04S40/162
摘要： A node in a Low power and Lossy Network (LLN) is managed by monitoring a routing configuration on a node in a LLN. A triggering parameter that is used to invoke an address change on a child node is tracked and a threshold against which to compare the triggering parameter is accessed. The triggering parameter is compared to the threshold. Based on results of comparing the triggering parameter to the threshold, it is determined that an address change at the child node is appropriate. An address change of a child node appearing in the routing configuration is invoked based on the determination that an address change is appropriate.
摘要翻译：低功耗和有损网络（LLN）中的节点通过监视LLN中节点上的路由配置进行管理。跟踪用于调用子节点上的地址更改的触发参数，并访问与之对比的触发参数的阈值。将触发参数与阈值进行比较。基于将触发参数与阈值进行比较的结果，确定子节点处的地址变化是适当的。基于地址改变的确定，调用出现在路由配置中的子节点的地址变化。

52. 发明申请

US20120113986A1 SYSTEM AND METHOD FOR MANAGING ACKNOWLEDGEMENT MESSAGES IN A VERY LARGE COMPUTER NETWORK 有权
标题翻译：用于在非常大的计算机网络中管理确认消息的系统和方法
公开(公告)号：US20120113986A1
公开(公告)日：2012-05-10
申请号：US12942985
申请日：2010-11-09
申请人： Shmuel SHAFFER , Jean-Philippe Vasseur , Sandeep Jay Shetty
发明人： Shmuel SHAFFER , Jean-Philippe Vasseur , Sandeep Jay Shetty
IPC分类号： H04L12/56
CPC分类号： H04L12/1868 , H04L1/1854 , H04L2001/0093
摘要： A multicast message may be distributed by receiving, at a first node in a multicast network, a multicast message from a parent node of the first node. The multicast message is transmitted to child nodes of the first node in the multicast network. A population of the child nodes to which the multicast message was transmitted is accessed and acknowledgement messages which reveal child nodes that are among an acknowledging subset of less than all of the child nodes of the first node are received. Child nodes revealed by the received acknowledgement messages are compared with child nodes determined to be among the population of child nodes to which the multicast message is expected to be received. Based on results of the comparison, a compressed non-acknowledging subset is identified and transmitted to the parent node.
摘要翻译：可以通过在多播网络中的第一节点处从第一节点的父节点接收多播消息来分发多播消息。组播消息被发送到组播网络中第一个节点的子节点。访问发送多播消息的子节点的群体，并且接收到揭示小于第一节点的所有子节点的确认子集之中的子节点的确认消息。将接收到的确认消息所揭示的子节点与确定为预期要接收多播消息的子节点的群体中的子节点进行比较。基于比较的结果，识别压缩的非确认子集并将其发送到父节点。

53. 发明申请

US20120113863A1 Dynamic Wake-up Time Adjustment Based on Designated Paths Through a Computer Network 有权
标题翻译：基于通过计算机网络指定路径的动态唤醒时间调整
公开(公告)号：US20120113863A1
公开(公告)日：2012-05-10
申请号：US12942962
申请日：2010-11-09
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Jay Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Jay Shetty
IPC分类号： H04L12/28
CPC分类号： H04W84/18 , H04L12/12 , H04L29/06993 , H04L29/08027 , H04L29/08306 , H04L67/104 , H04W40/005 , H04W40/10 , H04W40/22 , Y02D70/142 , Y02D70/144 , Y02D70/22 , Y02D70/326 , Y02D70/39
摘要： In one embodiment, a computer network may include nodes and at least one root node. A first subset of the nodes may be located along a designated path (a directed acyclic graph (DAG)) through the computer network to the root node, where the first subset of nodes is configured to operate according to a first wake-up timer. A second subset of the nodes that are not along the designated path are in communication to at least one node of the first subset of nodes along the designated path, and operate according to a second wake-up timer that is longer than the first wake-up timer. In this manner, second subset of nodes may be awake less often, e.g., conserving energy.
摘要翻译：在一个实施例中，计算机网络可以包括节点和至少一个根节点。节点的第一子集可以沿着指定路径（有向非循环图（DAG））通过计算机网络定位到根节点，其中第一子节点被配置为根据第一唤醒定时器来操作。不沿着指定路径的节点的第二子集与沿着指定路径的第一节点子集的至少一个节点通信，并且根据比第一唤醒定时器长的第二唤醒定时器进行操作， up定时器。以这种方式，节点的第二子集可以较少地唤醒，例如节约能量。

54. 发明授权

US08155000B2 Technique for enabling traffic engineering on CE-CE paths across a provider network 有权
标题翻译：通过供应商网络在CE-CE路径上实现流量工程的技术
公开(公告)号：US08155000B2
公开(公告)日：2012-04-10
申请号：US12770391
申请日：2010-04-29
申请人： Jean-Philippe Vasseur
发明人： Jean-Philippe Vasseur
IPC分类号： H04J1/16
CPC分类号： H04L45/50 , H04L45/02
摘要： In one embodiment, Traffic Engineering (TE) is configured on a provider edge device to customer edge device (PE-CE) link extending from a provider edge device (PE) in a provider network to a customer edge device (CE) in a customer network. TE information regarding the TE-configured PE-CE link is conveyed from the PE to one or more other nodes in the provider network. TE information regarding one or more other TE-configured PE-CE links is received from one or more other nodes. A TE database (TED) is expanded to include information for the one or more other TE-configured PE-CE links. TE is applied to a customer edge device to customer edge device (CE-CE) path using at least some of the information for the one or more other TE-configured PE-CE links included in the TED.
摘要翻译：在一个实施例中，在提供商边缘设备上将流量工程（TE）配置到从提供商网络中的提供商边缘设备（PE）到客户边缘设备（CE）的客户边缘设备（PE-CE）链路网络。关于TE配置的PE-CE链路的TE信息从PE传送到提供商网络中的一个或多个其他节点。从一个或多个其他节点接收关于一个或多个其它TE配置的PE-CE链路的TE信息。 TE数据库（TED）扩展为包括一个或多个其他TE配置的PE-CE链路的信息。使用TED中包含的一个或多个其他TE配置的PE-CE链路的信息中的至少一些信息，将TE应用于客户边缘设备到客户边缘设备（CE-CE）路径。

55. 发明授权

US08131873B2 Technique for selecting a path computation element 有权
标题翻译：选择路径计算元素的技术
公开(公告)号：US08131873B2
公开(公告)日：2012-03-06
申请号：US10983280
申请日：2004-11-05
申请人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. 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）来服务路径计算请求。

56. 发明授权

US08116227B1 Optimal automated exploration of hierarchical multiprotocol label switching label switch paths 有权
标题翻译：分层多协议标签交换标签交换路径的最佳自动化探索
公开(公告)号：US08116227B1
公开(公告)日：2012-02-14
申请号：US11642473
申请日：2006-12-20
申请人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
发明人： Danny Prairie , Yufei Shi , George Swallow , Thomas D. Nadeau , Vanson Lim , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/50 , H04L45/24
摘要： Optimal automated exploration of hierarchical MPLS LSPs is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received. These steps are then repeated. For each successive PVM transmitted, the TTL field associated with a label corresponding to the current hierarchy layer is incremented. For any reply message including information describing a non-current layer, modify the next PVM's label stack and increment the TTL field of the label for the described different layer; any other TTL fields are unchanged. If any received reply message indicates a destination router was reached, the process terminates.
摘要翻译：公开了分层MPLS LSP的最佳自动化探索。从初始路由器发送路径验证消息（PVM）。 PVM标签堆栈中的每个标签对应于层次结构层，并与生存时间（TTL）字段相关联。当前层的标签的TTL字段设置为使PVM从初始路由器传播一跳。作为响应，接收到指示PVM到达其目的地的应答消息。然后重复这些步骤。对于发送的每个连续的PVM，与当前层级层相对应的标签相关联的TTL字段递增。对于包含描述非当前层的信息的任何回复消息，修改下一个PVM的标签栈，并增加描述的不同层的标签的TTL字段; 任何其他TTL字段都不变。如果任何接收到的回复消息指示到达目的地路由器，则该过程终止。

57. 发明授权

US08072879B2 Technique for determining whether to reestablish fast rerouted primary tunnels based on backup tunnel path quality feedback 有权
标题翻译：基于备份隧道路径质量反馈确定是否重新建立快速重新路由的主隧道的技术
公开(公告)号：US08072879B2
公开(公告)日：2011-12-06
申请号：US11347781
申请日：2006-02-03
申请人： Jean-Philippe Vasseur , Alton Lo , Anna Charny
发明人： Jean-Philippe Vasseur , Alton Lo , Anna Charny
IPC分类号： H04J1/16
CPC分类号： H04L45/28 , H04J3/14 , H04L12/4633 , H04L45/22 , H04L45/50 , H04L45/60
摘要： A technique dynamically determines whether to reestablish a Fast Rerouted primary tunnel based on path quality feedback of a utilized backup tunnel in a computer network. According to the novel technique, a head-end node establishes a primary tunnel to a destination, and a point of local repair (PLR) node along the primary tunnel establishes a backup tunnel around one or more protected network elements of the primary tunnel, e.g., for Fast Reroute protection. Once one of the protected network elements fail, the PLR node “Fast Reroutes,” i.e., diverts, the traffic received on the primary tunnel onto the backup tunnel, and sends notification of backup tunnel path quality (e.g., with one or more metrics) to the head-end node. The head-end node then analyzes the path quality metrics of the backup tunnel to determine whether to utilize the backup tunnel or reestablish a new primary tunnel.
摘要翻译：一种技术基于计算机网络中利用的备用隧道的路径质量反馈来动态地确定是否重新建立快速重新路由的主隧道。根据新技术，头端节点建立到目的地的主要隧道，沿主隧道的本地修复（PLR）节点建立围绕主隧道的一个或多个受保护网元的备用隧道，例如，用于快速重路由保护。一旦受保护的网络元件发生故障，PLR节点“快速重路由”（即将主隧道上接收到的流量转移到备份隧道上），并发送备份隧道路径质量的通知（例如，使用一个或多个度量）到头端节点。然后，头端节点分析备份隧道的路径质量度量，以确定是否利用备份隧道或重新建立新的主隧道。

58. 发明授权

US08068411B2 Method and apparatus to compute local repair paths taking into account link resources and attributes 有权
标题翻译：考虑链路资源和属性来计算局部修复路径的方法和装置
公开(公告)号：US08068411B2
公开(公告)日：2011-11-29
申请号：US11025179
申请日：2004-12-29
申请人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward
发明人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward
IPC分类号： H04J1/16 , H04L1/00
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.
摘要翻译：一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。在运行中，中间节点监视一组本地链路和/或节点参数。该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。

59. 发明授权

US08040797B2 Sliced tunnels in a computer network 有权
标题翻译：计算机网络中的切片隧道
公开(公告)号：US08040797B2
公开(公告)日：2011-10-18
申请号：US11680286
申请日：2007-02-28
申请人： Jean-Philippe Vasseur , Jeff Apcar
发明人： Jean-Philippe Vasseur , Jeff Apcar
IPC分类号： H04J1/16
CPC分类号： H04L12/4633 , H04L45/00 , H04L45/50 , H04L2212/00
摘要： In one embodiment, a sliced tunnel is signaled between a head-end node and a tail-end node. One or more fork nodes along the sliced tunnel are configured to furcate the sliced tunnel into a plurality of child tunnels of the sliced tunnel. Also, one or more merge nodes along the sliced tunnel are configured to merge a plurality of child tunnels of the sliced tunnel that intersect at the merge node.
摘要翻译：在一个实施例中，在头端节点和尾端节点之间用信号通知切片隧道。沿着切片隧道的一个或多个叉节点被配置为将切片的隧道分割成切片隧道的多个子隧道。此外，沿着切片隧道的一个或多个合并节点被配置为合并在合并节点处相交的分片隧道的多个子隧道。

60. 发明申请

US20110228788A1 ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING 有权
标题翻译：方向图（DAG）路由的替代下行方式
公开(公告)号：US20110228788A1
公开(公告)日：2011-09-22
申请号：US12727893
申请日：2010-03-19
申请人： Pascal Thubert , Patrick Wetterwald , Jean-Philippe Vasseur
发明人： Pascal Thubert , Patrick Wetterwald , Jean-Philippe Vasseur
IPC分类号： H04L12/56
CPC分类号： H04L41/12 , H04L45/02 , H04L45/48 , Y04S40/164
摘要： In one embodiment, a node “N” within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node “P” within the DAG, and, where P is not a DAG root, may determine a grandparent node “GP” as a parent node to the parent node P. The node N may then also select an alternate parent node “P′” that has connectivity to GP and N. N may then inform P and P′ about prefixes reachable via N, and also about P′ as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P′ as an alternate parent node to P to reach the prefixes reachable via N, and P′ may be configured to store the prefixes reachable via N without informing other nodes about those prefixes.
摘要翻译：在一个实施例中，利用有向非循环图（DAG）路由的计算机网络内的节点“N”选择DAG内的父节点“P”，并且其中P不是DAG根，可以确定祖父节点“GP” 作为到父节点P的父节点。节点N然后还可以选择具有与GP和N的连接性的替代父节点“P”.N然后可以通知P和P'关于经由N可达的前缀，并且还关于 P'作为到P的替代父节点以到达可通过N到达的前缀。此外，在一个实施例中，P可以被配置为向GP通知关于可以经由N到达的前缀以及关于P'作为到P的替代父节点可通过N和P'到达的前缀可被配置为存储可通过N到达的前缀，而不通知其他节点关于这些前缀。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式