发明名称 Method for making intelligent data placement decisions in a computer network
摘要 A method for making data placement decisions in a computer network uses multiple factors comprising social rules (rules, factors and criteria common to all participating nodes and intended to benefit the community of nodes), as well as rules, factors and criteria driven by individual self-interest of the participating nodes. The method calls for each node to act in a semi-autonomous manner, without the need for a central coordinating node. By considering multiple factors fully, and not eliminating factors by a sequence of True/False decisions, the method may arrive at optimal decisions and may generate a ranked list of node candidates.
申请公布号 US8886804(B2) 申请公布日期 2014.11.11
申请号 US201012786131 申请日期 2010.05.24
申请人 Pi-Coral, Inc. 发明人 Osmond Roger Frederick
分类号 G06F15/173;G06F17/00;G06N5/02;H04L29/08;H04N21/231;H04N21/00;G06F17/30;G06F11/14 主分类号 G06F15/173
代理机构 Pepper Hamilton LLP 代理人 Pepper Hamilton LLP
主权项 1. A computer-implemented method for making a data placement decisions in a computer network, the method comprising: providing a plurality of self-interest criteria defined for each of a plurality of computer network nodes of the computer network; wherein the plurality of self-interest criteria comprises at least two of the following: a storage cost criterion calculated based on object size, a load criterion, a redirection density criterion, and an object-node affinity criterion; providing a plurality of social criteria defined for each of the plurality of computer network nodes, wherein each of the plurality of network nodes is configured to act in a semi-autonomous manner, without the need for a central coordinating node; assigning weights to the plurality of self-interest criteria and the plurality of social criteria; generating the data placement decision responsive to a computer network event, wherein generating the data placement decision comprises selecting at least one target node based on the plurality of self-interest criteria and the plurality of social criteria; communicating a request to the at least one target node based on the computer network event; receiving the request for at least one data object at a first computer network node of the plurality of computer network nodes, the at least one data object being stored on at least one of the plurality of computer network nodes; analyzing, via the first computer network node, the plurality of self-interest criteria for the first computer network node and a plurality of demand criteria associated with the at least one data object to determine whether to replicate the at least one data object by using a matrix of decision factors; selecting, via the first computer network node, at least one target node with a highest points value in the matrix as preferred target node for storing the at least one replica based on the weighted plurality of self-interest criteria for the first computer network node and the weighted plurality of social criteria responsive to a determination to replicate the at least one data object; generating at least one replica of the at least one data object; and storing the at least one replica on the at least one target node into a container.
地址 San Jose CA US