UC知道英文翻译阿。。帮帮忙
来源：百度知道 编辑：UC知道 时间：2024/05/06 01:42:03
When consistent hashing is implemented as described above,the theorem proves a bound ofξ= O(logN). The consistent hashing paper shows that ξ can be reduced to an arbitrarily small constant by having each node run O(logN) “virtual nodes” each with its own identifier.
The phrase “with high probability” bears some discussion. A simple interpretation is that the nodes and keys are randomly chosen, which is plausible in a non-adversarial model of the world.The probability distribution is then over random choices of keys and nodes, and says that such a random choice is unlikely to produce an unbalanced distribution. One might worry, however, about an adversary who intentionally chooses keys to all hash to the same identifier, destroying the load balancing property. The consistent hashing paper uses “k-universal hash functions” to provide certain guarantees even in the case of nonrandom keys.
Rather than using a k-universal hash function, we chose to use the standard SHA-1 function
The phrase “with high probability” bears some discussion. A simple interpretation is that the nodes and keys are randomly chosen, which is plausible in a non-adversarial model of the world.The probability distribution is then over random choices of keys and nodes, and says that such a random choice is unlikely to produce an unbalanced distribution. One might worry, however, about an adversary who intentionally chooses keys to all hash to the same identifier, destroying the load balancing property. The consistent hashing paper uses “k-universal hash functions” to provide certain guarantees even in the case of nonrandom keys.
Rather than using a k-universal hash function, we chose to use the standard SHA-1 function
当一致的哈希被实施得如上所述, 定理证明一个区域? = O(logN) 。一致的哈希纸显示那? 能被减少到一个任意地小常数被有各结奔跑O(logN) "真正结" 每个与它自己的标识符。 词组"以高可能性" 负担某一讨论。一个简单的解释是, 结和钥匙任意地被选择, 是振振有词的在world.The 可能性发行一个non-adversarial 模型是然后钥匙和结结束任意选择, 并且认为, 这样一个任意选择不太可能引起失衡的发行。你也许担心, 然而, 故意地选择钥匙对所有回锅碎肉对同样标识符的敌人, 毁坏装载平衡的物产。一致的哈希纸使用"k 普遍回锅碎肉作用" 提供某些保证在nonrandom 钥匙情况下。 而不是使用一个k 普遍回锅碎肉作用, 我们选择使用标准SHA-1 作用作为我们基本的回锅碎肉作用。这使我们的协议确定, 以便"高的probability"no 要求长期有道理。但是, 导致碰撞在SHA-1 之下的一套钥匙象倒置能被看见, 在一些感觉, or"decrypting" SHA-1 作用。这认为是困难做。因而, 而不是阐明, 我们的定理举行以高可能性, 我们能声称他们使"根据标准坚硬假定。" 为朴素(主要介绍), 我们省却对真正结的用途。在这种情况下, 装载在结也许超出平均由(至多) 一个O(logN) 因素以高可能性(或在我们的情况, 根据标准坚硬假定) 。一个原因避免真正结是, 数字需要由结的数量确定在系统, 可能难确定。当然, 你也许选择使用一个演绎最高界面在结的数量在system;for 例子, 我们能假设至多一台弦服务器每IPv4 地址。跑32 个真正结每物理结在这种情况下会提供好装载平衡。