{"id":"https://openalex.org/W2511683404","doi":"https://doi.org/10.1109/isit.2016.7541536","title":"Routing with blinkers: Online throughput maximization without queue length information","display_name":"Routing with blinkers: Online throughput maximization without queue length information","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2511683404","doi":"https://doi.org/10.1109/isit.2016.7541536","mag":"2511683404"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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/A5070393786","display_name":"Georgios S. Paschos","orcid":"https://orcid.org/0000-0002-5922-1612"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Georgios S. Paschos","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015149788","display_name":"Mathieu Leconte","orcid":null},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Leconte","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France","institution_ids":["https://openalex.org/I4210123571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062222447","display_name":"Apostolos Destounis","orcid":"https://orcid.org/0000-0003-0420-3430"},"institutions":[{"id":"https://openalex.org/I4210123571","display_name":"Huawei Technologies (France)","ror":"https://ror.org/02rbzf697","country_code":"FR","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210123571"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Apostolos Destounis","raw_affiliation_strings":["Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France"],"affiliations":[{"raw_affiliation_string":"Mathematical and Algorithmic Sciences Lab, Huawei Technologies Ltd, Paris, France","institution_ids":["https://openalex.org/I4210123571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070393786"],"corresponding_institution_ids":["https://openalex.org/I4210123571"],"apc_list":null,"apc_paid":null,"fwci":0.7457,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75261994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1436","last_page":"1440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9994000196456909,"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.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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/T11478","display_name":"Caching and Content Delivery","score":0.9993000030517578,"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.7834246158599854},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.7562645673751831},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.627752423286438},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.582735002040863},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4982004165649414},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.46342766284942627},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.461933970451355},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.20990490913391113},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1300782561302185},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.0895121693611145}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7834246158599854},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.7562645673751831},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.627752423286438},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.582735002040863},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4982004165649414},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.46342766284942627},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.461933970451355},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.20990490913391113},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1300782561302185},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0895121693611145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1591399774","https://openalex.org/W1607044975","https://openalex.org/W2022575296","https://openalex.org/W2048153916","https://openalex.org/W2052770562","https://openalex.org/W2105177639","https://openalex.org/W2117702591","https://openalex.org/W2130531694","https://openalex.org/W2138993731","https://openalex.org/W2589907274","https://openalex.org/W4238465620","https://openalex.org/W4297972233","https://openalex.org/W6677852368"],"related_works":["https://openalex.org/W2136583354","https://openalex.org/W2111238207","https://openalex.org/W2760721665","https://openalex.org/W2107954672","https://openalex.org/W330130819","https://openalex.org/W2288610023","https://openalex.org/W2112044895","https://openalex.org/W3121416282","https://openalex.org/W2037453743","https://openalex.org/W2163664144"],"abstract_inverted_index":{"We":[0],"study":[1,103],"a":[2,142,172,198,211,226],"service":[3,121,230],"provisioning":[4,122],"system":[5,137,178],"where":[6,111],"arriving":[7,59],"jobs":[8,148],"are":[9,156],"routed":[10,151],"in":[11,34,84,96,128,152],"an":[12,58,129],"online":[13,53],"fashion":[14],"to":[15,38,61,167,189,205,225],"any":[16],"of":[17,87,107,135,144,146,159,176,232],"the":[18,40,43,51,62,65,79,82,85,104,117,120,125,136,153,160,177,195,217,229,233],"available":[19],"servers;":[20],"typical":[21],"applications":[22],"include":[23],"datacenters,":[24],"Internet":[25],"switches,":[26],"and":[27,45,81,119,124,180,220],"cloud":[28],"computing":[29],"infrastructures.":[30],"A":[31],"common":[32],"goal":[33],"these":[35,155],"scenarios":[36],"is":[37,114,171,183,187],"balance":[39],"load":[41],"across":[42],"servers":[44,83,218],"achieve":[46,190,206],"maximum":[47,191,207,222],"throughput.":[48],"For":[49],"example,":[50],"classical":[52],"policy":[54,200,214],"Join-the-Shortest-Queue":[55],"(JSQ)":[56],"routes":[57],"job":[60],"server":[63,162],"with":[64,109,132],"shortest":[66],"instantaneous":[67],"queue":[68,88,163],"length.":[69,164],"Although":[70,165],"JSQ":[71],"has":[72,150],"desirable":[73],"properties,":[74],"it":[75,149,182,186],"requires":[76],"coordination":[77,113],"between":[78,116],"routers":[80,118,126],"form":[86],"length":[89],"reports,":[90],"which":[91],"prohibits":[92],"its":[93],"practical":[94,105],"usability":[95],"many":[97],"scenarios.":[98],"In":[99],"this":[100],"paper":[101],"we":[102,209],"case":[106],"\u201crouting":[108],"blinkers\u201d,":[110],"no":[112],"allowed":[115],"system,":[123],"act":[127],"individual":[130],"manner":[131],"limited":[133],"view":[134],"state.":[138],"Every":[139],"router":[140],"keeps":[141],"log":[143],"delays":[145],"all":[147],"past;":[154],"delayed":[157],"estimates":[158],"actual":[161],"easy":[166],"acquire,":[168],"such":[169,201],"information":[170],"highly":[173],"inaccurate":[174],"depiction":[175],"state":[179],"hence":[181],"unclear":[184],"whether":[185],"enough":[188],"performance.":[192],"Motivated":[193],"by":[194],"fact":[196],"that":[197,215],"reasonable":[199],"as":[202],"Join-the-Shortest-Delay":[203],"fails":[204],"throughput,":[208,223],"propose":[210],"novel":[212],"routing":[213],"\u201csamples\u201d":[216],"periodically":[219],"achieves":[221],"subject":[224],"condition":[227],"for":[228],"discipline":[231],"server.":[234]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}