A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes
Authors:
- 1 June 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 66-71
Abstract
Service rate is an important, recently introduced, performance metric associated with distributed coded storage systems. Among other interpretations, it measures the number of users that can be simultaneously served by the system. We introduce a geometric approach to address this problem. One of the most significant advantages of this approach over the existing ones is that it allows one to derive bounds on the service rate of a code without explicitly knowing the list of all possible recovery sets. To illustrate the power of our geometric approach, we derive upper bounds on the service rates of the first order Reed-Muller codes and the simplex codes. Then, we show how these upper bounds can be achieved. Furthermore, utilizing the proposed geometric technique, we show that given the service rate region of a code, a lower bound on the minimum distance of the code can be obtained.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Simplex Queues for Hot-Data Download2017
- Efficient Redundancy Techniques for Latency Reduction in Cloud SystemsACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2017
- Coding for caching: fundamental limits and practical challengesIEEE Communications Magazine, 2016
- On storage allocation for maximum service rate in distributed storage systems2016
- Efficient replication of queued tasks for latency reduction in cloud systems2015
- Many-to-many matching games for proactive social-caching in wireless small cell networks2014
- Pyramid CodesACM Transactions on Storage, 2013
- On the Locality of Codeword SymbolsIEEE Transactions on Information Theory, 2012
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Geometric approach to higher weightsIEEE Transactions on Information Theory, 1995