期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：1
页码：629-632
语种：English
出版社：Ayushmaan Technologies
摘要：We present a scheme for evenly partitioning the key space indistributed hash tables among the participating nodes. The schemeis based on the multiple random choices paradigm and handles bothnode joins and leaves. It achieves, with high probability, a ratio ofat most 4 between the loads of the most and least burdened nodes,in the face or arbitrary node arrivals and departures. Each join orleave operation incurs message cost that is, with high probability,O (log2n), where n is the number of nodes, and causes the relocation of keys from at most one node (for joins) or three nodes(for leaves).In this paper, A version of heterogeneous systems,where the capacities of nodes to serve keys can vary widely.
