{"id":"https://openalex.org/W2164196197","doi":"https://doi.org/10.1109/glocom.2005.1577698","title":"Achieving fairness and throughput for best-effort traffic in input-queued crossbar switches","display_name":"Achieving fairness and throughput for best-effort traffic in input-queued crossbar switches","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2164196197","doi":"https://doi.org/10.1109/glocom.2005.1577698","mag":"2164196197"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2005.1577698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1577698","pdf_url":null,"source":{"id":"https://openalex.org/S4363608563","display_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","raw_type":"proceedings-article"},"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/A5100320842","display_name":"Xiao Zhang","orcid":"https://orcid.org/0000-0001-6864-2921"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiao Zhang","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California, Riverside, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of California, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006511768","display_name":"Laxmi Bhuyan","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L.M. Bhuyan","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California, Riverside, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of California, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":0.3923,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62627556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"com 35","issue":null,"first_page":"6 pp.","last_page":"6 pp."},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9987999796867371,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.996399998664856,"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.8127521276473999},{"id":"https://openalex.org/keywords/crossbar-switch","display_name":"Crossbar switch","score":0.7248371839523315},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6707291603088379},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.6375552415847778},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6092742085456848},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5902801752090454},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4984438419342041},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44261109828948975},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.4194185137748718},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.3156195878982544},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.19381332397460938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18641379475593567},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.16519486904144287},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.11145362257957458},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06591710448265076}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8127521276473999},{"id":"https://openalex.org/C29984679","wikidata":"https://www.wikidata.org/wiki/Q1929149","display_name":"Crossbar switch","level":2,"score":0.7248371839523315},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6707291603088379},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.6375552415847778},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6092742085456848},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5902801752090454},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4984438419342041},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44261109828948975},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.4194185137748718},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.3156195878982544},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.19381332397460938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18641379475593567},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.16519486904144287},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.11145362257957458},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06591710448265076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2005.1577698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1577698","pdf_url":null,"source":{"id":"https://openalex.org/S4363608563","display_name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1513716704","https://openalex.org/W1936493357","https://openalex.org/W1987497363","https://openalex.org/W2106522282","https://openalex.org/W2106523444","https://openalex.org/W2112421563","https://openalex.org/W2115272462","https://openalex.org/W2120655454","https://openalex.org/W2121523570","https://openalex.org/W2135279924","https://openalex.org/W2176566884","https://openalex.org/W2613173048","https://openalex.org/W6640530663"],"related_works":["https://openalex.org/W2361713743","https://openalex.org/W2136681811","https://openalex.org/W1999684000","https://openalex.org/W2563121256","https://openalex.org/W2057526413","https://openalex.org/W3006570067","https://openalex.org/W2138888940","https://openalex.org/W2374431462","https://openalex.org/W1521255234","https://openalex.org/W2134426757"],"abstract_inverted_index":{"Fairness":[0],"and":[1,40,42,54,67],"high":[2],"throughput":[3,41],"are":[4],"two":[5],"desirable":[6,58],"properties":[7],"for":[8,64,71],"scheduling":[9,25],"best-effort":[10],"traffic":[11,66],"in":[12,46],"an":[13,50,79],"input-queued":[14,51],"crossbar":[15,52],"switch.":[16],"Unfortunately,":[17],"to":[18],"the":[19,36,43,47],"best":[20],"of":[21,49],"our":[22],"knowledge,":[23],"existing":[24],"schemes":[26],"cannot":[27],"achieve":[28],"both":[29],"goals.":[30],"In":[31],"this":[32,75],"paper,":[33],"we":[34,77],"discuss":[35],"conflict":[37],"between":[38],"fairness":[39,44,70],"criterion":[45],"context":[48],"switch,":[53],"justify":[55],"that":[56],"a":[57],"scheduler":[59],"should":[60],"sustain":[61],"full":[62],"bandwidth":[63],"admissible":[65],"ensure":[68],"max-min":[69],"non-admissible":[72],"traffic.":[73],"To":[74],"purpose,":[76],"propose":[78],"algorithm":[80],"called":[81],"largest":[82],"virtual":[83],"waiting":[84],"time":[85],"first":[86],"(LVWTF).":[87]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}