Lower bounds for total storage of multiset combinatorial batch codes using linear programming

Lower bounds for total storage of multiset combinatorial batch codes using linear programming

The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs). MCBCs allow multiple users to retrieve items in parallel in a distributed storage system and a fundamental objective in this study is to determine th...

Full description

Saved in:
Bibliographic Details
Main Authors: Chee, Yeow Meng, Kiah, Han Mao, Zhang, Hui
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2021
Subjects:
Engineering::Computer science and engineering
Linear Programming
Servers
Online Access:https://hdl.handle.net/10356/146391
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs). MCBCs allow multiple users to retrieve items in parallel in a distributed storage system and a fundamental objective in this study is to determine the minimum total storage given certain requirements.We formulate an integer linear programming problem so that its optimal solution provides a lower bound of the total storage of MCBCs. Borrowing techniques from linear programming, we improve known lower bounds in some cases and also, determine the exact values for some parameters.

Similar Items