{"id":"https://openalex.org/W2083410059","doi":"https://doi.org/10.1109/icc.2004.1312871","title":"A composite scheduling algorithm for programmable networks","display_name":"A composite scheduling algorithm for programmable networks","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2083410059","doi":"https://doi.org/10.1109/icc.2004.1312871","mag":"2083410059"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1312871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","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/A5087242242","display_name":"Fariza Sabrina","orcid":"https://orcid.org/0000-0002-8455-2499"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"F. Sabrina","raw_affiliation_strings":["School of Computer Science and Engineering, University of New South Wales, Australia","Sch. of Comput. Sci. & Eng., New South Wales Univ., NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & Eng., New South Wales Univ., NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015261020","display_name":"Sanjay Jha","orcid":"https://orcid.org/0000-0002-1844-1520"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"S. Jha","raw_affiliation_strings":["School of Computer Science and Engineering, University of New South Wales, Australia","Sch. of Comput. Sci. & Eng., New South Wales Univ., NSW, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & Eng., New South Wales Univ., NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087242242"],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":0.4635,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71191625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2003","last_page":"2008 Vol.4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8704583048820496},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.6536135077476501},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6011372208595276},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.555528461933136},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5430786609649658},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5335128307342529},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5210961103439331},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5141632556915283},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4950834810733795},{"id":"https://openalex.org/keywords/dynamic-bandwidth-allocation","display_name":"Dynamic bandwidth allocation","score":0.4521581530570984},{"id":"https://openalex.org/keywords/cpu-shielding","display_name":"CPU shielding","score":0.4395483434200287},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4376232922077179},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.43570056557655334},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.4260645806789398},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.42289236187934875},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4029148817062378},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.33668088912963867},{"id":"https://openalex.org/keywords/central-processing-unit","display_name":"Central processing unit","score":0.3272029161453247},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1534011960029602},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.06818604469299316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8704583048820496},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.6536135077476501},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6011372208595276},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.555528461933136},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5430786609649658},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5335128307342529},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5210961103439331},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5141632556915283},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4950834810733795},{"id":"https://openalex.org/C145062175","wikidata":"https://www.wikidata.org/wiki/Q5318947","display_name":"Dynamic bandwidth allocation","level":3,"score":0.4521581530570984},{"id":"https://openalex.org/C180613757","wikidata":"https://www.wikidata.org/wiki/Q5013757","display_name":"CPU shielding","level":3,"score":0.4395483434200287},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4376232922077179},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.43570056557655334},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.4260645806789398},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.42289236187934875},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4029148817062378},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.33668088912963867},{"id":"https://openalex.org/C49154492","wikidata":"https://www.wikidata.org/wiki/Q5300","display_name":"Central processing unit","level":2,"score":0.3272029161453247},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1534011960029602},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06818604469299316},{"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/icc.2004.1312871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1867018545","https://openalex.org/W1947917437","https://openalex.org/W2100892891","https://openalex.org/W2130327661","https://openalex.org/W2152925463","https://openalex.org/W2167045420","https://openalex.org/W2538902375","https://openalex.org/W6728903460"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1545991362","https://openalex.org/W3184267879","https://openalex.org/W2184166483","https://openalex.org/W2167574351","https://openalex.org/W2076947091","https://openalex.org/W2404383452","https://openalex.org/W1935185185","https://openalex.org/W2912206708","https://openalex.org/W2790707920"],"abstract_inverted_index":{"In":[0],"today's":[1],"Internet,":[2],"packet":[3,23],"processing":[4,55,153],"may":[5],"be":[6],"accomplished":[7],"in":[8,19,35,68],"the":[9,12,22,38,51,72,109,114,119,147,167,173,177],"routers":[10],"within":[11],"data":[13,58,148,179],"path.":[14],"For":[15],"efficient":[16],"resource":[17],"allocation":[18],"such":[20,30],"routers,":[21],"scheduling":[24,77,85,133,138,168],"schemes":[25],"should":[26],"consider":[27],"multiple":[28],"resources":[29,102],"as":[31],"CPU":[32,65,101,130,200],"and":[33,50,100,105,131,154,157,161,183,201],"memory":[34],"addition":[36],"to":[37,40,96,117,146],"bandwidth":[39,76,99,132,155,202],"improve":[41],"overall":[42],"performance.":[43],"The":[44],"dynamic":[45],"nature":[46],"of":[47,54,57,74,127,176],"network":[48],"load":[49],"inherent":[52],"unpredictability":[53],"times":[56,175],"packets":[59],"pose":[60],"a":[61,82,123,136,159],"significant":[62],"challenge":[63],"for":[64,151,166,170],"scheduling,":[66],"which":[67,93],"turn":[69],"also":[70],"limits":[71],"application":[73],"well-known":[75],"algorithms.":[78],"This":[79],"paper":[80],"presents":[81],"new":[83,125],"composite":[84,89],"algorithm":[86,169],"called":[87],"prediction-based":[88],"fair":[90],"queueing":[91],"(PCFQ),":[92],"is":[94,113],"designed":[95],"schedule":[97],"both":[98,129,152],"adaptively,":[103],"fairly,":[104],"efficiently":[106],"among":[107],"all":[108],"competing":[110,150],"flows.":[111],"PCFQ":[112,188],"first":[115],"scheduler":[116],"have":[118],"following":[120],"properties:":[121],"(1)":[122],"very":[124],"idea":[126],"combining":[128],"functionalities":[134],"under":[135],"single":[137],"scheme":[139,165],"that":[140,187],"can":[141,189],"provide":[142,190],"better":[143,192],"QoS":[144],"guarantees":[145,194],"flows":[149],"resources;":[156],"(2)":[158],"simple":[160],"adaptive":[162],"online":[163],"prediction":[164],"reliably":[171],"estimating":[172],"execution":[174],"incoming":[178],"packets.":[180],"Through":[181],"simulation":[182],"analysis":[184],"we":[185],"show":[186],"significantly":[191],"delay":[193],"than":[195],"those":[196],"achievable":[197],"through":[198],"separate":[199],"schedulers.":[203]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}