{"id":"https://openalex.org/W2094856687","doi":"https://doi.org/10.1145/1993636.1993676","title":"Analyzing network coding gossip made easy","display_name":"Analyzing network coding gossip made easy","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2094856687","doi":"https://doi.org/10.1145/1993636.1993676","mag":"2094856687"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993636.1993676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","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/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":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge MA, USA#TAB#"],"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":1,"corresponding_author_ids":["https://openalex.org/A5080591933"],"corresponding_institution_ids":["https://openalex.org/I4210110987","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":24.7766,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.99721095,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"293","last_page":"302"},"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9735999703407288,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9692999720573425,"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/gossip","display_name":"Gossip","score":0.8897329568862915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8385690450668335},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6589592695236206},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.5873974561691284},{"id":"https://openalex.org/keywords/gossip-protocol","display_name":"Gossip protocol","score":0.5263251662254333},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5065134763717651},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47479623556137085},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4242866635322571},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3632795214653015},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3477092981338501},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33993208408355713},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.16071459650993347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14401358366012573}],"concepts":[{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.8897329568862915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8385690450668335},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6589592695236206},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.5873974561691284},{"id":"https://openalex.org/C145928361","wikidata":"https://www.wikidata.org/wiki/Q5587504","display_name":"Gossip protocol","level":3,"score":0.5263251662254333},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5065134763717651},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47479623556137085},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4242866635322571},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3632795214653015},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3477092981338501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33993208408355713},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.16071459650993347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14401358366012573},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993636.1993676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993636.1993676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W205319591","https://openalex.org/W1501097462","https://openalex.org/W1635656952","https://openalex.org/W1650533466","https://openalex.org/W1990476939","https://openalex.org/W2007546147","https://openalex.org/W2009356484","https://openalex.org/W2016312880","https://openalex.org/W2035300188","https://openalex.org/W2038562061","https://openalex.org/W2048235391","https://openalex.org/W2058322021","https://openalex.org/W2076470989","https://openalex.org/W2098329996","https://openalex.org/W2099871174","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2107520978","https://openalex.org/W2110100895","https://openalex.org/W2120030211","https://openalex.org/W2120741723","https://openalex.org/W2122659814","https://openalex.org/W2144381381","https://openalex.org/W2144415942","https://openalex.org/W2146466672","https://openalex.org/W2149863032","https://openalex.org/W2151893328","https://openalex.org/W2157004711","https://openalex.org/W2160609908","https://openalex.org/W2163636580","https://openalex.org/W2584710039","https://openalex.org/W2950151986","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3024820515","https://openalex.org/W2131433923","https://openalex.org/W2010318438","https://openalex.org/W2020760577","https://openalex.org/W1678654634","https://openalex.org/W2120550887","https://openalex.org/W2149172033","https://openalex.org/W2108737453","https://openalex.org/W2050759643","https://openalex.org/W177242786"],"abstract_inverted_index":{"We":[0,34,58],"introduce":[1],"projection":[2],"analysis":[3,26,117,180],"-":[4],"a":[5,39,145,168],"new":[6],"technique":[7],"to":[8,95,105,120,197],"analyze":[9,35],"the":[10,51,64,68,83,91,101,126,139,151,182],"stopping":[11,79],"time":[12,102],"of":[13,82,93,177],"gossip":[14,37,70,112,171],"protocols":[15,162],"that":[16,47,67,149,193],"are":[17,81,142],"based":[18],"on":[19],"random":[20],"linear":[21],"network":[22,43,140,153],"coding":[23],"(RLNC).":[24],"Projection":[25],"drastically":[27],"simplifies,":[28],"extends":[29,119],"and":[30,44,49,98,184],"strengthens":[31],"previous":[32],"results.":[33],"RLNC":[36,69,111,170],"in":[38,55,60,75,124,173],"general":[40],"framework":[41],"for":[42,63,166,202],"communication":[45],"models":[46,52],"encompasses":[48],"unifies":[50],"used":[53],"previously":[54,164],"this":[56,174],"context.":[57],"show,":[59],"most":[61],"settings":[62],"first":[65],"time,":[66],"converges":[71],"with":[72,189],"high":[73],"probability":[74],"optimal":[76],"time.":[77,133],"Most":[78],"times":[80],"form":[84],"O(k":[85],"+":[86],"T),":[87],"where":[88],"k":[89],"is":[90,100],"number":[92],"messages":[94],"be":[96],"distributed":[97],"T":[99],"it":[103],"takes":[104],"disseminate":[106],"one":[107],"message.":[108],"This":[109,134,187],"means":[110],"achieves":[113],"perfect":[114],"pipelining.":[115],"Our":[116],"directly":[118],"highly":[121],"dynamic":[122],"networks":[123,178],"which":[125],"topology":[127],"can":[128],"change":[129],"completely":[130],"at":[131],"any":[132],"remains":[135,181],"true,":[136],"even":[137],"if":[138],"dynamics":[141],"controlled":[143],"by":[144],"fully":[146],"adaptive":[147],"adversary":[148],"knows":[150],"complete":[152],"state.":[154],"Virtually":[155],"nothing":[156],"besides":[157],"simple":[158],"O(kT)":[159],"sequential":[160],"flooding":[161],"was":[163],"known":[165],"such":[167],"setting.While":[169],"works":[172],"wide":[175],"variety":[176],"our":[179],"same":[183],"extremely":[185],"simple.":[186],"contrasts":[188],"more":[190],"complex":[191],"proofs":[192],"were":[194],"put":[195],"forward":[196],"give":[198],"less":[199],"strong":[200],"results":[201],"various":[203],"special":[204],"cases.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":20},{"year":2012,"cited_by_count":23}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}