{"id":"https://openalex.org/W2138238306","doi":null,"title":"Approximate and Data-Driven Dynamic Programming for Queueing Networks","display_name":"Approximate and Data-Driven Dynamic Programming for Queueing Networks","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2138238306","mag":"2138238306"},"language":"en","primary_location":{"id":"mag:2138238306","doi":null,"is_oa":false,"landing_page_url":"https://moallemi.com/ciamac/papers/adp-queueing-2008.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5026049014","display_name":"Ciamac C. Moallemi","orcid":"https://orcid.org/0000-0002-4489-9260","observed_orcids":["https://orcid.org/0000-0002-4489-9260"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ciamac C. Moallemi","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4489-9260","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100662614","display_name":"Sunil Kumar","orcid":"https://orcid.org/0000-0001-9957-5661","observed_orcids":["https://orcid.org/0000-0001-9957-5661"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sunil Kumar","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9957-5661","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045543562","display_name":"Benjamin Van Roy","orcid":"https://orcid.org/0000-0001-8364-3746","observed_orcids":["https://orcid.org/0000-0001-8364-3746"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Van Roy","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8364-3746","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8758,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93011605,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9580000042915344,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9580000042915344,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.010999999940395355,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.002099999925121665,"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/queueing-networks","display_name":"queueing networks","score":0.949999988079071},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.7509999871253967},{"id":"https://openalex.org/keywords/temporal-difference-learning","display_name":"temporal difference learning","score":0.9950000047683716},{"id":"https://openalex.org/keywords/scheduling-policies","display_name":"scheduling policies","score":0.7760000228881836},{"id":"https://openalex.org/keywords/basis-function-selection","display_name":"basis function selection","score":0.8980000019073486},{"id":"https://openalex.org/keywords/asymptotic-regime","display_name":"asymptotic regime","score":0.7129999995231628},{"id":"https://openalex.org/keywords/heavy-traffic","display_name":"heavy traffic","score":0.7649999856948853},{"id":"https://openalex.org/keywords/data-driven-control","display_name":"data-driven control","score":0.7519999742507935},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"reinforcement learning","score":0.6439999938011169}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7631444931030273},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.7448602914810181},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6778864860534668},{"id":"https://openalex.org/C33891772","wikidata":"https://www.wikidata.org/wiki/Q6505536","display_name":"Layered queueing network","level":3,"score":0.6274189949035645},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5402554869651794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4720234274864197},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4204627275466919},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40915900468826294},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2141309678554535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13660591840744019},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2138238306","doi":null,"is_oa":false,"landing_page_url":"https://moallemi.com/ciamac/papers/adp-queueing-2008.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4000000059604645}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W100327610","https://openalex.org/W183991413","https://openalex.org/W1576452626","https://openalex.org/W1601081659","https://openalex.org/W1745373831","https://openalex.org/W1762430620","https://openalex.org/W1968610865","https://openalex.org/W1987611686","https://openalex.org/W1999102639","https://openalex.org/W2003346154","https://openalex.org/W2003798390","https://openalex.org/W2056532936","https://openalex.org/W2062541405","https://openalex.org/W2098432798","https://openalex.org/W2100677568","https://openalex.org/W2103098926","https://openalex.org/W2103468752","https://openalex.org/W2105177639","https://openalex.org/W2105556121","https://openalex.org/W2106017103","https://openalex.org/W2111753883","https://openalex.org/W2115660254","https://openalex.org/W2121863487","https://openalex.org/W2129981463","https://openalex.org/W2130954568","https://openalex.org/W2132127784","https://openalex.org/W2133499361","https://openalex.org/W2135663206","https://openalex.org/W2138178898","https://openalex.org/W2168457715","https://openalex.org/W2170412087","https://openalex.org/W2202514763","https://openalex.org/W3198350258"],"related_works":["https://openalex.org/W7096204360","https://openalex.org/W2346628236","https://openalex.org/W2153337652","https://openalex.org/W2246590502","https://openalex.org/W2672645032","https://openalex.org/W2048113057","https://openalex.org/W1676316967","https://openalex.org/W4229956956","https://openalex.org/W2018395339","https://openalex.org/W2199681782"],"abstract_inverted_index":{"We":[0,102],"develop":[1],"an":[2,62],"approach":[3,106,129],"based":[4],"on":[5,124],"temporal":[6],"dierence":[7],"learning":[8],"to":[9,56,68,75,92,107],"address":[10],"scheduling":[11,85],"problems":[12],"in":[13,21,46,97],"complex":[14],"queueing":[15,114],"networks":[16],"such":[17],"as":[18],"those":[19],"arising":[20],"service,":[22],"communication,":[23],"and":[24,79,119],"manufacturing":[25],"systems.":[26],"One":[27],"novel":[28],"feature":[29],"is":[30,37,50,130,140],"the":[31,40,44,51,98,105,113,135],"selection":[32],"of":[33,43,53,65,77,81,112,138],"basis":[34],"functions,":[35],"which":[36],"motivated":[38],"by":[39],"gross":[41],"behavior":[42],"system":[45],"asymptotic":[47],"regimes.":[48],"Another":[49],"use":[52],"polytopic":[54],"structure":[55,137],"eciently":[57],"identify":[58],"desired":[59],"actions":[60,83],"from":[61],"intractable":[63],"set":[64],"alternatives.":[66],"Application":[67],"input-queued":[69],"crossbar":[70],"switch":[71],"models":[72],"with":[73],"up":[74],"hundreds":[76],"queues":[78],"quadrillions":[80],"alternative":[82],"yield":[84],"policies":[86],"outperforming":[87],"a":[88,108],"heuristic":[89],"recently":[90],"shown":[91],"have":[93],"certain":[94],"optimality":[95],"properties":[96],"heavy":[99],"trac":[100],"scale.":[101],"also":[103],"extend":[104],"setting":[109],"where":[110],"aspects":[111],"network":[115],"are":[116,147],"not":[117],"modeled":[118],"we":[120],"must":[121],"rely":[122],"instead":[123],"empirical":[125],"data.":[126],"This":[127],"data-driven":[128],"useful,":[131],"for":[132],"example,":[133],"when":[134],"statistical":[136],"arrivals":[139],"poorly":[141],"understood":[142],"but":[143],"historical":[144],"data":[145],"traces":[146],"available.":[148]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}