Repair Rates for Multiple Descriptions on Distributed Storage
In a traditional distributed storage system, a source can be restored perfectly when a certain subset of servers is contacted. The coding is independent of the contents of the source. This paper considers instead a lossy source coding version of this problem where the more servers that are contacted...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-04-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/24/5/612 |
| _version_ | 1827669130285678592 |
|---|---|
| author | Anders Høst-Madsen Heecheol Yang Minchul Kim Jungwoo Lee |
| author_facet | Anders Høst-Madsen Heecheol Yang Minchul Kim Jungwoo Lee |
| author_sort | Anders Høst-Madsen |
| collection | DOAJ |
| description | In a traditional distributed storage system, a source can be restored perfectly when a certain subset of servers is contacted. The coding is independent of the contents of the source. This paper considers instead a lossy source coding version of this problem where the more servers that are contacted, the higher the quality of the restored source. An example could be video stored on distributed storage. In information theory, this is called the multiple description problem, where the distortion depends on the number of descriptions received. The problem considered in this paper is how to restore the system operation when one of the servers fail and a new server replaces it, that is, repair. The requirement is that the distortions in the restored system should be no more than in the original system. The question is how many extra bits are needed for repair. We find an achievable rate and show that this is optimal in certain cases. One conclusion is that it is necessary to design the multiple description codes with repair in mind; just using an existing multiple description code results in unnecessary high repair rates. |
| first_indexed | 2024-03-10T03:56:09Z |
| format | Article |
| id | doaj.art-736bf5a8bff841f6a69182b436103337 |
| institution | Directory Open Access Journal |
| issn | 1099-4300 |
| language | English |
| last_indexed | 2024-03-10T03:56:09Z |
| publishDate | 2022-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Entropy |
| spelling | doaj.art-736bf5a8bff841f6a69182b4361033372023-11-23T10:54:37ZengMDPI AGEntropy1099-43002022-04-0124561210.3390/e24050612Repair Rates for Multiple Descriptions on Distributed StorageAnders Høst-Madsen0Heecheol Yang1Minchul Kim2Jungwoo Lee3Department of Electrical Engineering, University of Hawaii Manoa, Honolulu, HI 96822, USADivision of Computer Convergence, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 34134, KoreaDepartment of Electrical and Computer Engineering, Seoul National University, Seoul 08826, KoreaDepartment of Electrical and Computer Engineering, Seoul National University, Seoul 08826, KoreaIn a traditional distributed storage system, a source can be restored perfectly when a certain subset of servers is contacted. The coding is independent of the contents of the source. This paper considers instead a lossy source coding version of this problem where the more servers that are contacted, the higher the quality of the restored source. An example could be video stored on distributed storage. In information theory, this is called the multiple description problem, where the distortion depends on the number of descriptions received. The problem considered in this paper is how to restore the system operation when one of the servers fail and a new server replaces it, that is, repair. The requirement is that the distortions in the restored system should be no more than in the original system. The question is how many extra bits are needed for repair. We find an achievable rate and show that this is optimal in certain cases. One conclusion is that it is necessary to design the multiple description codes with repair in mind; just using an existing multiple description code results in unnecessary high repair rates.https://www.mdpi.com/1099-4300/24/5/612distributed storagemultiple description codingrate-distortionlossy source codingrepair |
| spellingShingle | Anders Høst-Madsen Heecheol Yang Minchul Kim Jungwoo Lee Repair Rates for Multiple Descriptions on Distributed Storage Entropy distributed storage multiple description coding rate-distortion lossy source coding repair |
| title | Repair Rates for Multiple Descriptions on Distributed Storage |
| title_full | Repair Rates for Multiple Descriptions on Distributed Storage |
| title_fullStr | Repair Rates for Multiple Descriptions on Distributed Storage |
| title_full_unstemmed | Repair Rates for Multiple Descriptions on Distributed Storage |
| title_short | Repair Rates for Multiple Descriptions on Distributed Storage |
| title_sort | repair rates for multiple descriptions on distributed storage |
| topic | distributed storage multiple description coding rate-distortion lossy source coding repair |
| url | https://www.mdpi.com/1099-4300/24/5/612 |
| work_keys_str_mv | AT andershøstmadsen repairratesformultipledescriptionsondistributedstorage AT heecheolyang repairratesformultipledescriptionsondistributedstorage AT minchulkim repairratesformultipledescriptionsondistributedstorage AT jungwoolee repairratesformultipledescriptionsondistributedstorage |