Negotiated Parent Joining in Directed Acyclic Graphs (DAGS)
    41.
    发明申请
    Negotiated Parent Joining in Directed Acyclic Graphs (DAGS) 有权
    协商的父母加入定向非循环图(DAGS)

    公开(公告)号:US20120117213A1

    公开(公告)日:2012-05-10

    申请号:US12942949

    申请日:2010-11-09

    CPC classification number: H04L47/726

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

    Abstract translation: 在一个实施例中,节点可以请求在计算机网络中的有向非循环图(DAG)中加入父节点,并且可以向父节点通知与该请求相关联的负载,以及该节点是否具有任何其他父节点选项 。 从父节点接收的响应可以是接受或拒绝(基于负载和其他父节点选项),其中在接受的情况下,节点可以加入DAG中的父节点。 或者,响应于拒绝,在一个实施例中,节点可以执行负载切换以使得父节点变得可接受。 在另一个实施例中,从子节点接收加入请求的节点可以相应地确定与允许子节点(及其负载)在返回接受或拒绝之前在DAG中加入接收节点相关联的影响。

Patent Agency Ranking