会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 52. 发明授权
    • Dynamic routing metric adjustment
    • 动态路由度量调整
    • US08787392B2
    • 2014-07-22
    • US12971094
    • 2010-12-17
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • H04L12/28H04L12/54H04W40/24
    • H04L12/56H04L45/028H04W40/248
    • In one embodiment, one or more routing update parameters may be set for and propagated to nodes of a directed acyclic graph (DAG) in a computer network, the routing update parameters indicative of when to perform a corresponding routing update operation. A decision node (e.g., a root node of the DAG, application in a head-end, etc.) may gather network statistics of the DAG during operation based on the routing update parameters, and may accordingly determine at least one adjusted routing update parameter based on the gathered network statistics. This adjusted routing update parameter may then be propagated to the nodes of the DAG, such that the nodes operate according to the (adaptively) adjusted routing update parameter.
    • 在一个实施例中,可以为计算机网络中的有向无环图(DAG)的节点设置一个或多个路由更新参数并传播给路由更新参数,该路由更新参数指示何时执行相应的路由更新操作。 决策节点(例如,DAG的根节点,头端的应用等)可以在操作期间基于路由更新参数来收集DAG的网络统计信息,并且因此可以确定至少一个经调整的路由更新参数 基于收集的网络统计。 然后可以将经调整的路由更新参数传播到DAG的节点,使得节点根据(自适应)调整的路由更新参数进行操作。
    • 53. 发明授权
    • Efficient message distribution for directed acyclic graphs
    • 有针对性的非循环图的高效消息分发
    • US08595359B2
    • 2013-11-26
    • US13043168
    • 2011-03-08
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • G06F15/173
    • H04W4/70H04L45/04H04L45/16H04W40/023H04W84/18
    • In one embodiment, a particular node in a primary DAG receives a distributed message from distributing nodes, and from this, deterministically selects a distributing node as a distributing parent in a secondary DAG from which distributed messages are to be received. The particular node may then inform the deterministically selected distributing parent that it is being used by the particular node as its distributing parent, and if the selected distributing parent is not the particular node's primary DAG parent, then the primary DAG parent is informed that it need not send distributed messages for the particular node. In another embodiment, a distributing node continues to repeat distributed messages in response to receiving notification that it is being used as a distributing parent, and if a primary DAG parent, prevents the repeating in response to receiving a notification from all of its child nodes that it need not send distributed messages.
    • 在一个实施例中,主DAG中的特定节点从分发节点接收分布式消息,并且从此确定性地将分发节点确定性地选择为要从其接收分布式消息的辅助DAG中的分发父节点。 然后,特定节点可以将确定性地选择的分配的父节点通知该特定节点正在使用它作为其分发的父节点,并且如果选择的分配父节点不是特定节点的主DAG父节点,则主DAG父节点被通知它需要 不发送特定节点的分布式消息。 在另一个实施例中,分发节点响应于接收到它被用作分发父节点的通知继续重复分布式消息,并且如果主DAG父节点响应于从其所有子节点接收到通知,则防止重复 它不需要发送分布式消息。
    • 54. 发明授权
    • System and method for managing acknowledgement messages in a very large computer network
    • 用于在非常大的计算机网络中管理确认消息的系统和方法
    • US08520676B2
    • 2013-08-27
    • US12942985
    • 2010-11-09
    • Shmuel ShafferJean-Philippe VasseurSandeep Shetty
    • Shmuel ShafferJean-Philippe VasseurSandeep Shetty
    • H04L12/28
    • H04L12/1868H04L1/1854H04L2001/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.
    • 可以通过在多播网络中的第一节点处从第一节点的父节点接收多播消息来分发多播消息。 组播消息被发送到组播网络中第一个节点的子节点。 访问发送多播消息的子节点的群体,并且接收到揭示小于第一节点的所有子节点的确认子集之中的子节点的确认消息。 将接收到的确认消息所揭示的子节点与确定为预期要接收多播消息的子节点的群体中的子节点进行比较。 基于比较的结果,识别压缩的非确认子集并将其发送到父节点。
    • 57. 发明申请
    • Efficient Message Distribution for Directed Acyclic Graphs
    • 定向非循环图的有效消息分布
    • US20120233326A1
    • 2012-09-13
    • US13043168
    • 2011-03-08
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • G06F15/173
    • H04W4/70H04L45/04H04L45/16H04W40/023H04W84/18
    • In one embodiment, a particular node in a primary DAG receives a distributed message from distributing nodes, and from this, deterministically selects a distributing node as a distributing parent in a secondary DAG from which distributed messages are to be received. The particular node may then inform the deterministically selected distributing parent that it is being used by the particular node as its distributing parent, and if the selected distributing parent is not the particular node's primary DAG parent, then the primary DAG parent is informed that it need not send distributed messages for the particular node. In another embodiment, a distributing node continues to repeat distributed messages in response to receiving notification that it is being used as a distributing parent, and if a primary DAG parent, prevents the repeating in response to receiving a notification from all of its child nodes that it need not send distributed messages.
    • 在一个实施例中,主DAG中的特定节点从分发节点接收分布式消息,并且从此确定性地将分发节点确定性地选择为要从其接收分布式消息的辅助DAG中的分发父节点。 然后,特定节点可以将确定性地选择的分配的父节点通知该特定节点正在使用它作为其分发的父节点,并且如果选择的分配父节点不是特定节点的主DAG父节点,则主DAG父节点被通知它需要 不发送特定节点的分布式消息。 在另一个实施例中,分发节点响应于接收到它被用作分发父节点的通知继续重复分布式消息,并且如果主DAG父节点响应于从其所有子节点接收到通知,则防止重复 它不需要发送分布式消息。
    • 58. 发明申请
    • Dynamic Routing Metric Adjustment
    • 动态路由度量调整
    • US20120155475A1
    • 2012-06-21
    • US12971094
    • 2010-12-17
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • H04L12/56
    • H04L12/56H04L45/028H04W40/248
    • In one embodiment, one or more routing update parameters may be set for and propagated to nodes of a directed acyclic graph (DAG) in a computer network, the routing update parameters indicative of when to perform a corresponding routing update operation. A decision node (e.g., a root node of the DAG, application in a head-end, etc.) may gather network statistics of the DAG during operation based on the routing update parameters, and may accordingly determine at least one adjusted routing update parameter based on the gathered network statistics. This adjusted routing update parameter may then be propagated to the nodes of the DAG, such that the nodes operate according to the (adaptively) adjusted routing update parameter.
    • 在一个实施例中,可以为计算机网络中的有向无环图(DAG)的节点设置一个或多个路由更新参数并传播给路由更新参数,该路由更新参数指示何时执行相应的路由更新操作。 决策节点(例如,DAG的根节点,头端的应用等)可以在操作期间基于路由更新参数来收集DAG的网络统计信息,并且因此可以确定至少一个经调整的路由更新参数 基于收集的网络统计。 然后可以将经调整的路由更新参数传播到DAG的节点,使得节点根据(自适应)调整的路由更新参数进行操作。
    • 59. 发明申请
    • Increased Communication Opportunities with Low-Contact Nodes in a Computer Network
    • 增加与计算机网络中低联系节点的沟通机会
    • US20120155463A1
    • 2012-06-21
    • US12971360
    • 2010-12-17
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • H04L12/56
    • H04L12/1863H04L12/185H04L67/145
    • In one embodiment, a particular node (e.g., root node) in a directed acyclic graph (DAG) in a computer network may identify a low-contact (e.g., wireless) node in the DAG that is at risk of having an invalid path when attempts are made to reach the low-contact node. In response, the particular node may identify neighbors of the low-contact node, and may establish a multicast tree from the particular node to the low-contact node through a plurality of the neighbors to reach the low-contact node. When sending traffic to the low-contact node, the particular node sends the traffic on the multicast tree, wherein each of the plurality of neighbors attempts to forward the traffic to the low-contact node. In another embodiment, the low-contact node itself indicates its status to the particular/root node, along with its list of neighbors in order to receive the multicast traffic.
    • 在一个实施例中,计算机网络中的有向非循环图(DAG)中的特定节点(例如,根节点)可以标识DAG中具有无效路径风险的低接触(例如,无线)节点,当 尝试到达低接触节点。 作为响应,特定节点可以识别低联系节点的邻居,并且可以通过多个邻居来建立从特定节点到低联系节点的多播树,以到达低接触节点。 当向低联系节点发送流量时,特定节点在多播树上发送流量,其中多个邻居中的每一个尝试将流量转发到低联系节点。 在另一个实施例中,低接触节点本身指示其对特定/根节点的状态及其邻居列表以便接收多播业务。