{"id":"https://openalex.org/W2098329996","doi":"https://doi.org/10.1145/1993806.1993885","title":"Faster information dissemination in dynamic networks via network coding","display_name":"Faster information dissemination in dynamic networks via network coding","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2098329996","doi":"https://doi.org/10.1145/1993806.1993885","mag":"2098329996"},"language":"en","primary_location":{"id":"doi:10.1145/1993806.1993885","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/72462","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"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":"Bernhard Haeupler","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"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":"David Karger","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"381","last_page":"390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9872999787330627,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7203951478004456},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5307799577713013},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5181037783622742},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5158624053001404},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36611777544021606}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7203951478004456},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5307799577713013},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5181037783622742},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5158624053001404},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36611777544021606},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1993806.1993885","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993885","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/72462","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72462","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/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/72462","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72462","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/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W108696806","https://openalex.org/W177399933","https://openalex.org/W1977066974","https://openalex.org/W2007546147","https://openalex.org/W2010682628","https://openalex.org/W2048235391","https://openalex.org/W2071114738","https://openalex.org/W2094856687","https://openalex.org/W2099871174","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2120741723","https://openalex.org/W2146466672","https://openalex.org/W2151893328","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2212571888","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W2139379087"],"abstract_inverted_index":{"We":[0,124,189],"use":[1,125,170],"network":[2,14,32,126,245],"coding":[3],"to":[4,59,120,134,241,250],"improve":[5],"the":[6,12,79,145,150,176],"speed":[7],"of":[8,16,82,107,132,215,227],"distributed":[9,40],"computation":[10],"in":[11,34,62,85,144,153],"dynamic":[13],"model":[15,25],"Kuhn,":[17],"Lynch":[18],"and":[19,111,199,212],"Oshman":[20],"[STOC":[21],"'10].":[22],"In":[23],"this":[24],"an":[26,112,201],"adversary":[27],"adaptively":[28],"chooses":[29],"a":[30,53,104,225,238],"new":[31,251],"topology":[33],"every":[35,86,196],"round,":[36],"making":[37],"even":[38],"basic":[39],"computations":[41],"challenging.":[42],"Kuhn":[43,216],"et":[44,217],"al.":[45,218],"show":[46],"that":[47,118,193,220,247],"n":[48,151],"nodes,":[49],"each":[50,88],"starting":[51],"with":[52,209],"d-bit":[54],"token,":[55],"can":[56,232],"broadcast":[57],"them":[58],"all":[60,121],"nodes":[61],"time":[63],"O(n[superscript":[64,171],"2])":[65,100],"using":[66],"b-bit":[67],"messages,":[68],"where":[69],"b":[70,162],">":[71],"d":[72,164],"+":[73],"log":[74,114],"n.":[75],"Their":[76],"algorithms":[77,110,169,224],"take":[78],"natural":[80,105,222],"approach":[81],"token":[83,93,108],"forwarding:":[84],"round":[87],"node":[89],"broadcasts":[90],"some":[91],"particular":[92],"it":[94],"knows.":[95],"They":[96],"prove":[97],"matching":[98],"\u03a9(n[superscript":[99],"lower":[101,116,137,178,211],"bounds":[102,214],"for":[103,181,221],"class":[106],"forwarding":[109],"\u03a9(n":[113],"n)":[115,167,173],"bound":[117],"applies":[119],"token-forwarding":[122,223],"algorithms.":[123,188,255],"coding,":[127,246],"transmitting":[128],"random":[129,243],"linear":[130,244],"combinations":[131],"tokens,":[133],"break":[135],"both":[136],"bounds.":[138],"Our":[139],"algorithm's":[140],"performance":[141],"is":[142],"quadratic":[143],"message":[146,183],"size":[147],"b,":[148],"broadcasting":[149],"tokens":[152],"roughly":[154],"d/b[superscript":[155],"2]":[156,159,205],"*":[157],"n[superscript":[158],"rounds.":[160],"For":[161],"=":[163,165],"\u0398(log":[166],"our":[168],"2]/log":[172],"rounds,":[174,198],"breaking":[175],"first":[177],"bound,":[179],"while":[180],"larger":[182],"sizes":[184],"we":[185,236],"obtain":[186],"linear-time":[187],"also":[190,248],"consider":[191],"networks":[192],"change":[194],"only":[195],"T":[197],"achieve":[200],"additional":[202],"factor":[203],"T[superscript":[204],"speedup.":[206],"This":[207],"contrasts":[208],"related":[210],"upper":[213],"implying":[219],"speedup":[226],"T,":[228],"but":[229],"not":[230],"more,":[231],"be":[233],"obtained.":[234],"Lastly,":[235],"give":[237],"general":[239],"way":[240],"derandomize":[242],"leads":[249],"deterministic":[252],"information":[253],"dissemination":[254]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":16}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}