{"id":"https://openalex.org/W2155479689","doi":"https://doi.org/10.1109/allerton.2009.5394766","title":"Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding","display_name":"Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding","publication_year":2009,"publication_date":"2009-09-01","ids":{"openalex":"https://openalex.org/W2155479689","doi":"https://doi.org/10.1109/allerton.2009.5394766","mag":"2155479689"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2009.5394766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2009.5394766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/58960","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062316763","display_name":"Randy Cogill","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Randy Cogill","raw_affiliation_strings":["Department of Systems and Information Engineering, University of Virginia, Charlottesville, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems and Information Engineering, University of Virginia, Charlottesville, VA, USA","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047576065","display_name":"Brooke Shrader","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]},{"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":"Brooke Shrader","raw_affiliation_strings":["Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954","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":1.3516,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.815654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"98","issue":null,"first_page":"462","last_page":"468"},"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.9991000294685364,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9984999895095825,"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/multicast","display_name":"Multicast","score":0.7634727358818054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6946980357170105},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6779131293296814},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6706862449645996},{"id":"https://openalex.org/keywords/multilevel-queue","display_name":"Multilevel queue","score":0.6687355637550354},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5842106938362122},{"id":"https://openalex.org/keywords/queue-management-system","display_name":"Queue management system","score":0.5483220815658569},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5033733248710632},{"id":"https://openalex.org/keywords/bulk-queue","display_name":"Bulk queue","score":0.4491984248161316},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.32480132579803467}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7634727358818054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6946980357170105},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6779131293296814},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6706862449645996},{"id":"https://openalex.org/C201511382","wikidata":"https://www.wikidata.org/wiki/Q16801758","display_name":"Multilevel queue","level":4,"score":0.6687355637550354},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5842106938362122},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.5483220815658569},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5033733248710632},{"id":"https://openalex.org/C87950461","wikidata":"https://www.wikidata.org/wiki/Q4996486","display_name":"Bulk queue","level":3,"score":0.4491984248161316},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.32480132579803467}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2009.5394766","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2009.5394766","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/58960","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/58960","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","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/58960","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/58960","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","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1985948944","https://openalex.org/W2018161086","https://openalex.org/W2084875690","https://openalex.org/W2090960495","https://openalex.org/W2121223621","https://openalex.org/W2123938134","https://openalex.org/W2128005148","https://openalex.org/W2130350209","https://openalex.org/W2143752912","https://openalex.org/W2153043354","https://openalex.org/W2159419792","https://openalex.org/W2161342511","https://openalex.org/W2542994128","https://openalex.org/W4245728653","https://openalex.org/W4302856910","https://openalex.org/W6654921851","https://openalex.org/W6728728422","https://openalex.org/W6807829539"],"related_works":["https://openalex.org/W2379185310","https://openalex.org/W4383904585","https://openalex.org/W2766617761","https://openalex.org/W2122857222","https://openalex.org/W4232922852","https://openalex.org/W2480032402","https://openalex.org/W2371822688","https://openalex.org/W2007781440","https://openalex.org/W2384271358","https://openalex.org/W4386352989"],"abstract_inverted_index":{"In":[0,23],"this":[1,97,132],"work":[2],"we":[3,26],"analyze":[4,76],"the":[5,24,28,31,52,65,77,95,103,117,122,128,144,147,156],"average":[6,53,118],"queue":[7,54,66,78,119,129,145],"backlog":[8,55,79,120],"at":[9,71],"a":[10,14,48,81],"source":[11,32],"node":[12,33],"serving":[13],"single":[15],"multicast":[16],"flow":[17],"consisting":[18],"of":[19,92,102,143,158],"M":[20],"destination":[21],"nodes.":[22],"model":[25],"consider,":[27],"channel":[29],"between":[30],"and":[34],"each":[35],"receiver":[36],"is":[37,88,99,151],"an":[38,100,113],"independent":[39],"identically":[40],"distributed":[41],"packet":[42,148],"erasure":[43],"channel.":[44],"We":[45,74,111],"first":[46],"develop":[47,112],"lower":[49],"bound":[50,62,115],"on":[51,116],"achievable":[56],"by":[57],"any":[58],"transmission":[59],"strategy;":[60],"our":[61],"indicates":[63],"that":[64,127,140],"size":[67,130],"must":[68],"scale":[69],"as":[70,135],"least":[72],"\u00bf(1\u00bf(M)).":[73],"then":[75],"for":[80,121,131],"strategy":[82,98,108,124,133,150],"in":[83,94,141],"which":[84],"random":[85,104],"linear":[86,105],"coding":[87,107,149],"performed":[89],"over":[90],"groups":[91],"packets":[93],"queue;":[96],"instance":[101],"network":[106],"introduced":[109],"in.":[110],"upper":[114],"packet-coding":[123],"to":[125,155],"show":[126],"scales":[134],"O(ln(M)).":[136],"Our":[137],"results":[138],"demonstrate":[139],"terms":[142],"backlog,":[146],"order-optimal":[152],"with":[153],"respect":[154],"number":[157],"receivers.":[159]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}