An Efficient Binary Locally Repairable Code for Hadoop Distributed File System

In the Hadoop distributed file systems (HDFSs), to lower costly communication traffic for data recovery, the concept of locally repairable codes (LRCs) has been recently proposed. With regard to the immense size of modern energy-hungry HDFS, computational complexity reduction can be attractive. In t...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE communications letters Ročník 18; číslo 8; s. 1287 - 1290
Hlavní autoři:	Shahabinejad, Mostafa, Khabbazian, Majid, Ardakani, Masoud
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.08.2014 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Applied sciences Coding, codes Computational complexity Decoding Encoding Exact sciences and technology Information theory Information, signal and communications theory Maintenance engineering Reliability Signal and communications theory Systematics Telecommunications and information theory locally repairable codes hadoop distributed file system Erasure coding Finite field Multiplication Coding Data recovery Minimal distance Distributed system Reliability Binary code Computational complexity
ISSN:	1089-7798, 1558-2558
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	In the Hadoop distributed file systems (HDFSs), to lower costly communication traffic for data recovery, the concept of locally repairable codes (LRCs) has been recently proposed. With regard to the immense size of modern energy-hungry HDFS, computational complexity reduction can be attractive. In this letter, to avoid finite field multiplications, which are the major source of complexity, we put forward the idea of designing binary locally repairable codes (BLRCs). More specifically, we design a BLRC with a length of 15, rate of 2/3, and minimum distance of 4, which has the minimum possible locality among its type. We show that our code has lower complexity than most recent non-binary LRC in the literature while meeting other desirable requirements in HDFS such as storage overhead and reliability.
AbstractList	In the Hadoop distributed file systems (HDFSs), to lower costly communication traffic for data recovery, the concept of locally repairable codes (LRCs) has been recently proposed. With regard to the immense size of modern energy-hungry HDFS, computational complexity reduction can be attractive. In this letter, to avoid finite field multiplications, which are the major source of complexity, we put forward the idea of designing binary locally repairable codes (BLRCs). More specifically, we design a BLRC with a length of 15, rate of 2/3, and minimum distance of 4, which has the minimum possible locality among its type. We show that our code has lower complexity than most recent non-binary LRC in the literature while meeting other desirable requirements in HDFS such as storage overhead and reliability. In the Hadoop distributed file systems (HDFSs), to lower costly communication traffic for data recovery, the concept of locally repairable codes (LRCs) has been recently proposed. With regard to the immense size of modern energy-hungry HDFS, computational complexity reduction can be attractive. In this letter, to avoid finite field multiplications, which are the major source of complexity, we put forward the idea of designing binary locally repairable codes (BLRCs). More specifically, we design a BLRC with a length of 15, rate of 2/3, and minimum distance of 4, which has the minimum possible locality among its type. We show that our code has lower complexity than most recent non-binary LRC in the literature while meeting other desirable requirements in HDFS such as storage overhead and reliability. [PUBLICATION ABSTRACT]
Author	Khabbazian, Majid Shahabinejad, Mostafa Ardakani, Masoud
Author_xml	– sequence: 1 givenname: Mostafa surname: Shahabinejad fullname: Shahabinejad, Mostafa email: mshahabi@ualberta.ca organization: Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada – sequence: 2 givenname: Majid surname: Khabbazian fullname: Khabbazian, Majid email: mkhabbazian@ualberta.ca organization: Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada – sequence: 3 givenname: Masoud surname: Ardakani fullname: Ardakani, Masoud email: ardakani@ualberta.ca organization: Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28807861$$DView record in Pascal Francis
BookMark	eNp9kE9PAjEQxRuDiYB-Ab00MR4Xp-2W7R4RQUwWSfxz3nR326Rk2WJbDnx7ixAOHrzMzOH35uW9Aep1tlMI3RIYEQL5YzFdLZcjCiQdUcZompML1Ceci4TG0Ys3iDzJslxcoYH3awAQlJM-ept0eKa1qY3qAn4ynXR7XNhatu0ev6utNE5WrcJT2yisrcML2Vi7xc_GB2eqXVANnpsIfOx9UJtrdKll69XNaQ_R13z2OV0kxerldTopkppRHhJNBBeUQMZZ1hDd5JVI61opRnWVj4WsgGuejqVgnGiuATRkjECjQVeaNsCG6P74d-vs9075UK7tznXRsoypGRVplmeRejhR0sdE2smuNr7cOrOJMUsqBGRiTCJHj1ztrPdO6TNCoDz0W_72Wx76LU_9RpH4I6pNkMHYLjhp2v-ld0epUUqdvcaCMyYo-wFQ24jo
CODEN	ICLEF6
CitedBy_id	crossref_primary_10_1155_2016_4837894 crossref_primary_10_1088_1742_6596_1549_2_022075 crossref_primary_10_1109_LCOMM_2019_2892950 crossref_primary_10_1109_TCOMM_2018_2827053 crossref_primary_10_1109_TCOMM_2017_2712186 crossref_primary_10_1109_LCOMM_2017_2697424 crossref_primary_10_1109_TMC_2016_2591537 crossref_primary_10_1007_s10623_024_01419_5 crossref_primary_10_1109_TCOMM_2016_2581163 crossref_primary_10_1016_j_jcss_2017_05_005 crossref_primary_10_1109_TCOMM_2023_3322174 crossref_primary_10_1109_ACCESS_2020_3002824 crossref_primary_10_3233_IDT_180347 crossref_primary_10_1007_s10623_017_0358_0 crossref_primary_10_1016_j_future_2017_11_015 crossref_primary_10_3390_electronics8060596 crossref_primary_10_1007_s11277_016_3234_8 crossref_primary_10_1109_ACCESS_2018_2814624 crossref_primary_10_1109_TIT_2017_2713245 crossref_primary_10_1109_TITS_2019_2950172 crossref_primary_10_1109_TCOMM_2018_2879088 crossref_primary_10_1109_TIT_2021_3052749 crossref_primary_10_1109_TCOMM_2017_2769116 crossref_primary_10_1111_coin_12642
Cites_doi	10.1137/0108018 10.1016/j.matcom.2007.09.010 10.1109/MASCOT.2008.4770564 10.1109/JPROC.2010.2096170 10.14778/2535573.2488339
ContentType	Journal Article
Copyright	2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2014
Copyright_xml	– notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2014
DBID	97E RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M
DOI	10.1109/LCOMM.2014.2332491
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace
DatabaseTitle	CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Applied Sciences
EISSN	1558-2558
EndPage	1290
ExternalDocumentID	3403192321 28807861 10_1109_LCOMM_2014_2332491 6853382
Genre	orig-research
GroupedDBID	-~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION AAYOK IQODW RIG 7SP 8FD L7M
ID	FETCH-LOGICAL-c325t-f18582107537d1fd9b84ccee32fb968ab05f546a8351f5f00f07310df0fbf2d03
IEDL.DBID	RIE
ISICitedReferencesCount	38
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000340657000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1089-7798
IngestDate	Mon Jun 30 10:17:07 EDT 2025 Wed Apr 02 07:37:51 EDT 2025 Tue Nov 18 20:42:38 EST 2025 Sat Nov 29 06:26:32 EST 2025 Wed Aug 27 02:48:14 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	8
Keywords	locally repairable codes hadoop distributed file system Erasure coding Finite field Multiplication Coding Data recovery Minimal distance Distributed system Reliability Binary code Computational complexity
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c325t-f18582107537d1fd9b84ccee32fb968ab05f546a8351f5f00f07310df0fbf2d03
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	1553284797
PQPubID	85419
PageCount	4
ParticipantIDs	pascalfrancis_primary_28807861 crossref_primary_10_1109_LCOMM_2014_2332491 crossref_citationtrail_10_1109_LCOMM_2014_2332491 ieee_primary_6853382 proquest_journals_1553284797
PublicationCentury	2000
PublicationDate	2014-08-01
PublicationDateYYYYMMDD	2014-08-01
PublicationDate_xml	– month: 08 year: 2014 text: 2014-08-01 day: 01
PublicationDecade	2010
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY – name: New York
PublicationTitle	IEEE communications letters
PublicationTitleAbbrev	COML
PublicationYear	2014
Publisher	IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ford (ref4) 0 ref8 huang (ref7) 0 (ref1) 0 rashmi (ref9) 0 snell (ref11) 2006 (ref3) 0 ref6 ref10 ref5 ref2
References_xml	– ident: ref5 doi: 10.1137/0108018 – ident: ref10 doi: 10.1016/j.matcom.2007.09.010 – ident: ref8 doi: 10.1109/MASCOT.2008.4770564 – ident: ref6 doi: 10.1109/JPROC.2010.2096170 – year: 2006 ident: ref11 publication-title: Introduction to Probability – start-page: 8 year: 0 ident: ref9 article-title: A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the facebook warehouse cluster publication-title: Proc 5th USENIX Workshop Hot Topics Storage File Syst – start-page: 15 year: 0 ident: ref7 article-title: Erasure coding in windows azure storage publication-title: Proc USENIX Conf Annu Tech Conf – year: 0 ident: ref3 – year: 0 ident: ref1 – start-page: 61 year: 0 ident: ref4 article-title: Availability in globally distributed storage systems publication-title: Proc 9th USENIX Conf Oper Syst Des Implementation – ident: ref2 doi: 10.14778/2535573.2488339
SSID	ssj0008251
Score	2.3184686
Snippet	In the Hadoop distributed file systems (HDFSs), to lower costly communication traffic for data recovery, the concept of locally repairable codes (LRCs) has...
SourceID	proquest pascalfrancis crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1287
SubjectTerms	Applied sciences Coding, codes Computational complexity Decoding Encoding Exact sciences and technology Information theory Information, signal and communications theory Maintenance engineering Reliability Signal and communications theory Systematics Telecommunications and information theory
Title	An Efficient Binary Locally Repairable Code for Hadoop Distributed File System
URI	https://ieeexplore.ieee.org/document/6853382 https://www.proquest.com/docview/1553284797
Volume	18
WOSCitedRecordID	wos000340657000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2558 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008251 issn: 1089-7798 databaseCode: RIE dateStart: 19970101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF60eNCDryrWR9mDN43dZPPYPWpt8VCrB4XeQpLdgYI00lbBf-_MJg2KIngLZCcJMzvzzWTnwdi5khBav0g80AYDFJvnntZB4WmbSQFG5QJCN2wiGY_VZKIf19hlUwtjrXXJZ_aKLt1ZvimLN_pV1osRW6RCg7ueJHFVq9VYXSrBrJLpNXqMWq0KZITujfoP9_eUxRVeBRIdCO1_AyE3VYVyIrMFsgWqeRY_TLPDm-HO_750l23XfiW_rjbCHluzs3229aXbYJuNr2d84DpGIC2_cYW4fERY9vLB0RHPpnOqo-L90liOvixHq1SWr_yWeuvSWCxr-BCNCK-6nB-w5-HgqX_n1eMUvEIG0dIDhGaFER4GKInxwehchQVipAwg17HKchFBFMYZ-mQ-RCAEoPr7woCAHAIj5CFrzcqZPWLcxBDZOKRDVghjazHIypJEoj7nEhXa7zB_xd-0qHuN08iLl9TFHEKnTiYpySStZdJhFw3Na9Vp48_VbeJ6s7JmeId1v4mxuR8oaqwfI93pSq5pra2LlGYnEUzr5Pj3x56wTXp5lfh3ylrL-Zs9YxvF-3K6mHfdRvwE_fvZXQ
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS9xAEB7EFrQPta1KT63uQ99qdJPdJLuP9uph8e7aBwXfQpLdAUEucncW-t87s8kFpSL0LZDdsMzszo_szPcBfDUKtY_rPELrKEHxVRVZm9SR9aWS6EwlUQeyiXw6NTc39vcaHPe9MN77UHzmT_gx3OW7pn7gX2WnGfkWZcjgvkm1TmTbrdXbXW7CbMvpLcWM1qxaZKQ9HQ9_TSZcx6VPEkUhhI2fuaHAq8JVkeWCBIMto8U_xjl4nNHW_631A7zvIktx1m6Fj7DmZ5_g3RO8wW2Yns3EecCMoLnie2jFFWP2Znd_BYXi5e2cO6nEsHFeUDQryC41zb34wei6TIzlnRiRGREtzvkOXI_Or4YXUUeoENUqSZcRknM2lONRipK7GJ2tjK7JS6oEK5uZspIppjorKSqLMUUpkQxALB1KrDBxUu3C-qyZ-c8gXIapzzRfs6LOvKc0q8xzRSe6UnSk4wHEK_kWdYc2zqQXd0XIOqQtgk4K1knR6WQA3_o59y3Wxqujt1nq_chO4AM4fKbG_n1iGFo_o3kHK70W3XldFMyexI7a5nsvf_YINi6uJuNi_HN6uQ-bvJC2DPAA1pfzB_8F3tZ_lreL-WHYlI92Ktyk
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Efficient+Binary+Locally+Repairable+Code+for+Hadoop+Distributed+File+System&rft.jtitle=IEEE+communications+letters&rft.au=Shahabinejad%2C+Mostafa&rft.au=Khabbazian%2C+Majid&rft.au=Ardakani%2C+Masoud&rft.date=2014-08-01&rft.issn=1089-7798&rft.volume=18&rft.issue=8&rft.spage=1287&rft.epage=1290&rft_id=info:doi/10.1109%2FLCOMM.2014.2332491&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LCOMM_2014_2332491
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon