会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明申请
    • Data Reporting Using Reporting Groups in a Computer Network
    • 使用计算机网络中的报告组进行数据报告
    • US20120158933A1
    • 2012-06-21
    • US12971076
    • 2010-12-17
    • Sandeep Jay ShettyShmuel ShafferJean-Philippe Vasseur
    • Sandeep Jay ShettyShmuel ShafferJean-Philippe Vasseur
    • G06F15/173
    • H04L41/12H04L41/0893
    • In one embodiment, a node may determine a topology of a plurality of reporting nodes within a directed acyclic graph (DAG) in a computer network. The reporting nodes may then be assigned to one of a plurality of reporting groups, where reporting nodes are allowed to report only during designated time windows corresponding to their assigned reporting group. The reporting nodes may then be informed of at least their own assignment to a particular reporting group. In another embodiment, a particular reporting node may join the DAG, and may also receive an assignment to one of a plurality of reporting groups. Accordingly, the particular reporting node may also determine designated time windows corresponding to the assigned reporting group, where the particular reporting node is allowed to report only during the designated time windows.
    • 在一个实施例中,节点可以确定计算机网络中的有向无环图(DAG)内的多个报告节点的拓扑。 然后可以将报告节点分配给多个报告组中的一个,其中允许报告节点仅在与其分配的报告组对应的指定时间窗口期间报告。 然后可以向报告节点通知至少他们自己对特定报告组的分配。 在另一个实施例中,特定报告节点可以加入DAG,并且还可以接收对多个报告组之一的分配。 因此,特定报告节点还可以确定与分配的报告组相对应的指定时间窗口,其中允许特定报告节点仅在指定的时间窗口期间报告。
    • 22. 发明申请
    • Collision Avoidance for Wireless Networks
    • 无线网络的冲突避免
    • US20120155397A1
    • 2012-06-21
    • US12971540
    • 2010-12-17
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • H04W28/00
    • H04W28/044H04L45/74H04L47/286H04W28/04H04W74/085H04W84/18
    • In one embodiment, a particular node in a wireless network may receive a wireless signal, and may determine whether the wireless signal is intended for itself In response to determining that the wireless signal is intended for the particular node, the particular node may transmit a non-colliding wireless carrier sense detected alert (CSDA) signal during the received wireless signal to request that other nodes within communication distance of the particular node refrain from transmitting for a duration of the received wireless signal. In another embodiment, a node listens on a first frequency for a wireless CSDA signal regarding a second (colliding) frequency, and in response to receiving a CSDA signal, may refrain from transmitting a wireless signal on the second frequency for the particular duration, or else (if not receiving a CSDA signal), may allow transmission of a wireless signal on the second frequency, accordingly.
    • 在一个实施例中,无线网络中的特定节点可以接收无线信号,并且可以确定无线信号是否为自己。响应于确定无线信号是针对特定节点,特定节点可以发送非 - - 在接收到的无线信号期间, - 聚合无线载波侦听警报(CSDA)信号,以请求特定节点的通信距离内的其他节点在所接收的无线信号的持续时间内不发射。 在另一个实施例中,节点在第一频率上侦听关于第二(冲突)频率的无线CSDA信号,并且响应于接收到CSDA信号可以避免在特定持续时间内在第二频率上发送无线信号,或者 否则(如果没有接收到CSDA信号),则可以允许相应地在第二频率上发送无线信号。
    • 24. 发明申请
    • Negotiated Parent Joining in Directed Acyclic Graphs (DAGS)
    • 协商的父母加入定向非循环图(DAGS)
    • US20120117213A1
    • 2012-05-10
    • US12942949
    • 2010-11-09
    • Shmuel ShafferJean-Philippe VasseurSandeep Jay Shetty
    • Shmuel ShafferJean-Philippe VasseurSandeep Jay Shetty
    • G06F15/173
    • H04L47/726
    • In one embodiment, a node may request to join a parent node in a directed acyclic graph (DAG) in a computer network, and may notify the parent node of a load associated with the request, and whether the node has any other parent node options. The response received from the parent node may be either an acceptance or a denial (based on the load and other parent node options), where in the case of an acceptance, the node may join the parent node in the DAG. Alternatively, in response to a denial, in one embodiment, the node may perform load shedding to become acceptable to the parent node. In another embodiment, a node receiving a join request from a child node may determine an impact associated with allowing the child node (and its load) to join the receiving node in the DAG prior to returning an acceptance or denial, accordingly.
    • 在一个实施例中,节点可以请求在计算机网络中的有向非循环图(DAG)中加入父节点,并且可以向父节点通知与该请求相关联的负载,以及该节点是否具有任何其他父节点选项 。 从父节点接收的响应可以是接受或拒绝(基于负载和其他父节点选项),其中在接受的情况下,节点可以加入DAG中的父节点。 或者,响应于拒绝,在一个实施例中,节点可以执行负载切换以使得父节点变得可接受。 在另一个实施例中,从子节点接收加入请求的节点可以相应地确定与允许子节点(及其负载)在返回接受或拒绝之前在DAG中加入接收节点相关联的影响。
    • 25. 发明授权
    • Data reporting using reporting groups in a computer network
    • 使用计算机网络中的报告组进行数据报告
    • US09426035B2
    • 2016-08-23
    • US12971076
    • 2010-12-17
    • Sandeep Jay ShettyShmuel ShafferJean-Philippe Vasseur
    • Sandeep Jay ShettyShmuel ShafferJean-Philippe Vasseur
    • G06F15/173H04L12/24G06F15/16
    • H04L41/12H04L41/0893
    • In one embodiment, a node may determine a topology of a plurality of reporting nodes within a directed acyclic graph (DAG) in a computer network. The reporting nodes may then be assigned to one of a plurality of reporting groups, where reporting nodes are allowed to report only during designated time windows corresponding to their assigned reporting group. The reporting nodes may then be informed of at least their own assignment to a particular reporting group. In another embodiment, a particular reporting node may join the DAG, and may also receive an assignment to one of a plurality of reporting groups. Accordingly, the particular reporting node may also determine designated time windows corresponding to the assigned reporting group, where the particular reporting node is allowed to report only during the designated time windows.
    • 在一个实施例中,节点可以确定计算机网络中的有向无环图(DAG)内的多个报告节点的拓扑。 然后可以将报告节点分配给多个报告组中的一个,其中允许报告节点仅在与其分配的报告组对应的指定时间窗口期间报告。 然后可以向报告节点通知至少他们自己对特定报告组的分配。 在另一个实施例中,特定报告节点可以加入DAG,并且还可以接收对多个报告组之一的分配。 因此,特定报告节点还可以确定与分配的报告组相对应的指定时间窗口,其中允许特定报告节点仅在指定的时间窗口期间报告。
    • 27. 发明授权
    • Repeater nodes in shared media networks
    • 共享媒体网络中的中继节点
    • US09197380B2
    • 2015-11-24
    • US12971148
    • 2010-12-17
    • Sandeep Jay ShettyShmuel ShafferJean-Philippe Vasseur
    • Sandeep Jay ShettyShmuel ShafferJean-Philippe Vasseur
    • H04L1/18H04L1/00
    • H04L1/1867H04L2001/0097
    • In one embodiment, a repeater node in a shared media network may intercept a shared media transmission from a first node to a second node. Once a shared media transmission is intercepted, the repeater node may determine whether the second node returns an acknowledgement (ACK) to the first node. If the second node does not return an ACK to the first node, the repeater node repeats the shared media transmission to the second node. Also, according to one or more additional embodiments of the disclosure, when receiving an ACK at the repeater node from the second node in response to the repeated shared media transmission, the repeater node may also forward the ACK from the second node to the first node.
    • 在一个实施例中,共享媒体网络中的中继器节点可以拦截从第一节点到第二节点的共享媒体传输。 一旦共享媒体传输被拦截,则中继器节点可以确定第二节点是否向第一节点返回确认(ACK)。 如果第二节点不向第一节点返回ACK,则中继器节点重复向第二节点的共享媒体传输。 此外,根据本公开的一个或多个附加实施例,当响应于重复的共享媒体传输从第二节点在中继器节点处接收到ACK时,中继器节点还可以将ACK从第二节点转发到第一节点 。
    • 28. 发明授权
    • Dynamic reroute scheduling in a directed acyclic graph (DAG)
    • 有向非循环图(DAG)中的动态重新路由调度
    • US08937886B2
    • 2015-01-20
    • US12971474
    • 2010-12-17
    • Shmuel ShafferJean-Philippe VasseurSandeep Jay Shetty
    • Shmuel ShafferJean-Philippe VasseurSandeep Jay Shetty
    • H04L12/28H04L12/757
    • H04L45/023
    • In one embodiment, a particular node joins a directed acyclic graph (DAG) in a computer network at a parent node, and determines its grade based on a topology of the DAG, the grade lower than the parent node and higher than any child nodes of the particular node. In response to detecting a trigger for a routing change in the DAG, the particular node delays the routing change based on the grade such that the delay is longer than a first associated delay of any of the child nodes and shorter than a second associated delay of the parent node. Upon expiration of the delay, the particular node may determine if the trigger for the routing change is still valid, and if valid, performs the routing change.
    • 在一个实施例中,特定节点在父节点处连接计算机网络中的有向非循环图(DAG),并且基于DAG的拓扑来确定其等级,等级低于父节点并且高于父节点的任何子节点 特定节点。 响应于检测到DAG中的路由改变的触发,特定节点基于等级来延迟路由改变,使得延迟长于任何子节点的第一相关延迟,并且短于第二相关延迟 父节点。 在延迟到期时,特定节点可以确定路由改变的触发是否仍然有效,并且如果有效,则执行路由改变。
    • 29. 发明授权
    • 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的节点,使得节点根据(自适应)调整的路由更新参数进行操作。
    • 30. 发明授权
    • 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父节点响应于从其所有子节点接收到通知,则防止重复 它不需要发送分布式消息。