{"id":"https://openalex.org/W2111108338","doi":"https://doi.org/10.1109/glocom.2005.1577699","title":"Guaranteed smooth switch scheduling with low complexity","display_name":"Guaranteed smooth switch scheduling with low complexity","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2111108338","doi":"https://doi.org/10.1109/glocom.2005.1577699","mag":"2111108338"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2005.1577699","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1577699","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/A5028376716","display_name":"Satya Ranjan Mohanty","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":"S.R. Mohanty","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California, Riverside, CA, USA","Dept. of Comput. Sci. & Eng., California Univ., Riverside, CA, USA#TAB#"],"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"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., California Univ., Riverside, CA, USA#TAB#","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048949780","display_name":"Laxmi N. Bhuyan","orcid":"https://orcid.org/0000-0002-8759-0458"},"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.N. Bhuyan","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California, Riverside, CA, USA","Dept. of Comput. Sci. & Eng., California Univ., Riverside, CA, USA#TAB#"],"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"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., California Univ., Riverside, CA, USA#TAB#","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.7847,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.72876065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"5 pp.","last_page":"5 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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9936000108718872,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6584895253181458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6413622498512268},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.627193808555603},{"id":"https://openalex.org/keywords/jitter","display_name":"Jitter","score":0.5950978398323059},{"id":"https://openalex.org/keywords/permutation-matrix","display_name":"Permutation matrix","score":0.44470465183258057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.440753698348999},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.42052149772644043},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36488717794418335},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34204915165901184},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30065596103668213},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2853319048881531},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.2588326632976532},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16290920972824097}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6584895253181458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6413622498512268},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.627193808555603},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.5950978398323059},{"id":"https://openalex.org/C84140500","wikidata":"https://www.wikidata.org/wiki/Q851512","display_name":"Permutation matrix","level":3,"score":0.44470465183258057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.440753698348999},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.42052149772644043},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36488717794418335},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34204915165901184},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30065596103668213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2853319048881531},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.2588326632976532},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16290920972824097},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"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.1577699","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2005.1577699","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1977846845","https://openalex.org/W1986826668","https://openalex.org/W2104341243","https://openalex.org/W2112421563","https://openalex.org/W2114552239","https://openalex.org/W2140773452","https://openalex.org/W2163450360","https://openalex.org/W2164196197","https://openalex.org/W2176566884"],"related_works":["https://openalex.org/W2121182846","https://openalex.org/W2155789024","https://openalex.org/W2315668284","https://openalex.org/W3213608175","https://openalex.org/W3117675750","https://openalex.org/W2141743053","https://openalex.org/W2037276323","https://openalex.org/W2109491806","https://openalex.org/W3095633856","https://openalex.org/W2058044441"],"abstract_inverted_index":{"A":[0],"smooth":[1,57,143],"scheduling":[2,18,117,128],"with":[3,29,65],"guaranteed":[4],"rate":[5],"service":[6],"and":[7,52,107,112,141],"bounded":[8],"packet":[9],"delay":[10,51],"is":[11,84,125],"a":[12,22,88,135],"desired":[13],"objective":[14],"of":[15,39,55,71,139],"any":[16],"switch":[17,76],"algorithm.":[19],"We":[20],"present":[21],"scheme":[23],"that":[24,74,98],"generates":[25],"low":[26,30],"jitter":[27,53],"schedules":[28],"computational":[31,136],"complexity.":[32],"The":[33],"scheduler":[34,58],"uses":[35],"an":[36,66],"integer":[37],"decomposition":[38],"the":[40,44,50,56,69,75,129],"rate-matrix,":[41],"similar":[42],"to":[43,79,86],"Birkhoff-von":[45],"Neumann":[46],"decomposition.":[47],"It":[48],"improves":[49],"performance":[54],"as":[59],"described":[60],"in":[61,68],"Keslassy":[62],"et":[63],"al.":[64],"increase":[67,83],"number":[70],"permutation":[72,130],"matrices":[73],"fabric":[77],"has":[78,134],"cycle":[80],"through.":[81],"This":[82,132],"shown":[85],"be":[87],"constant":[89],"for":[90,119,127],"all":[91],"practical":[92],"purposes.":[93],"Two":[94],"algorithms":[95],"are":[96],"presented":[97],"have":[99],"time":[100],"complexity":[101,109,137],"O(n/sup":[102,110],"2/":[103],"+":[104],"log":[105],"n)":[106],"space":[108],"2/)":[111],"O(n)":[113],"respectively.":[114],"An":[115],"existing":[116],"algorithm":[118,133],"single":[120],"links,":[121],"smoothed":[122],"round":[123],"robin,":[124],"employed":[126],"matrices.":[131],"overhead":[138],"O(1)":[140],"ensures":[142],"scheduling.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}