Dynamic swarm segmentation
Abstract:
A dataset comprising a plurality of byte ranges is identified. A tree structure is created that represents different subsets of these byte ranges. The tree structure comprises a plurality of nodes that is each associated with a different subset of the byte ranges. These nodes are hierarchically-arranged, such that byte ranges associated with each child node are a subset of byte ranges associated with each parent node. One or more of the byte ranges are identified for each client of a plurality of clients. These are range(s) that the client needs to obtain. Each client is associated with one of the nodes of the tree structure that is, itself, associated with byte ranges that match the byte ranges that the client needs to obtain. Client peers are identified based on based on traversing the tree structure from a node associated with one client to a node associated with a peer.
Public/Granted literature
Information query
Patent Agency Ranking
0/0