{"id":"https://openalex.org/W2168010583","doi":"https://doi.org/10.1109/glocom.2003.1258938","title":"Dynamic resource allocation of GPS queues with leaky buckets","display_name":"Dynamic resource allocation of GPS queues with leaky buckets","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2168010583","doi":"https://doi.org/10.1109/glocom.2003.1258938","mag":"2168010583"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2003.1258938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drum.lib.umd.edu/bitstreams/51dadb81-0504-4dd5-8294-417561ddbf20/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017165077","display_name":"P. Tinnakomsrisuphap","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. Tinnakomsrisuphap","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074725207","display_name":"Sarut Vanichpun","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Vanichpun","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039201084","display_name":"Richard J. La","orcid":"https://orcid.org/0000-0002-4836-8475"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.J. La","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017165077"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.7566,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79693073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"3777","last_page":"3781"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983999729156494,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983999729156494,"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/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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9958000183105469,"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.7748879790306091},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5660951137542725},{"id":"https://openalex.org/keywords/hindsight-bias","display_name":"Hindsight bias","score":0.5543790459632874},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5308533310890198},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5233970284461975},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5173099040985107},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.497844934463501},{"id":"https://openalex.org/keywords/global-positioning-system","display_name":"Global Positioning System","score":0.48792764544487},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4631117880344391},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.439158171415329},{"id":"https://openalex.org/keywords/markovian-arrival-process","display_name":"Markovian arrival process","score":0.42116910219192505},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41374871134757996},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.41351601481437683},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33151715993881226},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26048368215560913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2578223943710327},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12638768553733826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7748879790306091},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5660951137542725},{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.5543790459632874},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5308533310890198},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5233970284461975},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5173099040985107},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.497844934463501},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.48792764544487},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4631117880344391},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.439158171415329},{"id":"https://openalex.org/C192163390","wikidata":"https://www.wikidata.org/wiki/Q612061","display_name":"Markovian arrival process","level":3,"score":0.42116910219192505},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41374871134757996},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.41351601481437683},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33151715993881226},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26048368215560913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2578223943710327},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12638768553733826},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2003.1258938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"},{"id":"pmh:oai:drum.lib.umd.edu:1903/6404","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/6404","pdf_url":"https://drum.lib.umd.edu/bitstreams/51dadb81-0504-4dd5-8294-417561ddbf20/download","source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/6404","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/6404","pdf_url":"https://drum.lib.umd.edu/bitstreams/51dadb81-0504-4dd5-8294-417561ddbf20/download","source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2168010583.pdf"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W110292346","https://openalex.org/W1994732637","https://openalex.org/W2034713309","https://openalex.org/W2098432798","https://openalex.org/W2113439245","https://openalex.org/W2113439731","https://openalex.org/W2168010583","https://openalex.org/W2176566884","https://openalex.org/W3045583888","https://openalex.org/W4285719527","https://openalex.org/W7018705414"],"related_works":["https://openalex.org/W3197854638","https://openalex.org/W3140454661","https://openalex.org/W2139970489","https://openalex.org/W4245029315","https://openalex.org/W1492315459","https://openalex.org/W1512434910","https://openalex.org/W2540910169","https://openalex.org/W3089780453","https://openalex.org/W3148904318","https://openalex.org/W2022803902"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,17,70,91,103],"problem":[3],"of":[4,8,72],"dynamic":[5,58],"resource":[6],"allocation":[7],"a":[9,24,56,63],"GPS":[10],"server":[11],"with":[12,80,106],"two":[13],"traffic":[14,25,31,42,93],"classes":[15],"when":[16],"leaky":[18],"bucket":[19],"scheme":[20],"is":[21,65],"employed":[22],"as":[23],"policing":[26],"mechanism.":[27],"Three":[28],"popular":[29],"input":[30],"models":[32,94],"-":[33,46],"independent":[34],"Poisson":[35],"arrival,":[36],"autoregressive":[37],"model,":[38],"and":[39,86,95,108],"partially":[40],"observed":[41],"(hidden":[43],"Markov":[44],"model)":[45],"are":[47],"investigated.":[48],"Theoretically,":[49],"optimal":[50],"control":[51],"can":[52,100],"be":[53],"obtained":[54],"by":[55],"basic":[57],"programming":[59],"algorithm.":[60],"However,":[61],"such":[62],"solution":[64],"computationally":[66],"prohibitive":[67],"due":[68],"to":[69],"curse":[71],"dimensionality.":[73],"Instead,":[74],"we":[75],"propose":[76],"several":[77],"heuristic":[78],"policies":[79],"improvements":[81],"using":[82],"rollout,":[83,85],"parallel":[84],"hindsight":[87],"optimization":[88],"techniques":[89,99],"under":[90],"aforementioned":[92],"show":[96],"that":[97],"these":[98],"significantly":[101],"reduce":[102],"penalty":[104],"associated":[105],"delays":[107],"dropped":[109],"packets.":[110]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}