{"id":"https://openalex.org/W7133834816","doi":"https://doi.org/10.48550/arxiv.2603.03938","title":"Optimal Short Video Ordering and Transmission Scheduling for Reducing Video Delivery Cost in Peer-to-Peer CDNs","display_name":"Optimal Short Video Ordering and Transmission Scheduling for Reducing Video Delivery Cost in Peer-to-Peer CDNs","publication_year":2026,"publication_date":"2026-03-04","ids":{"openalex":"https://openalex.org/W7133834816","doi":"https://doi.org/10.48550/arxiv.2603.03938"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.03938","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128142538","display_name":"Zhipeng Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Zhipeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102012819","display_name":"Chunxi Li","orcid":"https://orcid.org/0000-0001-5679-1225"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Chunxi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128200412","display_name":"Yongxiang Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Yongxiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22170485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.5965999960899353,"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.5965999960899353,"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.16680000722408295,"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/T11165","display_name":"Image and Video Quality Assessment","score":0.06780000030994415,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/scheduling","display_name":"Scheduling (production processes)","score":0.5809000134468079},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42910000681877136},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3930000066757202},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.388700008392334},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.3840000033378601},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.3637999892234802},{"id":"https://openalex.org/keywords/video-on-demand","display_name":"Video on demand","score":0.3628000020980835},{"id":"https://openalex.org/keywords/cost-reduction","display_name":"Cost reduction","score":0.34619998931884766}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8234999775886536},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5809000134468079},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4964999854564667},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4587000012397766},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.448199987411499},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42910000681877136},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4153999984264374},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.3840000033378601},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.3637999892234802},{"id":"https://openalex.org/C3020512178","wikidata":"https://www.wikidata.org/wiki/Q723685","display_name":"Video on demand","level":2,"score":0.3628000020980835},{"id":"https://openalex.org/C2778820799","wikidata":"https://www.wikidata.org/wiki/Q3454688","display_name":"Cost reduction","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3456000089645386},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.33500000834465027},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.33070001006126404},{"id":"https://openalex.org/C2776061582","wikidata":"https://www.wikidata.org/wiki/Q25325231","display_name":"Mobile edge computing","level":3,"score":0.31540000438690186},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.03938","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.03938","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.03938","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.03938","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"explosive":[1],"growth":[2],"of":[3,44,56,74,79,122,139,162,192],"short":[4,57],"video":[5,58,103],"platforms":[6],"has":[7],"generated":[8],"a":[9,29,71,135,175,204,215],"massive":[10],"surge":[11],"in":[12,224],"global":[13],"traffic,":[14],"imposing":[15],"heavy":[16],"financial":[17],"burdens":[18],"on":[19],"content":[20],"providers.":[21],"While":[22],"Peer-to-Peer":[23],"Content":[24],"Delivery":[25],"Networks":[26],"(PCDNs)":[27],"offer":[28],"cost-effective":[30],"alternative":[31],"by":[32,69],"leveraging":[33],"resource-constrained":[34],"edge":[35],"nodes,":[36],"the":[37,50,76,85,120,130,140,159,167],"limited":[38],"storage":[39],"and":[40,89,105,165,200,217],"concurrent":[41],"service":[42],"capacities":[43],"these":[45,163],"peers":[46],"struggle":[47],"to":[48,65,99,124,143,194,197,203],"absorb":[49],"intense":[51],"temporal":[52,116],"demand":[53],"spikes":[54],"characteristic":[55],"consumption.":[59],"In":[60],"this":[61],"paper,":[62],"we":[63,133,157],"propose":[64],"minimize":[66],"transmission":[67,106],"costs":[68],"exploiting":[70],"novel":[72],"degree":[73],"freedom,":[75],"inherent":[77],"flexibility":[78,213],"server-driven":[80],"playback":[81,211],"sequences.":[82],"We":[83],"formulate":[84],"Optimal":[86],"Video":[87],"Ordering":[88],"Transmission":[90],"Scheduling":[91],"(OVOTS)":[92],"problem":[93,142],"as":[94,214],"an":[95,144],"Integer":[96],"Linear":[97],"Program":[98],"jointly":[100],"optimize":[101],"personalized":[102],"ordering":[104],"scheduling.":[107],"By":[108],"strategically":[109],"permuting":[110],"playlists,":[111],"our":[112],"approach":[113],"proactively":[114],"smooths":[115],"traffic":[117],"peaks,":[118],"maximizing":[119],"offloading":[121],"requests":[123],"low-cost":[125],"peer":[126],"nodes.":[127],"To":[128],"solve":[129],"OVOTS":[131,141],"problem,":[132],"provide":[134],"rigorous":[136],"theoretical":[137],"reduction":[138],"auxiliary":[145],"Minimum":[146],"Cost":[147],"Maximum":[148],"Flow":[149],"(MCMF)":[150],"formulation.":[151],"Leveraging":[152],"K\u00f6nig's":[153],"Edge":[154,171],"Coloring":[155,172],"Theorem,":[156],"prove":[158],"strict":[160],"equivalence":[161],"formulations":[164],"develop":[166],"Minimum-cost":[168],"Maximum-flow":[169],"with":[170],"(MMEC)":[173],"algorithm,":[174],"globally":[176],"optimal,":[177],"polynomial-time":[178],"solution.":[179],"Extensive":[180],"simulations":[181],"demonstrate":[182],"that":[183],"MMEC":[184],"significantly":[185],"outperforms":[186],"baseline":[187],"strategies,":[188],"achieving":[189],"cost":[190,222],"reductions":[191],"up":[193],"67%":[195],"compared":[196,202],"random":[198],"scheduling":[199],"36%":[201],"simulated":[205],"annealing":[206],"approach.":[207],"Our":[208],"results":[209],"establish":[210],"sequence":[212],"robust":[216],"highly":[218],"effective":[219],"paradigm":[220],"for":[221],"optimization":[223],"PCDN":[225],"architectures.":[226]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-03-06T00:00:00"}