{"id":"https://openalex.org/W3196847511","doi":"https://doi.org/10.1109/isit45174.2021.9518121","title":"Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions","display_name":"Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3196847511","doi":"https://doi.org/10.1109/isit45174.2021.9518121","mag":"3196847511"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9518121","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068437513","display_name":"Francisco Maturana","orcid":"https://orcid.org/0000-0002-7532-8399"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Francisco Maturana","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA","Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109919225","display_name":"K. V. Rashmi","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. V. Rashmi","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA","Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068437513"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.8007,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74655402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2334","last_page":"2339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5969516038894653},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5847422480583191},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45387688279151917},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23886147141456604}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5969516038894653},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5847422480583191},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45387688279151917},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23886147141456604},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9518121","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6901481325","display_name":null,"funder_award_id":"CAREER-1943409,CNS-1956271","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308737","display_name":"Facebook","ror":"https://ror.org/01zbnvs85"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1515040589","https://openalex.org/W1525191317","https://openalex.org/W1533295456","https://openalex.org/W1639367088","https://openalex.org/W1905719725","https://openalex.org/W1984381334","https://openalex.org/W2014405145","https://openalex.org/W2038468909","https://openalex.org/W2061649200","https://openalex.org/W2105831729","https://openalex.org/W2119565742","https://openalex.org/W2132748742","https://openalex.org/W2157451524","https://openalex.org/W2345037611","https://openalex.org/W2625724326","https://openalex.org/W2791163388","https://openalex.org/W2885443214","https://openalex.org/W2886027572","https://openalex.org/W2915545313","https://openalex.org/W3000618282","https://openalex.org/W3017703086","https://openalex.org/W3047563314","https://openalex.org/W3081001117","https://openalex.org/W3081411738","https://openalex.org/W3082276652","https://openalex.org/W3101151818","https://openalex.org/W3196847511","https://openalex.org/W4239670432","https://openalex.org/W6606324823","https://openalex.org/W6632046811","https://openalex.org/W6640091283","https://openalex.org/W6759064723","https://openalex.org/W6773580028","https://openalex.org/W6781317741","https://openalex.org/W6782144539"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"In":[0,159],"distributed":[1],"storage":[2,44],"systems,":[3],"an":[4,76,88,202,241],"[":[5,77,89],"<tex":[6,13,19,29,51,55,78,90],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[7,14,20,30,52,56,79,91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n,":[8],"k$</tex>":[9],"]":[10,82,94],"code":[11,67,83,100,185],"encodes":[12],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[15,57],"message":[16],"symbols":[17,23],"into":[18],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[21,31,53],"codeword":[22],"which":[24,141,248],"are":[25,110,254],"then":[26],"stored":[27],"on":[28,105,123,128,166,170,198,213],"nodes":[32,136],"in":[33,43,60,228],"the":[34,69,133,144,164,167,184],"system.":[35],"Recent":[36],"work":[37,122],"has":[38,126],"shown":[39],"that":[40,220],"significant":[41,103],"savings":[42],"space":[45],"can":[46,223],"be":[47,224,236],"obtained":[48],"by":[49],"tuning":[50,65],"and":[54,149,173,201,253],"to":[58,84,143,155],"variations":[59],"device":[61],"failure":[62],"rates.":[63],"Such":[64],"necessitates":[66],"conversion:":[68],"process":[70],"of":[71,115,135,146,205,233],"converting":[72],"data":[73,147],"encoded":[74],"under":[75,87],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n^{I},":[80],"k^{I}$</tex>":[81],"its":[85],"equivalent":[86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n^{F},":[92],"k^{F}$</tex>":[93],"code.":[95],"The":[96,216],"default":[97],"approach":[98],"for":[99,117,176,244],"conversion":[101,171,186,214,221,234],"places":[102],"burden":[104],"system":[106],"resources.":[107],"Convertible":[108],"codes":[109,116,125,200,247],"a":[111,210],"recently":[112],"proposed":[113],"class":[114],"enabling":[118],"resource-efficient":[119],"conversions.":[120,158],"Existing":[121],"convertible":[124,179,206,246],"focused":[127],"minimizing":[129],"access":[130,231],"cost,":[131],"i.e.,":[132],"number":[134],"accessed":[137],"during":[138,157],"conversion.":[139],"Bandwidth,":[140],"corresponds":[142],"amount":[145],"read":[148],"transferred,":[150],"is":[151],"another":[152],"important":[153,203],"resource":[154],"optimize":[156],"this":[160,250],"paper,":[161],"we":[162,182,208,239],"initiate":[163],"study":[165],"fundamental":[168],"limits":[169],"bandwidth":[172,222],"present":[174,240],"constructions":[175],"conversion-bandwidth":[177,256],"optimal":[178],"codes.":[180],"First,":[181],"model":[183],"problem":[187],"using":[188],"information":[189],"flow":[190],"graphs":[191],"with":[192],"variable":[193],"capacity":[194],"edges.":[195],"Second,":[196],"focusing":[197],"MDS":[199,245],"subclass":[204],"codes,":[207],"derive":[209],"lower":[211,251],"bound":[212,218,252],"bandwidth.":[215],"derived":[217],"shows":[219],"significantly":[225],"reduced":[226],"even":[227],"regimes":[229],"where":[230],"cost":[232],"cannot":[235],"reduced.":[237],"Third,":[238],"explicit":[242],"construction":[243],"match":[249],"thus":[255],"optimal.":[257]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}