Citation Export
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Khan, Awais | - |
| dc.contributor.author | Lee, Chang Gyu | - |
| dc.contributor.author | Hamandawana, Prince | - |
| dc.contributor.author | Park, Sungyong | - |
| dc.contributor.author | Kim, Youngjae | - |
| dc.date.issued | 2018-11-07 | - |
| dc.identifier.uri | https://aurora.ajou.ac.kr/handle/2018.oak/36305 | - |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85058318460&origin=inward | - |
| dc.description.abstract | Deduplication has been largely employed in distributed storage systems to improve space efficiency. Traditional deduplication research ignores the design specifications of shared-nothing distributed storage systems such as no central metadata bottleneck, scalability, and storage rebalancing. Further, deduplication introduces transactional changes, which are prone to errors in the event of a system failure, resulting in inconsistencies in data and deduplication metadata. In this paper, we propose a robust, fault-Tolerant and scalable cluster-wide deduplication that can eliminate duplicate copies across the cluster. We design a distributed deduplication metadata shard which guarantees performance scalability while preserving the design constraints of shared-nothing storage systems. The placement of chunks and deduplication metadata is made cluster-wide based on the content fingerprint of chunks. To ensure transactional consistency and garbage identification, we employ a flag-based asynchronous consistency mechanism. We implement the proposed deduplication on Ceph. The evaluation shows high disk-space savings with minimal performance degradation as well as high robustness in the event of sudden server failure. | - |
| dc.description.sponsorship | This work was supported by Institute for Information & communications TechnologyPromotion(IITP) grant funded by the Korea government(MSIT) (No.2014-0-00035). | - |
| dc.language.iso | eng | - |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
| dc.subject.mesh | Data de duplications | - |
| dc.subject.mesh | Design constraints | - |
| dc.subject.mesh | Design specification | - |
| dc.subject.mesh | Distributed and cloud computing | - |
| dc.subject.mesh | Distributed storage system | - |
| dc.subject.mesh | File systems | - |
| dc.subject.mesh | Performance degradation | - |
| dc.subject.mesh | Performance scalability | - |
| dc.title | A robust fault-tolerant and scalable cluster-wide deduplication for shared-nothing storage systems | - |
| dc.type | Conference | - |
| dc.citation.conferenceDate | 2018.09.25.~2018.09.28. | - |
| dc.citation.conferenceName | 26th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2018 | - |
| dc.citation.edition | Proceedings - 26th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2018 | - |
| dc.citation.endPage | 93 | - |
| dc.citation.startPage | 87 | - |
| dc.citation.title | Proceedings - 26th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2018 | - |
| dc.identifier.bibliographicCitation | Proceedings - 26th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2018, pp.87-93 | - |
| dc.identifier.doi | 10.1109/mascots.2018.00016 | - |
| dc.identifier.scopusid | 2-s2.0-85058318460 | - |
| dc.identifier.url | http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8526478 | - |
| dc.subject.keyword | Data Deduplication | - |
| dc.subject.keyword | Distributed and cloud computing | - |
| dc.subject.keyword | Distributed Storage Systems | - |
| dc.subject.keyword | Storage and file systems | - |
| dc.type.other | Conference Paper | - |
| dc.description.isoa | true | - |
| dc.subject.subarea | Computer Networks and Communications | - |
| dc.subject.subarea | Modeling and Simulation | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.