论文标题
用于动态分布式存储的平衡和互换交易
Balanced and Swap-Robust Trades for Dynamical Distributed Storage
论文作者
论文摘要
由Hedayat引入的交易是两组元素块，这些要素可以交换（交易），而不会更改其组成块内某些元素的某些子集合的计数。它们在某些元素组合被动态地放置在同一元素组中的应用中很重要，因为在这种情况下，可以用允许的元素将有问题的块交易。在分布式存储系统中，由于隐私和其他约束，某些用户组的数据不能将其存储在同一服务器上。我们引入了一类新的平衡交易，对于服务器的访问平衡和扰动弹性平衡交易很重要，对于研究服务器访问频率在数据普及变化方面的稳定性很重要。我们新的贸易计划的结构和界限依赖于最小交易和数字理论分析中定义集的专业选择。
Trades, introduced by Hedayat, are two sets of blocks of elements which may be exchanged (traded) without altering the counts of certain subcollections of elements within their constituent blocks. They are of importance in applications where certain combinations of elements dynamically become prohibited from being placed in the same group of elements, since in this case one can trade the offending blocks with allowed ones. This is particularly the case in distributed storage systems, where due to privacy and other constraints, data of some groups of users cannot be stored together on the same server. We introduce a new class of balanced trades, important for access balancing of servers, and perturbation resilient balanced trades, important for studying the stability of server access frequencies with respect to changes in data popularity. The constructions and bounds on our new trade schemes rely on specialized selections of defining sets in minimal trades and number-theoretic analyses.
