{"id":"https://openalex.org/W2066812402","doi":"https://doi.org/10.1145/1292331.1292334","title":"A dynamic programming method for optimal scheduling in high speed downlink packet access","display_name":"A dynamic programming method for optimal scheduling in high speed downlink packet access","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2066812402","doi":"https://doi.org/10.1145/1292331.1292334","mag":"2066812402"},"language":"en","primary_location":{"id":"doi:10.1145/1292331.1292334","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1292331.1292334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd international conference on Mobile technology, applications & systems  - Mobility '06","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/A5039116265","display_name":"Patrik Bj\u00f6rklund","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166486","display_name":"Norrk\u00f6ping Hospital","ror":"https://ror.org/04g33m791","country_code":"SE","type":"healthcare","lineage":["https://openalex.org/I4210166486"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Patrik Bj\u00f6rklund","raw_affiliation_strings":["Link\u00f6ping Institute of Technology, Norrk\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Link\u00f6ping Institute of Technology, Norrk\u00f6ping, Sweden","institution_ids":["https://openalex.org/I4210166486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082032400","display_name":"Peter V\u00e4rbrand","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166486","display_name":"Norrk\u00f6ping Hospital","ror":"https://ror.org/04g33m791","country_code":"SE","type":"healthcare","lineage":["https://openalex.org/I4210166486"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Peter V\u00e4rbrand","raw_affiliation_strings":["Link\u00f6ping Institute of Technology, Norrk\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Link\u00f6ping Institute of Technology, Norrk\u00f6ping, Sweden","institution_ids":["https://openalex.org/I4210166486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100657039","display_name":"Di Yuan","orcid":"https://orcid.org/0000-0001-8119-5206"},"institutions":[{"id":"https://openalex.org/I4210166486","display_name":"Norrk\u00f6ping Hospital","ror":"https://ror.org/04g33m791","country_code":"SE","type":"healthcare","lineage":["https://openalex.org/I4210166486"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Di Yuan","raw_affiliation_strings":["Link\u00f6ping Institute of Technology, Norrk\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Link\u00f6ping Institute of Technology, Norrk\u00f6ping, Sweden","institution_ids":["https://openalex.org/I4210166486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039116265"],"corresponding_institution_ids":["https://openalex.org/I4210166486"],"apc_list":null,"apc_paid":null,"fwci":0.3761,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65274536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10575","display_name":"Wireless Communication Networks Research","score":0.9980999827384949,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.7797094583511353},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.6026383638381958},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5806460380554199},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5071902275085449},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4595325291156769},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.41924339532852173},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.41847503185272217},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4080371856689453},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.199753999710083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13060355186462402},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10963043570518494}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7797094583511353},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.6026383638381958},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5806460380554199},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5071902275085449},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4595325291156769},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41924339532852173},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.41847503185272217},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4080371856689453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.199753999710083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13060355186462402},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10963043570518494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1292331.1292334","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1292331.1292334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd international conference on Mobile technology, applications & systems  - Mobility '06","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320337373","display_name":"Center for Information Technology","ror":"https://ror.org/03jh5a977"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1518384680","https://openalex.org/W1526501235","https://openalex.org/W1538972408","https://openalex.org/W1544143345","https://openalex.org/W1604502797","https://openalex.org/W1945959526","https://openalex.org/W1987497363","https://openalex.org/W2066671865","https://openalex.org/W2118325782","https://openalex.org/W2118925668","https://openalex.org/W2156084854","https://openalex.org/W2160512021"],"related_works":["https://openalex.org/W2548963335","https://openalex.org/W2159941915","https://openalex.org/W1995129237","https://openalex.org/W1761601995","https://openalex.org/W4300468626","https://openalex.org/W2904599916","https://openalex.org/W2097713053","https://openalex.org/W4321608401","https://openalex.org/W1781596060","https://openalex.org/W2151588880"],"abstract_inverted_index":{"High":[0],"Speed":[1],"Downlink":[2],"Packet":[3],"Access":[4,15],"(HSDPA)":[5],"is":[6,115],"a":[7,53,63,72,103,110,127,144,174],"data":[8,125,183],"service":[9,24],"in":[10,41,82,91,185],"Wideband":[11],"Code":[12],"Division":[13],"Multiple":[14],"(WCDMA)":[16],"networks.":[17],"Resources":[18],"shared":[19],"among":[20],"users":[21],"accessing":[22],"network":[23],"through":[25],"HSDPA":[26,49,150],"include":[27],"transmission":[28,92],"power":[29,93],"and":[30,77,94,114,162],"channelization":[31,95],"codes.":[32,96],"Typically,":[33],"heuristic":[34,188],"rules":[35],"are":[36],"used":[37,69],"for":[38,56,86,135,139],"resource":[39,90],"allocation":[40],"HSDPA.":[42],"In":[43],"this":[44,57],"paper":[45],"we":[46,101],"study":[47,146],"optimal":[48],"scheduling.":[50],"We":[51,142],"present":[52,143],"mathematical":[54],"model":[55,60,84],"problem.":[58],"The":[59,80,107],"involves":[61],"maximizing":[62],"utility":[64],"function":[65],"which":[66],"can":[67],"be":[68],"to":[70,117,147,152,173,187],"achieve":[71],"balance":[73],"between":[74],"system":[75],"throughput":[76,184],"user":[78,178],"fairness.":[79],"constraints":[81],"the":[83,99,119,132,158],"account":[85],"limited":[87],"amount":[88],"of":[89,177],"To":[97],"solve":[98],"model,":[100],"propose":[102],"dynamic":[104],"programming":[105],"method.":[106],"method":[108,133],"has":[109,126],"predictable":[111],"execution":[112,140],"time,":[113],"guaranteed":[116],"find":[118],"global":[120],"optimum":[121],"provided":[122],"that":[123,169],"input":[124],"sufficiently":[128],"good":[129],"granularity.":[130],"Moreover,":[131],"allows":[134],"trading":[136],"solution":[137],"precision":[138],"time.":[141],"simulation":[145,166],"compare":[148],"optimized":[149,170],"scheduling":[151,155,171],"some":[153],"other":[154],"strategies,":[156],"including":[157],"round":[159],"robin":[160],"scheme":[161],"two":[163],"heuristics.":[164],"Our":[165],"results":[167],"show":[168],"leads":[172],"similar":[175],"degree":[176],"fairness":[179],"but":[180],"significantly":[181],"higher":[182],"comparison":[186],"schemes.":[189]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}