{"id":"https://openalex.org/W2550494792","doi":"https://doi.org/10.1109/allerton.2013.6736576","title":"An infinite server system with general packing constraints: Asymptotic optimality of a greedy randomized algorithm","display_name":"An infinite server system with general packing constraints: Asymptotic optimality of a greedy randomized algorithm","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2550494792","doi":"https://doi.org/10.1109/allerton.2013.6736576","mag":"2550494792"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2013.6736576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2013.6736576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5018196632","display_name":"Alexander Stolyar","orcid":"https://orcid.org/0000-0002-1496-9803"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander L. Stolyar","raw_affiliation_strings":["Bell Labs, Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Labs, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101087537","display_name":"Yuan Zhong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuan Zhong","raw_affiliation_strings":["Bell Labs, Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Labs, Murray Hill, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018196632"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7249,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77905589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"575","last_page":"582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/greedy-algorithm","display_name":"Greedy algorithm","score":0.7901101112365723},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.6810437440872192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5834708213806152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5306552648544312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4769012928009033},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.46306198835372925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3408440053462982},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3224068284034729}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7901101112365723},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.6810437440872192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5834708213806152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5306552648544312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4769012928009033},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.46306198835372925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3408440053462982},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3224068284034729}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2013.6736576","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2013.6736576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1579739398","https://openalex.org/W1967590952","https://openalex.org/W1980171347","https://openalex.org/W1992365301","https://openalex.org/W2022575296","https://openalex.org/W2028776589","https://openalex.org/W2039060503","https://openalex.org/W2039612281","https://openalex.org/W2075873608","https://openalex.org/W2078126958","https://openalex.org/W2081708767","https://openalex.org/W2117839333"],"related_works":["https://openalex.org/W2277088917","https://openalex.org/W2154172459","https://openalex.org/W2809828719","https://openalex.org/W2541760731","https://openalex.org/W2018096104","https://openalex.org/W1827895227","https://openalex.org/W2373750984","https://openalex.org/W4312077400","https://openalex.org/W4382935776","https://openalex.org/W2163115662"],"abstract_inverted_index":{"Motivated":[0],"primarily":[1],"by":[2,56,132],"the":[3,57,70,82,116,129],"problem":[4],"of":[5,8,27,47,85,109,128],"efficient":[6],"assignment":[7],"virtual":[9],"machines":[10,14],"to":[11,41,80,102,121],"physical":[12],"host":[13],"in":[15],"a":[16,107],"network":[17],"cloud,":[18],"we":[19],"consider":[20],"an":[21,92],"infinite-server":[22],"system":[23,71,77],"with":[24],"several":[25,126],"types":[26],"arriving":[28],"customers.":[29],"Multiple":[30],"customers":[31,49],"can":[32],"be":[33],"placed":[34,62],"into":[35],"one":[36],"server":[37],"for":[38,63],"service,":[39],"subject":[40],"general":[42],"\u201cpacking\u201d":[43],"constraints.":[44],"Service":[45],"times":[46],"different":[48],"are":[50,61],"independent,":[51],"even":[52],"if":[53],"served":[54],"simultaneously":[55],"same":[58],"server.":[59],"Customers":[60],"service":[64,73],"immediately":[65],"upon":[66],"arrival,":[67],"and":[68],"leave":[69],"after":[72],"completion.":[74],"A":[75],"key":[76],"objective":[78],"is":[79,99,111],"minimize":[81],"total":[83],"number":[84],"occupied":[86],"servers.":[87],"We":[88,104,123],"propose":[89],"Greedy-Random":[90],"(GRAND),":[91],"extremely":[93],"simple":[94],"customer":[95,117],"placement":[96],"algorithm,":[97],"which":[98],"also":[100,124],"easy":[101],"implement.":[103],"show":[105],"that":[106],"version":[108],"GRAND":[110,130],"essentially":[112],"asymptotically":[113],"optimal,":[114],"as":[115],"arrival":[118],"rates":[119],"grow":[120],"infinity.":[122],"study":[125],"versions":[127],"algorithms":[131],"simulations.":[133]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}