{"id":"https://openalex.org/W2147333133","doi":"https://doi.org/10.1109/glocom.2004.1378274","title":"Fair scheduling in input-queued switches under inadmissible traffic","display_name":"Fair scheduling in input-queued switches under inadmissible traffic","publication_year":2005,"publication_date":"2005-04-05","ids":{"openalex":"https://openalex.org/W2147333133","doi":"https://doi.org/10.1109/glocom.2004.1378274","mag":"2147333133"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2004.1378274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","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/A5100680924","display_name":"Nishant Kumar","orcid":"https://orcid.org/0009-0009-7400-9992"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"N. Kumar","raw_affiliation_strings":["Departments of EE & CS, University of Stanford, USA","Dept. of Electr. Eng. & Comput. Sci., Stanford Univ., CA, USA"],"affiliations":[{"raw_affiliation_string":"Departments of EE & CS, University of Stanford, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci., Stanford Univ., CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075012459","display_name":"Rong Pan","orcid":"https://orcid.org/0000-0001-5171-8248"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rong Pan","raw_affiliation_strings":["Departments of EE & CS, University of Stanford, USA","Dept. of Electr. Eng. & Comput. Sci., Stanford Univ., CA, USA"],"affiliations":[{"raw_affiliation_string":"Departments of EE & CS, University of Stanford, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci., Stanford Univ., CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029499294","display_name":"Devavrat Shah","orcid":"https://orcid.org/0000-0003-0737-3259"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Devavrat Shah","raw_affiliation_strings":["Departments of EE & CS, University of Stanford, USA","Dept. of Electr. Eng. & Comput. Sci., Stanford Univ., CA, USA"],"affiliations":[{"raw_affiliation_string":"Departments of EE & CS, University of Stanford, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci., Stanford Univ., CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100680924"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.1898,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8985675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":null,"first_page":"1713","last_page":"1717"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10018","display_name":"Advancements in Battery Materials","score":0.9944999814033508,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9921000003814697,"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/computer-science","display_name":"Computer science","score":0.7375232577323914},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7180488705635071},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6912859082221985},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5926631093025208},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.48054057359695435},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.42934221029281616},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.4248099625110626},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39632028341293335},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.36908167600631714},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36244744062423706},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3520362377166748},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.32010191679000854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13640299439430237}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7375232577323914},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7180488705635071},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6912859082221985},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5926631093025208},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.48054057359695435},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.42934221029281616},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.4248099625110626},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39632028341293335},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.36908167600631714},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36244744062423706},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3520362377166748},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.32010191679000854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13640299439430237}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2004.1378274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.294.7372","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.7372","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/devavrat/www/globe04-fair.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1607044975","https://openalex.org/W2003346154","https://openalex.org/W2076915000","https://openalex.org/W2116330621","https://openalex.org/W2613173048","https://openalex.org/W6737445176"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2371964339","https://openalex.org/W4386580182","https://openalex.org/W1545991362","https://openalex.org/W2060984508","https://openalex.org/W1935185185","https://openalex.org/W3151407988","https://openalex.org/W2093454713","https://openalex.org/W2372008037","https://openalex.org/W4386764057"],"abstract_inverted_index":{"In":[0,18,68],"recent":[1],"years,":[2],"several":[3],"high-throughput":[4],"low-delay":[5],"scheduling":[6,83,107],"algorithms":[7,108],"have":[8],"been":[9],"designed":[10],"for":[11,112],"input-queued":[12],"(IQ)":[13],"switches,":[14],"assuming":[15],"admissible":[16],"traffic.":[17],"this":[19,93],"paper,":[20],"we":[21,70],"focus":[22],"on":[23],"queueing":[24],"systems":[25],"that":[26,32,72,109],"violate":[27],"admissibility":[28],"criteria.":[29],"We":[30,53,91],"show":[31],"in":[33,85],"a":[34,47,64],"single-server":[35],"system":[36],"with":[37],"multiple":[38],"queues,":[39],"the":[40,56,73,78,95],"longest":[41],"queue":[42],"first":[43],"(LQF)":[44],"policy":[45],"disallows":[46],"fair":[48,65,106],"allocation":[49,62,75],"of":[50,97],"service":[51],"rates.":[52],"also":[54],"describe":[55],"duality":[57],"shared":[58],"by":[59,77],"LQF's":[60],"rate":[61,66,74],"and":[63,102,104],"allocation.":[67],"general,":[69],"demonstrate":[71],"performed":[76],"maximum":[79],"weight":[80],"matching":[81],"(MWM)":[82],"algorithm":[84],"overloaded":[86],"IQ":[87],"switches":[88],"is":[89],"unfair.":[90],"attribute":[92],"to":[94],"lack":[96],"coordination":[98],"between":[99],"admission":[100],"control":[101],"scheduling,":[103],"propose":[105],"minimize":[110],"delay":[111],"nonoverloaded":[113],"queues.":[114]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}