Perturbation-Resilient Trades for Dynamic Service Balancing
Jin Sima, Chao Pan, Olgica Milenkovic

TL;DR
This paper develops analytical bounds on the disbalance caused by limited-magnitude popularity swaps in data trades, improving the understanding of trade stability in distributed storage systems.
Contribution
It introduces a near-optimal, graph-based approach to bound block disbalance under popularity swaps, reducing the gap between previous results and theoretical limits.
Findings
New upper and lower bounds on block disbalance for popularity swaps
Bounds differ by only a factor of 1.07 for rank-1 swaps
Extended results for larger swap magnitudes
Abstract
A combinatorial trade is a pair of sets of blocks of elements that can be exchanged while preserving relevant subset intersection constraints. The class of balanced and swap-robust minimal trades was proposed in [1] for exchanging blocks of data chunks stored on distributed storage systems in an access- and load-balanced manner. More precisely, data chunks in the trades of interest are labeled by popularity ranks and the blocks are required to have both balanced overall popularity and stability properties with respect to swaps in chunk popularities. The original construction of such trades relied on computer search and paired balanced sets obtained through iterative combining of smaller sets that have provable stability guarantees. To reduce the substantial gap between the results of prior approaches and the known theoretical lower bound, we present new analytical upper and lower bounds…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsService-Oriented Architecture and Web Services · Business Process Modeling and Analysis · Software System Performance and Reliability
