{"id":"https://openalex.org/W2014910499","doi":"https://doi.org/10.1145/1730836.1730857","title":"Quality-aware segment transmission scheduling in peer-to-peer streaming systems","display_name":"Quality-aware segment transmission scheduling in peer-to-peer streaming systems","publication_year":2010,"publication_date":"2010-02-22","ids":{"openalex":"https://openalex.org/W2014910499","doi":"https://doi.org/10.1145/1730836.1730857","mag":"2014910499"},"language":"en","primary_location":{"id":"doi:10.1145/1730836.1730857","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1730836.1730857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first annual ACM SIGMM conference on Multimedia systems","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/A5034696208","display_name":"Cheng-Hsin Hsu","orcid":"https://orcid.org/0000-0002-8116-2591"},"institutions":[{"id":"https://openalex.org/I58534130","display_name":"Deutsche Telekom (United Kingdom)","ror":"https://ror.org/00qxrgg46","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210093367","https://openalex.org/I58534130"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Cheng-Hsin Hsu","raw_affiliation_strings":["Deutsche Telekom R&D Lab USA, Los Altos, CA, USA","Deutsche Telekom R&D Laboratories USA, Los Altos, CA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Deutsche Telekom R&D Lab USA, Los Altos, CA, USA","institution_ids":[]},{"raw_affiliation_string":"Deutsche Telekom R&D Laboratories USA, Los Altos, CA, USA#TAB#","institution_ids":["https://openalex.org/I58534130"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084024266","display_name":"Mohamed Hefeeda","orcid":"https://orcid.org/0000-0003-3261-4376"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohamed Hefeeda","raw_affiliation_strings":["Simon Fraser University, Surrey, BC, Canada","Simon Fraser University, Surrey, BC, CANADA"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Surrey, BC, Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"Simon Fraser University, Surrey, BC, CANADA","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034696208"],"corresponding_institution_ids":["https://openalex.org/I58534130"],"apc_list":null,"apc_paid":null,"fwci":3.9173,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.93639435,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"180"},"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.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/T10742","display_name":"Peer-to-Peer Network Technologies","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/T11478","display_name":"Caching and Content Delivery","score":0.9911999702453613,"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/T10741","display_name":"Video Coding and Compression Technologies","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8412123918533325},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6183151006698608},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5386919975280762},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.529042661190033},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5078802704811096},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4974670708179474},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4614170491695404},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.45982861518859863},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4401816129684448},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4139060080051422},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38886937499046326},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3413058817386627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3121318221092224},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2780362367630005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0775785744190216}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8412123918533325},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6183151006698608},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5386919975280762},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.529042661190033},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5078802704811096},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4974670708179474},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4614170491695404},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.45982861518859863},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4401816129684448},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4139060080051422},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38886937499046326},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3413058817386627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3121318221092224},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2780362367630005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0775785744190216},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1730836.1730857","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1730836.1730857","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first annual ACM SIGMM conference on Multimedia systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.211.5978","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.211.5978","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sfu.ca/~mhefeeda/Papers/mmsys10_segmentScheduling.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1481550144","https://openalex.org/W1509805685","https://openalex.org/W1513710402","https://openalex.org/W1547737876","https://openalex.org/W1967216298","https://openalex.org/W2005526720","https://openalex.org/W2007087980","https://openalex.org/W2009844010","https://openalex.org/W2042633311","https://openalex.org/W2058733713","https://openalex.org/W2065843258","https://openalex.org/W2069832779","https://openalex.org/W2083408498","https://openalex.org/W2090958693","https://openalex.org/W2104370840","https://openalex.org/W2117760870","https://openalex.org/W2121129818","https://openalex.org/W2121467649","https://openalex.org/W2124181363","https://openalex.org/W2127494222","https://openalex.org/W2135980240","https://openalex.org/W2141954481","https://openalex.org/W2146786088","https://openalex.org/W2147657151","https://openalex.org/W2151624135","https://openalex.org/W2155901800","https://openalex.org/W2247090680","https://openalex.org/W2341350247","https://openalex.org/W4239337465","https://openalex.org/W4242418714"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W4281297310","https://openalex.org/W2142195909"],"abstract_inverted_index":{"In":[0],"peer-to-peer":[1],"(P2P)":[2],"mesh-based":[3],"streaming":[4,51,112,167,185,193],"systems,":[5],"each":[6,37],"video":[7,67,196,215,232,270],"sequence":[8],"is":[9,77,103,107,140],"typically":[10],"divided":[11],"into":[12],"segments,":[13],"which":[14,121],"are":[15],"then":[16],"streamed":[17],"from":[18],"multiple":[19],"senders":[20,30],"to":[21,27,63,145,265,274],"a":[22,33,117,151,162],"receiver.":[23,71],"The":[24],"receiver":[25],"needs":[26],"coordinate":[28],"the":[29,42,55,65,70,129,137,146,155,178,236,241,253],"by":[31,263],"specifying":[32],"transmission":[34,60,123],"schedule":[35],"for":[36,87,110,165],"of":[38,57,69,230,235],"them.":[39],"We":[40,53,72,79,153,169],"consider":[41],"scheduling":[43,58,174],"problem":[44,56,76],"in":[45,61,161,177,182,220,228,260,268,277],"both":[46],"live":[47],"and":[48,90,106,158,180,192,201,223,239,272],"on-demand":[49],"P2P":[50,166,184,190],"systems.":[52,113,168,186],"formulate":[54],"segment":[59],"order":[62],"maximize":[64],"perceived":[66,214,231,269],"quality":[68,271],"prove":[73],"that":[74,136,206,252],"this":[75,88],"NP-Complete.":[78],"present":[80],"an":[81,96],"integer":[82],"linear":[83],"programming":[84],"(ILP)":[85],"formulation":[86],"problem,":[89],"we":[91,115,134,204],"optimally":[92],"solve":[93],"it":[94],"using":[95],"ILP":[97],"solver.":[98],"This":[99],"optimal":[100,148,159],"solution,":[101],"however,":[102],"computationally":[104],"expensive":[105],"not":[108],"suitable":[109],"real-time":[111],"Thus,":[114],"propose":[116],"polynomial-time":[118],"approximation":[119,138,157,209],"algorithm,":[120],"yields":[122],"schedules":[124],"with":[125,198],"analytical":[126],"guarantees":[127],"on":[128],"worst-case":[130],"performance.":[131],"More":[132],"precisely,":[133],"show":[135],"factor":[139],"at":[141],"most":[142],"3,":[143],"compared":[144],"absolutely":[147],"solution":[149],"as":[150],"benchmark.":[152],"implement":[154,171],"proposed":[156,176,208,254],"algorithms":[160,175,227,258],"packet-level":[163],"simulator":[164],"also":[170],"two":[172],"other":[173,226],"literature":[179],"used":[181,259],"popular":[183],"By":[187],"simulating":[188],"large":[189],"systems":[191,262],"nine":[194],"real":[195,221],"sequences":[197],"diverse":[199],"visual":[200],"motion":[202],"characteristics,":[203],"demonstrate":[205],"our":[207,248],"algorithm:":[210],"(i)":[211],"produces":[212],"near-optimal":[213],"quality,":[216,233],"(ii)":[217],"can":[218],"run":[219],"time,":[222],"(iii)":[224],"outperforms":[225,256],"terms":[229],"smoothness":[234],"rendered":[237],"videos,":[238],"balancing":[240],"load":[242],"across":[243],"sending":[244],"peers.":[245],"For":[246],"example,":[247],"simulation":[249],"results":[250],"indicate":[251],"algorithm":[255],"heuristic":[257],"current":[261],"up":[264,273],"8":[266],"dB":[267],"20":[275],"%":[276],"continuity":[278],"index.":[279]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}