Invention Grant
US09210045B2 Gravitational parent selection in directed acyclic graphs 有权
有向非循环图中的重力父母选择

Gravitational parent selection in directed acyclic graphs
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.
Public/Granted literature
Information query
Patent Agency Ranking
0/0