{"id":"https://openalex.org/W2139753091","doi":"https://doi.org/10.1109/tit.2010.2094890","title":"Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes","display_name":"Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes","publication_year":2011,"publication_date":"2011-01-21","ids":{"openalex":"https://openalex.org/W2139753091","doi":"https://doi.org/10.1109/tit.2010.2094890","mag":"2139753091"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2094890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2094890","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0910.2263","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029794321","display_name":"Shurui Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shurui Huang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075370174","display_name":"Muriel M\u00e9dard","orcid":"https://orcid.org/0000-0003-4059-407X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muriel Medard","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","[Dept. of Electr. Eng. & Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"[Dept. of Electr. Eng. & Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, USA]","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9256,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.91539244,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"57","issue":"2","first_page":"1080","last_page":"1091"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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.9905999898910522,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9656000137329102,"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/linear-network-coding","display_name":"Linear network coding","score":0.8319222927093506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7703268527984619},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.6881433129310608},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6561641693115234},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5786702632904053},{"id":"https://openalex.org/keywords/distributed-data-store","display_name":"Distributed data store","score":0.5765727162361145},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5101995468139648},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.5048316121101379},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.4407043159008026},{"id":"https://openalex.org/keywords/content-distribution","display_name":"Content distribution","score":0.4217027723789215},{"id":"https://openalex.org/keywords/file-size","display_name":"File size","score":0.41771864891052246},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40832608938217163},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4064553678035736},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.332970529794693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.181907057762146}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8319222927093506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7703268527984619},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.6881433129310608},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6561641693115234},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5786702632904053},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.5765727162361145},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5101995468139648},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.5048316121101379},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.4407043159008026},{"id":"https://openalex.org/C3018752578","wikidata":"https://www.wikidata.org/wiki/Q269415","display_name":"Content distribution","level":2,"score":0.4217027723789215},{"id":"https://openalex.org/C2776029614","wikidata":"https://www.wikidata.org/wiki/Q1146367","display_name":"File size","level":2,"score":0.41771864891052246},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40832608938217163},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4064553678035736},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.332970529794693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.181907057762146},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tit.2010.2094890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2094890","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0910.2263","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0910.2263","pdf_url":"https://arxiv.org/pdf/0910.2263","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:lib.dr.iastate.edu:ece_pubs-1115","is_oa":false,"landing_page_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1115&context=ece_pubs","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electrical and Computer Engineering Publications","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.1604","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.1604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mit.edu/%7Emedard/papers2011/Minimum%20Cost%20Mirror.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/73676","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/73676","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0910.2263","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0910.2263","pdf_url":"https://arxiv.org/pdf/0910.2263","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W67291757","https://openalex.org/W108696806","https://openalex.org/W1640541562","https://openalex.org/W1669781196","https://openalex.org/W1997825969","https://openalex.org/W2020765652","https://openalex.org/W2048235391","https://openalex.org/W2048902074","https://openalex.org/W2063206201","https://openalex.org/W2063458056","https://openalex.org/W2070769254","https://openalex.org/W2087083200","https://openalex.org/W2096714097","https://openalex.org/W2105185344","https://openalex.org/W2106737143","https://openalex.org/W2107520978","https://openalex.org/W2108494513","https://openalex.org/W2109527244","https://openalex.org/W2110052139","https://openalex.org/W2113578340","https://openalex.org/W2117577969","https://openalex.org/W2119087823","https://openalex.org/W2123562143","https://openalex.org/W2127544254","https://openalex.org/W2127832277","https://openalex.org/W2135663658","https://openalex.org/W2147681281","https://openalex.org/W2153833995","https://openalex.org/W2156378563","https://openalex.org/W2161718996","https://openalex.org/W2163059190","https://openalex.org/W2166245380","https://openalex.org/W2167414245","https://openalex.org/W2171266829","https://openalex.org/W2340006107","https://openalex.org/W2949494255","https://openalex.org/W2951279120","https://openalex.org/W3162105941","https://openalex.org/W6676435812"],"related_works":["https://openalex.org/W2378581922","https://openalex.org/W2033503576","https://openalex.org/W2602158514","https://openalex.org/W2393535819","https://openalex.org/W2108293449","https://openalex.org/W2351869247","https://openalex.org/W2089204641","https://openalex.org/W2964074204","https://openalex.org/W2887980935","https://openalex.org/W2077572633"],"abstract_inverted_index":{"Content":[0],"distribution":[1],"over":[2],"networks":[3],"is":[4,76,102,124,161],"often":[5],"achieved":[6],"by":[7,142],"using":[8,143],"mirror":[9],"sites":[10],"that":[11,39,82,153],"hold":[12],"copies":[13,47],"of":[14,48,55,79,89,92,97,107,114,146,196],"files":[15],"or":[16,52,86],"portions":[17],"thereof":[18],"to":[19,29,118],"avoid":[20],"congestion":[21],"and":[22,45,111,130,185],"delay":[23],"issues":[24],"arising":[25],"from":[26],"excessive":[27],"demands":[28],"a":[30,65,77,98,174],"single":[31],"location.":[32],"Accordingly,":[33],"there":[34,155,160],"are":[35,156],"distributed":[36],"storage":[37,100,109,128],"solutions":[38],"divide":[40],"the":[41,49,56,73,90,93,105,108,112,115,120,127,138,144,179,183,194,197],"file":[42],"into":[43],"pieces":[44,50,57,91],"place":[46],"(replication)":[51],"coded":[53,87,184],"versions":[54,88],"(coding)":[58],"at":[59,132],"multiple":[60],"source":[61,80,158,170,198],"nodes.":[62,199],"We":[63,136,188],"consider":[64],"network":[66,69],"which":[67],"uses":[68],"coding":[70],"for":[71,192],"multicasting":[72],"file.":[74,94],"There":[75],"set":[78],"nodes":[81],"contains":[83],"either":[84],"subsets":[85],"The":[95],"cost":[96,110,113,180],"given":[99],"solution":[101],"defined":[103],"as":[104],"sum":[106],"flows":[116,131],"required":[117],"support":[119],"multicast.":[121],"Our":[122],"interest":[123],"in":[125,164],"finding":[126],"capacities":[129],"minimum":[133],"combined":[134],"cost.":[135],"formulate":[137],"corresponding":[139],"optimization":[140],"problems":[141],"theory":[145],"information":[147],"measures.":[148],"In":[149],"particular,":[150],"we":[151,172],"show":[152],"when":[154],"two":[157],"nodes,":[159,171],"no":[162],"loss":[163],"considering":[165],"subset":[166],"sources.":[167],"For":[168],"three":[169],"derive":[173],"tight":[175],"upper":[176],"bound":[177],"on":[178],"gap":[181],"between":[182],"uncoded":[186],"cases.":[187],"also":[189],"present":[190],"algorithms":[191],"determining":[193],"content":[195]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}