TY - GEN
T1 - Balanced and Swap-Robust Trades for Dynamical Distributed Storage
AU - Pan, Chao
AU - Gabrys, Ryan
AU - Liu, Xujun
AU - Colbourn, Charles
AU - Milenkovic, Olgica
N1 - Funding Information:
This work was supported by the NSF grants CCF 1816913 (CJC) and 1814298 (OM). The authors acknowledge useful discussions with Dylan Lusi.
Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Trades, introduced by Hedayat [9], 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.
AB - Trades, introduced by Hedayat [9], 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.
KW - access balancing
KW - combinatorial trades
KW - data popularity changes
KW - distributed storage
UR - http://www.scopus.com/inward/record.url?scp=85136248358&partnerID=8YFLogxK
U2 - 10.1109/ISIT50566.2022.9834794
DO - 10.1109/ISIT50566.2022.9834794
M3 - Conference Proceeding
AN - SCOPUS:85136248358
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2385
EP - 2390
BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE International Symposium on Information Theory, ISIT 2022
Y2 - 26 June 2022 through 1 July 2022
ER -