76 results about "Node deletion" patented technology

The determination of node and / or adapter liveness in a distributed network data processing system is carried out via one messaging protocol that can be assisted by a second messaging protocol which is significantly less susceptible to delay, especially memory blocking delays encountered by daemons running on other nodes. The switching of protocols is accompanied by controlled grace periods for needed responses. This messaging protocol flexibility is also adapted for use as a mechanism for controlling the deliberate activities of node addition (birth) and node deletion (death).

The invention discloses a processing system and a processing method for nodes in a family tree. The processing system for the nodes in the family tree comprises an interface module, a database and a family tree maintenance module, wherein the interface module is used for providing an input interface and an output interface for users; the database is used for storing the data information of the family tree; the family tree maintenance module is used for maintaining the nodes in the family tree and a connection relation among the nodes according to the operation of the users and comprises a node addition submodule, a node deletion submodule and a node merging submodule; the node addition submodule is used for adding the nodes and the connection relation among the nodes; the node deletion submodule is used for deleting the nodes and the connection relation relevant to the nodes according to a preset deletion rule; and the node merging submodule is used for merging relevance nodes according to a preset merging rule, wherein the relevance nodes comprise common nodes in different family trees and relevant nodes in one family tree. By the processing system and the processing method, the blood relationships of various complex families in the actual world can be expressed accurately and integrally to the greatest extent, the openness of maintaining the family trees is ensured, and the user experience is improved.

A data structure, added to a modified form of the Blink-tree data structure, tracks delete states for nodes. The index delete state (DX) indicates whether it is safe to directly access an index node without re-traversing the B-tree. The DX state is maintained globally, outside of the tree structure. The data delete state (DD) indicates whether it is safe to post an index term for a new leaf node. A DD state is maintained in each level 1 node for its leaf nodes. Delete states indicate whether a specific node has not been deleted, or whether it may have been deleted. Delete states are used to remove the necessity for atomic node splits and chains of latches for deletes, while not requiring retraversal. This property of not requiring a retraversal is exploited to simplify the tree modification operations.

The invention discloses a self-adaptive multi-injection waiting routing method based on a social circle. The self-adaptive multi-injection waiting routing algorithm based on the social circle comprises an injection stage and a waiting stage, according to the method, a message carried by a node vi is forwarded to a destination node vd, a social circle of the node is constructed based on similarityin an injection stage, and different relay node selection strategies are adopted according to whether the node carrying the message is in the social circle of the destination node or not. In the waiting stage, an adaptive multi-injection strategy based on the delivery prediction value is carried out, and the strategy selectively carries out multi-injection on some messages with the copy number being 1. And after a certain message in the network is successfully delivered to the destination node, the node in the network is notified to delete the message successfully delivered to the destinationnode by using an ACK confirmation mechanism algorithm. The self-adaptive multi-injection waiting routing method based on the social circle is an efficient routing algorithm of a delay tolerant network.

The invention provides a mixed algorithm-based intelligent traffic system roadside unit deployment optimization method. A business district is selected as a research object; normalization is performed according to vehicle flow, popularity, accident rate and the like of an initial deployment point position; and calculation is performed to obtain a weight value of a deployment point. Based on an index, namely, a weight value of an initial node, modeling analysis is performed by utilizing a genetic algorithm and a greedy algorithm, and node deletion is performed to obtain an optimal deployment scheme.

The invention discloses a forwarding entry deletion method and a root node. The method comprises the following steps: a root node of a multicast tree sends first multicast tree cutoff messages to part of or all nodes in primary downstream multicast neighbor nodes of the root node respectively after detecting cutoff of the multicast flow, so as to enable the primary downstream multicast neighbor nodes receiving the first multicast tree cutoff messages to delete the forwarding entries of the multicast tree maintained by the primary downstream multicast neighbor nodes per se; and the root node deletes the forwarding entries of the multicast tree maintained by the root node per se after detecting cutoff of the multicast flow. The invention has the advantage that as the root node deletes the forwarding entries of the multicast tree maintained by the root node per se, and part of or all nodes in the primary downstream multicast neighbor nodes of the root node delete the forwarding entries of the multicast tree maintained by the primary downstream multicast neighbor nodes per se, a plurality of multicast entries on the multicast tree are quickly deleted based on a notification mechanism.