公开(公告)号：US09426035B2

公开(公告)日：2016-08-23

申请号：US12971076

申请日：2010-12-17

Applicant: Sandeep Jay Shetty ,  Shmuel Shaffer ,  Jean-Philippe Vasseur

Inventor： Sandeep Jay Shetty ,  Shmuel Shaffer ,  Jean-Philippe Vasseur

IPC: G06F15/173 ,  H04L12/24 ,  G06F15/16

CPC classification number: H04L41/12 ,  H04L41/0893

Abstract: 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.

Abstract translation: 在一个实施例中，节点可以确定计算机网络中的有向无环图（DAG）内的多个报告节点的拓扑。 然后可以将报告节点分配给多个报告组中的一个，其中允许报告节点仅在与其分配的报告组对应的指定时间窗口期间报告。 然后可以向报告节点通知至少他们自己对特定报告组的分配。 在另一个实施例中，特定报告节点可以加入DAG，并且还可以接收对多个报告组之一的分配。 因此，特定报告节点还可以确定与分配的报告组相对应的指定时间窗口，其中允许特定报告节点仅在指定的时间窗口期间报告。

公开(公告)号：US09210045B2

公开(公告)日：2015-12-08

申请号：US13043176

申请日：2011-03-08

Applicant: Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

Inventor： Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

IPC: H04L12/24 ,  H04L12/753 ,  H04W40/24 ,  H04W84/18

CPC classification number: H04L41/12 ,  H04L45/48 ,  H04W40/248 ,  H04W84/18

Abstract: In one embodiment, a particular node in a computer network receives an indication of a number of child nodes of one or more potential parent nodes to the particular node in a primary directed acyclic graph (DAG). From this, the particular node selects a particular potential parent node with the highest number of child nodes as a secondary DAG parent for the particular node, and joins the secondary DAG at the selected secondary DAG parent (e.g., for multicast and/or broadcast message distribution). This may recursively continue, such that nodes gravitate toward parents with more children, potentially allowing parents with fewer children to relinquish their parental responsibilities.

Abstract translation: 在一个实施例中，计算机网络中的特定节点在主要有向无环图（DAG）中接收到特定节点的一个或多个潜在父节点的子节点数量的指示。 由此，特定节点选择具有最高数量的子节点的特定潜在父节点作为特定节点的辅助DAG父节点，并且将所选辅助DAG父节点上的辅助DAG加入（例如，用于多播和/或广播消息 分配）。 这可能会递归地继续下去，这样节点会越来越多的孩子越来越多的父母，可能会让孩子少的父母放弃父母的责任。

公开(公告)号：US09197380B2

公开(公告)日：2015-11-24

申请号：US12971148

申请日：2010-12-17

Applicant: Sandeep Jay Shetty ,  Shmuel Shaffer ,  Jean-Philippe Vasseur

Inventor： Sandeep Jay Shetty ,  Shmuel Shaffer ,  Jean-Philippe Vasseur

IPC: H04L1/18 ,  H04L1/00

CPC classification number: H04L1/1867 ,  H04L2001/0097

Abstract: 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.

Abstract translation: 在一个实施例中，共享媒体网络中的中继器节点可以拦截从第一节点到第二节点的共享媒体传输。 一旦共享媒体传输被拦截，则中继器节点可以确定第二节点是否向第一节点返回确认（ACK）。 如果第二节点不向第一节点返回ACK，则中继器节点重复向第二节点的共享媒体传输。 此外，根据本公开的一个或多个附加实施例，当响应于重复的共享媒体传输从第二节点在中继器节点处接收到ACK时，中继器节点还可以将ACK从第二节点转发到第一节点 。

公开(公告)号：US08937886B2

公开(公告)日：2015-01-20

申请号：US12971474

申请日：2010-12-17

Applicant: Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

Inventor： Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

IPC: H04L12/28 ,  H04L12/757

CPC classification number: H04L45/023

Abstract: 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.

Abstract translation: 在一个实施例中，特定节点在父节点处连接计算机网络中的有向非循环图（DAG），并且基于DAG的拓扑来确定其等级，等级低于父节点并且高于父节点的任何子节点 特定节点。 响应于检测到DAG中的路由改变的触发，特定节点基于等级来延迟路由改变，使得延迟长于任何子节点的第一相关延迟，并且短于第二相关延迟 父节点。 在延迟到期时，特定节点可以确定路由改变的触发是否仍然有效，并且如果有效，则执行路由改变。

公开(公告)号：US08787392B2

公开(公告)日：2014-07-22

申请号：US12971094

申请日：2010-12-17

Applicant: Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

Inventor： Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

IPC: H04L12/28 ,  H04L12/54 ,  H04W40/24

CPC classification number: H04L12/56 ,  H04L45/028 ,  H04W40/248

Abstract: 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.

Abstract translation: 在一个实施例中，可以为计算机网络中的有向无环图（DAG）的节点设置一个或多个路由更新参数并传播给路由更新参数，该路由更新参数指示何时执行相应的路由更新操作。 决策节点（例如，DAG的根节点，头端的应用等）可以在操作期间基于路由更新参数来收集DAG的网络统计信息，并且因此可以确定至少一个经调整的路由更新参数 基于收集的网络统计。 然后可以将经调整的路由更新参数传播到DAG的节点，使得节点根据（自适应）调整的路由更新参数进行操作。

公开(公告)号：US08595359B2

公开(公告)日：2013-11-26

申请号：US13043168

申请日：2011-03-08

Applicant: Shmuel Shaffer ,  Sandeep Jay Shetty ,  Jean-Philippe Vasseur

Inventor： Shmuel Shaffer ,  Sandeep Jay Shetty ,  Jean-Philippe Vasseur

IPC: G06F15/173

CPC classification number: H04W4/70 ,  H04L45/04 ,  H04L45/16 ,  H04W40/023 ,  H04W84/18

Abstract: 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.

Abstract translation: 在一个实施例中，主DAG中的特定节点从分发节点接收分布式消息，并且从此确定性地将分发节点确定性地选择为要从其接收分布式消息的辅助DAG中的分发父节点。 然后，特定节点可以将确定性地选择的分配的父节点通知该特定节点正在使用它作为其分发的父节点，并且如果选择的分配父节点不是特定节点的主DAG父节点，则主DAG父节点被通知它需要 不发送特定节点的分布式消息。 在另一个实施例中，分发节点响应于接收到它被用作分发父节点的通知继续重复分布式消息，并且如果主DAG父节点响应于从其所有子节点接收到通知，则防止重复 它不需要发送分布式消息。

公开(公告)号：US20120233326A1

公开(公告)日：2012-09-13

申请号：US13043168

申请日：2011-03-08

Applicant: Shmuel Shaffer ,  Sandeep Jay Shetty ,  Jean-Philippe Vasseur

Inventor： Shmuel Shaffer ,  Sandeep Jay Shetty ,  Jean-Philippe Vasseur

IPC: G06F15/173

CPC classification number: H04W4/70 ,  H04L45/04 ,  H04L45/16 ,  H04W40/023 ,  H04W84/18

Abstract: 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.

Abstract translation: 在一个实施例中，主DAG中的特定节点从分发节点接收分布式消息，并且从此确定性地将分发节点确定性地选择为要从其接收分布式消息的辅助DAG中的分发父节点。 然后，特定节点可以将确定性地选择的分配的父节点通知该特定节点正在使用它作为其分发的父节点，并且如果选择的分配父节点不是特定节点的主DAG父节点，则主DAG父节点被通知它需要 不发送特定节点的分布式消息。 在另一个实施例中，分发节点响应于接收到它被用作分发父节点的通知继续重复分布式消息，并且如果主DAG父节点响应于从其所有子节点接收到通知，则防止重复 它不需要发送分布式消息。

公开(公告)号：US20120155475A1

公开(公告)日：2012-06-21

申请号：US12971094

申请日：2010-12-17

Applicant: Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

Inventor： Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

IPC: H04L12/56

CPC classification number: H04L12/56 ,  H04L45/028 ,  H04W40/248

Abstract: 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.

Abstract translation: 在一个实施例中，可以为计算机网络中的有向无环图（DAG）的节点设置一个或多个路由更新参数并传播给路由更新参数，该路由更新参数指示何时执行相应的路由更新操作。 决策节点（例如，DAG的根节点，头端的应用等）可以在操作期间基于路由更新参数来收集DAG的网络统计信息，并且因此可以确定至少一个经调整的路由更新参数 基于收集的网络统计。 然后可以将经调整的路由更新参数传播到DAG的节点，使得节点根据（自适应）调整的路由更新参数进行操作。

公开(公告)号：US20120155463A1

公开(公告)日：2012-06-21

申请号：US12971360

申请日：2010-12-17

Applicant: Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

Inventor： Jean-Philippe Vasseur ,  Shmuel Shaffer ,  Sandeep Jay Shetty

IPC: H04L12/56

CPC classification number: H04L12/1863 ,  H04L12/185 ,  H04L67/145

Abstract: 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.

Abstract translation: 在一个实施例中，计算机网络中的有向非循环图（DAG）中的特定节点（例如，根节点）可以标识DAG中具有无效路径风险的低接触（例如，无线）节点，当 尝试到达低接触节点。 作为响应，特定节点可以识别低联系节点的邻居，并且可以通过多个邻居来建立从特定节点到低联系节点的多播树，以到达低接触节点。 当向低联系节点发送流量时，特定节点在多播树上发送流量，其中多个邻居中的每一个尝试将流量转发到低联系节点。 在另一个实施例中，低接触节点本身指示其对特定/根节点的状态及其邻居列表以便接收多播业务。

公开(公告)号：US20120155329A1

公开(公告)日：2012-06-21

申请号：US12971474

申请日：2010-12-17

Applicant: Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

Inventor： Shmuel Shaffer ,  Jean-Philippe Vasseur ,  Sandeep Jay Shetty

IPC: H04L12/28

CPC classification number: H04L45/023

Abstract: 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.

Abstract translation: 在一个实施例中，特定节点在父节点处连接计算机网络中的有向非循环图（DAG），并且基于DAG的拓扑来确定其等级，等级低于父节点并且高于父节点的任何子节点 特定节点。 响应于检测到DAG中的路由改变的触发，特定节点基于等级来延迟路由改变，使得延迟长于任何子节点的第一相关延迟，并且短于第二相关延迟 父节点。 在延迟到期时，特定节点可以确定路由改变的触发是否仍然有效，并且如果有效，则执行路由改变。