{"id":"https://openalex.org/W2111639886","doi":"https://doi.org/10.1109/cdc.2009.5399592","title":"Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations","display_name":"Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2111639886","doi":"https://doi.org/10.1109/cdc.2009.5399592","mag":"2111639886"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2009.5399592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2009.5399592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5115605010","display_name":"Xiaoying Zheng","orcid":"https://orcid.org/0000-0002-7417-8296"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoying Zheng","raw_affiliation_strings":["Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA","Dept. of Computer and Information Science and Eng., University of Florida, Gainesville, 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Dept. of Computer and Information Science and Eng., University of Florida, Gainesville, 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027152170","display_name":"Chunglae Cho","orcid":"https://orcid.org/0000-0003-1194-2987"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chunglae Cho","raw_affiliation_strings":["Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA","Dept. of Computer and Information Science and Eng., University of Florida, Gainesville, 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Dept. of Computer and Information Science and Eng., University of Florida, Gainesville, 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053743638","display_name":"Ye Xia","orcid":"https://orcid.org/0000-0002-2313-0102"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ye Xia","raw_affiliation_strings":["Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA","Dept. of Computer and Information Science and Eng., University of Florida, Gainesville, 32611, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]},{"raw_affiliation_string":"Dept. of Computer and Information Science and Eng., University of Florida, Gainesville, 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":null,"first_page":"5857","last_page":"5862"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","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/T10742","display_name":"Peer-to-Peer Network Technologies","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.9993000030517578,"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.9912999868392944,"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/multicast","display_name":"Multicast","score":0.8930637836456299},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7666131854057312},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.756186842918396},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6753574013710022},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5072226524353027},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44420287013053894},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4370267391204834},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32055890560150146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3098090887069702},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2093939185142517}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8930637836456299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7666131854057312},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.756186842918396},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6753574013710022},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5072226524353027},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44420287013053894},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4370267391204834},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32055890560150146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3098090887069702},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2093939185142517},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cdc.2009.5399592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2009.5399592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.524.6248","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.524.6248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cise.ufl.edu/~yx1/publications/Multicast_colgen.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.744.5047","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.744.5047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1307.2984.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1601770119","https://openalex.org/W1656271119","https://openalex.org/W1833312001","https://openalex.org/W1901187898","https://openalex.org/W1968497507","https://openalex.org/W1983799289","https://openalex.org/W1988411989","https://openalex.org/W1990571240","https://openalex.org/W2009976792","https://openalex.org/W2032334504","https://openalex.org/W2032775246","https://openalex.org/W2098779032","https://openalex.org/W2105310795","https://openalex.org/W2108799357","https://openalex.org/W2109055312","https://openalex.org/W2111340287","https://openalex.org/W2111639886","https://openalex.org/W2111653376","https://openalex.org/W2117911228","https://openalex.org/W2122519207","https://openalex.org/W2140053824","https://openalex.org/W2141361935","https://openalex.org/W2155858227","https://openalex.org/W2156214642","https://openalex.org/W2157123777","https://openalex.org/W2161051913","https://openalex.org/W2161615677","https://openalex.org/W2163634514","https://openalex.org/W2168983077","https://openalex.org/W2399307553","https://openalex.org/W2537443178","https://openalex.org/W2787523326","https://openalex.org/W4231419093","https://openalex.org/W4234534407","https://openalex.org/W4251767568","https://openalex.org/W4254090244","https://openalex.org/W6642392778","https://openalex.org/W6647966941","https://openalex.org/W6658371193","https://openalex.org/W6677449507","https://openalex.org/W6678431471","https://openalex.org/W6680817513","https://openalex.org/W6712606121"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224"],"abstract_inverted_index":{"The":[0,102,155],"paper":[1],"addresses":[2],"the":[3,20,60,81,85,91,94,98,124,142,148,152,180,188,194,200,204,216,226],"problem":[4,82,206],"of":[5,83,93,110,161,182,190,228],"massive":[6],"content":[7],"distribution":[8],"in":[9,141,151],"a":[10,75,117,127,163,174],"network":[11,99],"where":[12],"multiple":[13,66,111],"sessions":[14,21,36,49,67,230],"coexist.":[15],"In":[16,32],"more":[17,212],"traditional":[18],"approaches,":[19],"form":[22],"separate":[23],"overlay":[24,77],"networks":[25],"and":[26,120,136],"operate":[27],"independently":[28],"from":[29,39],"each":[30,71,134],"other.":[31],"this":[33,56,170],"case,":[34],"some":[35],"may":[37],"suffer":[38],"insufficient":[40],"resources":[41],"(e.g.,":[42],"aggregate":[43],"upload":[44],"bandwidth)":[45],"even":[46],"though":[47],"other":[48,72],"have":[50],"excessive":[51],"resources.":[52],"To":[53],"cope":[54,168],"with":[55,70,169,231],"problem,":[57],"we":[58,186],"consider":[59],"universal":[61,223],"swarming":[62,224],"approach,":[63],"which":[64,178],"allows":[65],"to":[68,89,106,147,193,203,209,215,234],"cooperate":[69],"by":[73,172],"forming":[74],"shared":[76],"network.":[78],"We":[79,115,167,197],"formulate":[80],"finding":[84,162],"optimal":[86,108,149],"resource":[87],"allocation":[88],"maximize":[90],"sum":[92],"session":[95,132],"utilities":[96],"under":[97],"capacity":[100],"constraints.":[101],"solution":[103,150,156],"turns":[104,207],"out":[105,208],"be":[107,210],"sharing":[109],"minimum-cost":[112,164],"multicast":[113,129],"trees.":[114],"present":[116],"subgradient":[118],"algorithm":[119,125],"prove":[121],"that,":[122],"although":[123],"uses":[126],"single":[128],"tree":[130],"per":[131],"at":[133],"iteration":[135],"hence":[137],"does":[138],"not":[139],"converge":[140],"conventional":[143],"sense,":[144],"it":[145],"converges":[146],"time-average":[153],"sense.":[154],"involves":[157],"an":[158],"NP-hard":[159],"subproblem":[160],"Steiner":[165],"tree.":[166],"difficulty":[171],"using":[173],"column":[175],"generation":[176],"method,":[177],"reduces":[179],"number":[181],"Steiner-tree":[183,195,217],"computations.":[184],"Furthermore,":[185],"allow":[187],"use":[189],"approximate":[191],"solutions":[192],"subproblem.":[196,218],"show":[198],"that":[199,214,222],"approximation":[201],"ratio":[202],"overall":[205],"no":[211],"than":[213],"Simulation":[219],"results":[220],"demonstrate":[221],"improves":[225],"performance":[227],"resource-poor":[229],"negligible":[232],"impact":[233],"resource-rich":[235],"sessions.":[236]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}