{"id":"https://openalex.org/W2086335213","doi":"https://doi.org/10.1109/icccn.2013.6614138","title":"Fast Near-Optimal Algorithm for Delivering Multiple Live Video Channels in CDNs","display_name":"Fast Near-Optimal Algorithm for Delivering Multiple Live Video Channels in CDNs","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2086335213","doi":"https://doi.org/10.1109/icccn.2013.6614138","mag":"2086335213"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2013.6614138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"},"type":"preprint","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/A5108101484","display_name":"Jiayi Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jiayi Liu","raw_affiliation_strings":["T\u00e9l\u00e9com Bretagne, France","RSM - D\u00e9partement R\u00e9seaux, S\u00e9curit\u00e9 et Multim\u00e9dia (T\u00e9l\u00e9com Bretagne - Campus de rennes - 2 rue de la Chata\u00eegneraie BP 78 35512 Cesson S\u00e9vign\u00e9 Cedex  - France)","REOP - R\u00e9seaux d'op\u00e9rateurs (T\u00e9l\u00e9com Bretagne - Technop\u00f4le Brest Iroise - CS 83818 - 29238 BREST Cedex 3 /\r\nIRISA - Campus de Beaulieu 35042 Rennes cedex - France)"],"affiliations":[{"raw_affiliation_string":"T\u00e9l\u00e9com Bretagne, France","institution_ids":[]},{"raw_affiliation_string":"RSM - D\u00e9partement R\u00e9seaux, S\u00e9curit\u00e9 et Multim\u00e9dia (T\u00e9l\u00e9com Bretagne - Campus de rennes - 2 rue de la Chata\u00eegneraie BP 78 35512 Cesson S\u00e9vign\u00e9 Cedex  - France)","institution_ids":[]},{"raw_affiliation_string":"REOP - R\u00e9seaux d'op\u00e9rateurs (T\u00e9l\u00e9com Bretagne - Technop\u00f4le Brest Iroise - CS 83818 - 29238 BREST Cedex 3 /\r\nIRISA - Campus de Beaulieu 35042 Rennes cedex - France)","institution_ids":["https://openalex.org/I2802519937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035357985","display_name":"Gwendal Simon","orcid":"https://orcid.org/0000-0002-7282-918X"},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gwendal Simon","raw_affiliation_strings":["T\u00e9l\u00e9com Bretagne, France","RSM - D\u00e9partement R\u00e9seaux, S\u00e9curit\u00e9 et Multim\u00e9dia (T\u00e9l\u00e9com Bretagne - Campus de rennes - 2 rue de la Chata\u00eegneraie BP 78 35512 Cesson S\u00e9vign\u00e9 Cedex  - France)","REOP - R\u00e9seaux d'op\u00e9rateurs (T\u00e9l\u00e9com Bretagne - Technop\u00f4le Brest Iroise - CS 83818 - 29238 BREST Cedex 3 /\r\nIRISA - Campus de Beaulieu 35042 Rennes cedex - France)"],"affiliations":[{"raw_affiliation_string":"T\u00e9l\u00e9com Bretagne, France","institution_ids":[]},{"raw_affiliation_string":"RSM - D\u00e9partement R\u00e9seaux, S\u00e9curit\u00e9 et Multim\u00e9dia (T\u00e9l\u00e9com Bretagne - Campus de rennes - 2 rue de la Chata\u00eegneraie BP 78 35512 Cesson S\u00e9vign\u00e9 Cedex  - France)","institution_ids":[]},{"raw_affiliation_string":"REOP - R\u00e9seaux d'op\u00e9rateurs (T\u00e9l\u00e9com Bretagne - Technop\u00f4le Brest Iroise - CS 83818 - 29238 BREST Cedex 3 /\r\nIRISA - Campus de Beaulieu 35042 Rennes cedex - France)","institution_ids":["https://openalex.org/I2802519937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108101484"],"corresponding_institution_ids":["https://openalex.org/I2802519937"],"apc_list":null,"apc_paid":null,"fwci":0.7556,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76784428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"44","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9973999857902527,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9972000122070312,"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/computer-science","display_name":"Computer science","score":0.8733538389205933},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.7446182370185852},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6296234130859375},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5543491244316101},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5457056164741516},{"id":"https://openalex.org/keywords/content-delivery","display_name":"Content delivery","score":0.4801020920276642},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4373214840888977},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43623900413513184},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41389721632003784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32578152418136597},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32035768032073975}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8733538389205933},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7446182370185852},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6296234130859375},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5543491244316101},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5457056164741516},{"id":"https://openalex.org/C2986847828","wikidata":"https://www.wikidata.org/wiki/Q269415","display_name":"Content delivery","level":2,"score":0.4801020920276642},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4373214840888977},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43623900413513184},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41389721632003784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32578152418136597},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32035768032073975},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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.1109/icccn.2013.6614138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00908757v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00908757","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICCCN 2013 : 22nd International Conference on Computer Communications and Networks, Jul 2013, Nassau, Bahamas. ⟨10.1109/ICCCN.2013.6614138⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1975884818","https://openalex.org/W1976986662","https://openalex.org/W1979790485","https://openalex.org/W2008657938","https://openalex.org/W2010597367","https://openalex.org/W2010769520","https://openalex.org/W2010934326","https://openalex.org/W2047228740","https://openalex.org/W2055505431","https://openalex.org/W2059119338","https://openalex.org/W2087680776","https://openalex.org/W2095825177","https://openalex.org/W2115727680","https://openalex.org/W2127890639","https://openalex.org/W2138542287","https://openalex.org/W2151657298","https://openalex.org/W2153446963","https://openalex.org/W2159115597","https://openalex.org/W2159186552","https://openalex.org/W2280073618","https://openalex.org/W3144208063","https://openalex.org/W4230454433","https://openalex.org/W6674479287","https://openalex.org/W6680456129"],"related_works":["https://openalex.org/W2006251942","https://openalex.org/W2364741597","https://openalex.org/W1492103595","https://openalex.org/W1864774435","https://openalex.org/W946352265","https://openalex.org/W3020787026","https://openalex.org/W2334479858","https://openalex.org/W2799209613","https://openalex.org/W1971388572","https://openalex.org/W1507702947"],"abstract_inverted_index":{"Content":[0],"Delivery":[1],"Networks":[2],"(CDNs)":[3],"are":[4,131,140],"confronted":[5],"with":[6,23,126],"a":[7,39,45,79,95,108,118,157],"sharp":[8],"increase":[9],"in":[10,59,71,88,113,156],"traffic":[11],"related":[12],"to":[13,43,55,121],"live":[14,85],"video":[15,86],"(channel)":[16],"streaming.":[17],"Previous":[18],"theoretical":[19,154],"models":[20],"that":[21,101,111,130],"deal":[22],"streaming":[24,82,147],"capacity":[25],"problems":[26],"do":[27],"not":[28,62,69],"capture":[29],"the":[30,141,145],"emerging":[31],"reality":[32],"faced":[33],"by":[34],"today's":[35],"CDNs.":[36,89,115],"In":[37,74],"particular,":[38],"modern":[40],"CDN":[41],"has":[42],"deliver":[44],"large":[46,134],"set":[47],"of":[48,159],"independent":[49],"non-divisible":[50],"data":[51],"streams,":[52],"which":[53],"need":[54],"be":[56],"either":[57],"delivered":[58,63],"whole,":[60],"or":[61],"at":[64],"all.":[65],"This":[66],"constraint":[67],"is":[68,103],"addressed":[70],"previous":[72],"works.":[73],"this":[75,91],"paper":[76],"we":[77,93,106],"identify":[78],"new,":[80],"discretized":[81,146],"model":[83,92],"for":[84,133,144],"delivery":[87],"For":[90],"formulate":[94],"general":[96],"optimization":[97],"problem":[98],"and":[99,123,149,153],"show":[100],"it":[102],"NP-complete.":[104],"Then":[105],"study":[107],"practical":[109,152],"scenario":[110],"occurs":[112],"real":[114],"We":[116],"present":[117],"fast,":[119],"easy":[120],"implement,":[122],"near-optimal":[124],"algorithm":[125],"performance":[127],"approximation":[128],"ratios":[129],"negligible":[132],"network.":[135],"To":[136],"our":[137],"knowledge,":[138],"these":[139],"first":[142],"results":[143],"model,":[148],"have":[150],"both":[151],"importance":[155],"topic":[158],"growing":[160],"criticality.":[161]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}