Index Link

  • RootNode

Item

{"_buckets": {"deposit": "73d4b60e-76ef-410d-9f4c-4466f33b9601"}, "_deposit": {"id": "3661", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3661"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3661", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Ensuring Reliability in Deduplicated Data by Erasure Coded Replication", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "As computer systems are taking more and moreresponsibilities in critical processes, the demand forstorage is increasing due to widespread applications.Saving the digital information in a large disk isexpensive and unreliable. As a result, if the disk failsall the data is lost. Therefore, the yearning for abetter understanding of the system’s reliability is everincreasing. In greatest hit storage environments,deduplication is applied as an effective technique tooptimize the storage space utilization. Usually, thedata deduplication impacts the bad result for thereliability of the storage system because of theinformation sharing.In this paper, reliability guaranteed deduplicationalgorithm is proposed by considering reliabilityduring the deduplication process. The deduplicateddata are distributed to the storage pool by applyingthe consistent hash ring as a replicas placementstrategy. The proposed mechanism is evaluated andthe result is compared with pure replication anderasure coded replication. The proposed mechanismcan provide the better storage utilization and the onehundred percent of assurance for demandedreliability level in compared with the existing systems."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Deduplication"}, {"interim": "Distributed storage"}, {"interim": "Erasure coding"}, {"interim": "Reliability"}, {"interim": "Replication"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-03"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "12050.pdf", "filesize": [{"value": "477 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 477000.0, "url": {"url": "https://meral.edu.mm/record/3661/files/12050.pdf"}, "version_id": "83b33f86-b3ef-4a2b-9994-713431e07dc5"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Twelfth International Conference On Computer Applications (ICCA 2014)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Phyu, Myat Pwint"}, {"subitem_authors_fullname": "Thein, Thandar"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2014-02-17"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/140"}, "item_title": "Ensuring Reliability in Deduplicated Data by Erasure Coded Replication", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003661", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-03"}, "publish_date": "2019-07-03", "publish_status": "0", "recid": "3661", "relation": {}, "relation_version_is_last": true, "title": ["Ensuring Reliability in Deduplicated Data by Erasure Coded Replication"], "weko_shared_id": -1}

Ensuring Reliability in Deduplicated Data by Erasure Coded Replication

http://hdl.handle.net/20.500.12678/0000003661
392fe920-c930-4b26-9c76-c4ff4d3b8d67
73d4b60e-76ef-410d-9f4c-4466f33b9601
None
Name / File License Actions
12050.pdf 12050.pdf (477 Kb)
Publication type
Article
Upload type
Publication
Title
Title Ensuring Reliability in Deduplicated Data by Erasure Coded Replication
Language en
Publication date 2014-02-17
Authors
Phyu, Myat Pwint
Thein, Thandar
Description
As computer systems are taking more and moreresponsibilities in critical processes, the demand forstorage is increasing due to widespread applications.Saving the digital information in a large disk isexpensive and unreliable. As a result, if the disk failsall the data is lost. Therefore, the yearning for abetter understanding of the system’s reliability is everincreasing. In greatest hit storage environments,deduplication is applied as an effective technique tooptimize the storage space utilization. Usually, thedata deduplication impacts the bad result for thereliability of the storage system because of theinformation sharing.In this paper, reliability guaranteed deduplicationalgorithm is proposed by considering reliabilityduring the deduplication process. The deduplicateddata are distributed to the storage pool by applyingthe consistent hash ring as a replicas placementstrategy. The proposed mechanism is evaluated andthe result is compared with pure replication anderasure coded replication. The proposed mechanismcan provide the better storage utilization and the onehundred percent of assurance for demandedreliability level in compared with the existing systems.
Keywords
Deduplication, Distributed storage, Erasure coding, Reliability, Replication
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/140
Journal articles
Twelfth International Conference On Computer Applications (ICCA 2014)
Conference papers
Books/reports/chapters
Thesis/dissertations
0
0
views
downloads
Views Downloads

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats