{"id":"https://openalex.org/W2170447782","doi":"https://doi.org/10.1109/infcom.2004.1354606","title":"On the optimality of an index policy for bandwidth allocation with delayed state observation and differentiated services","display_name":"On the optimality of an index policy for bandwidth allocation with delayed state observation and differentiated services","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2170447782","doi":"https://doi.org/10.1109/infcom.2004.1354606","mag":"2170447782"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2004.1354606","doi":"https://doi.org/10.1109/infcom.2004.1354606","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354606","pdf_url":null,"source":{"id":"https://openalex.org/S7407087743","display_name":"IEEE Conference on Computer Communications (INFOCOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5113671269","display_name":"N. Ehsan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Ehsan","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101967011","display_name":"Mingyan Liu","orcid":"https://orcid.org/0000-0003-3295-9200","observed_orcids":["https://orcid.org/0000-0003-3295-9200"]},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mingyan Liu","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":4.2891,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.94250967,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"1974","last_page":"1983"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9253000020980835,"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.9253000020980835,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.023399999365210533,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.019300000742077827,"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/index-policies","display_name":"index policies","score":0.8960000276565552},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"bandwidth allocation","score":0.9440000057220459},{"id":"https://openalex.org/keywords/differentiated-services","display_name":"differentiated services","score":0.6740000247955322},{"id":"https://openalex.org/keywords/restless-bandits","display_name":"restless bandits","score":0.7350000143051147},{"id":"https://openalex.org/keywords/whittle-index","display_name":"Whittle index","score":0.7279999852180481},{"id":"https://openalex.org/keywords/queue-backlog","display_name":"queue backlog","score":0.6069999933242798},{"id":"https://openalex.org/keywords/bernoulli-arrivals","display_name":"Bernoulli arrivals","score":0.8629999756813049},{"id":"https://openalex.org/keywords/holding-cost-minimization","display_name":"holding cost minimization","score":0.6629999876022339},{"id":"https://openalex.org/keywords/optimal-control","display_name":"optimal control","score":0.40700000524520874}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.7163850665092468},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6073504686355591},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6069241762161255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5697984099388123},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5425896644592285},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.5131102800369263},{"id":"https://openalex.org/C152361515","wikidata":"https://www.wikidata.org/wiki/Q181328","display_name":"Bernoulli's principle","level":2,"score":0.4740210175514221},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.4518652558326721},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26706942915916443},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20044684410095215},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09974363446235657},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2004.1354606","doi":"https://doi.org/10.1109/infcom.2004.1354606","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354606","pdf_url":null,"source":{"id":"https://openalex.org/S7407087743","display_name":"IEEE Conference on Computer Communications (INFOCOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.6091","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~mingyan/pub/bw-alloc-2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/16","score":0.7900000214576721,"display_name":"Peace, justice, and strong institutions"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1522904210","https://openalex.org/W2044502527","https://openalex.org/W2056921512","https://openalex.org/W2086474305","https://openalex.org/W2087334858","https://openalex.org/W2114036629","https://openalex.org/W2134833225","https://openalex.org/W2135663206","https://openalex.org/W2153107031","https://openalex.org/W2168823895","https://openalex.org/W2326303085","https://openalex.org/W2333199285"],"related_works":["https://openalex.org/W2121694877","https://openalex.org/W7100939461","https://openalex.org/W2158078977","https://openalex.org/W2153780889","https://openalex.org/W2467243923","https://openalex.org/W1568719565","https://openalex.org/W4399413168","https://openalex.org/W1863038032","https://openalex.org/W2914258540","https://openalex.org/W7096879629"],"abstract_inverted_index":{"We":[0,110,126,170,188],"study":[1],"the":[2,28,34,38,47,52,56,98,121,131,134,139,145,162,164,176,181,191,205,222],"optimality":[3],"of":[4,37,79,91,120,123,133,161],"an":[5,60,112],"index":[6,113,146,165,182,206],"policy":[7,114,147,166,183,207],"for":[8,221],"a":[9,14,23,105,124,196],"bandwidth":[10,193],"allocation":[11,48,194],"problem,":[12],"where":[13],"single":[15],"server":[16,53],"is":[17,42,50,95,136,148,167,184,215,219],"allocated":[18],"among":[19],"N":[20],"queues":[21],"in":[22,44,65,213],"slotted":[24],"system":[25,39,135],"based":[26],"on":[27],"queue":[29],"backlog":[30,57],"information.":[31],"Due":[32],"to":[33,87,96],"physical":[35],"nature":[36],"this":[40],"information":[41,58],"delayed,":[43],"that":[45,129,157,174],"when":[46,130],"decision":[49],"made,":[51],"only":[54,216],"has":[55],"from":[59,138],"earlier":[61],"time.":[62],"This":[63],"results":[64],"imperfect":[66],"and":[67,200],"partial":[68],"state":[69,122,132],"observation.":[70],"Queues":[71],"have":[72],"Bernoulli":[73],"arrival":[74],"processes":[75],"with":[76,115],"different":[77,84],"probabilities":[78],"arrival,":[80],"as":[81,83,118,195],"well":[82],"buffering/holding":[85],"costs":[86],"differentiate":[88],"heterogeneous":[89],"classes":[90],"traffic/service.":[92],"The":[93],"objective":[94],"minimize":[97],"expected":[99],"total":[100],"discounted":[101],"holding":[102],"cost":[103],"over":[104],"finite":[106,223],"or":[107],"infinite":[108],"horizon.":[109],"introduce":[111],"indices":[116,163],"defined":[117],"functions":[119],"queue.":[125],"first":[127],"show":[128,156,171,201],"away":[137],"boundary,":[140],"i.e.,":[141],"no":[142],"empty":[143,153],"queues,":[144,154],"optimal.":[149,169,187],"When":[150],"there":[151],"are":[152],"we":[155],"under":[158,202],"sufficient":[159],"separation":[160,177],"still":[168],"by":[172],"example":[173],"if":[175],"does":[178],"not":[179,185],"hold,":[180],"necessarily":[186],"then":[189],"formulate":[190],"optimal":[192,220],"restless":[197],"bandit":[198],"problem":[199],"what":[203],"conditions":[204],"calculated":[208],"using":[209],"Whittle's":[210],"heuristics,":[211],"which":[212],"general":[214],"asymptotically":[217],"optimal,":[218],"case.":[224]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}