CPC H04L 67/568 (2022.05) [G06F 12/0813 (2013.01); H04L 41/14 (2013.01); H04L 43/02 (2013.01); H04L 49/90 (2013.01); G06F 2212/154 (2013.01); G06F 2212/60 (2013.01); G06F 2212/62 (2013.01)] | 8 Claims |
1. A method of managing a client queue related to a plurality of data nodes in a memory space of a physical memory, the client queue including a node pointer map and a node pointer queue, the method comprising:
maintaining the node pointer map, wherein the node pointer map includes a plurality of node pointer, node-count pairs, wherein one of the plurality of node pointers in the node pointer map indicates a path to one of the plurality of data nodes, and one of the plurality of node-count pairs indicating a number of updates to the one of the plurality of data nodes since a previous transmission of contents of the one of the plurality of data nodes to a client device;
maintaining the node pointer queue, the node pointers queue including a plurality of node pointers, one of the plurality of node pointers in the node pointer queue corresponding to the one of the plurality of data node that has been updated since a previous transmission of node-value, node-count pairs of the one of the plurality of data nodes to the client device; and
receiving, from a network device, a data node update of a data node in the plurality of data nodes.
|