{"id":"https://openalex.org/W2804111639","doi":"https://doi.org/10.23919/wiopt.2018.8362856","title":"Hierarchical scheduling algorithms with throughput guarantees and low delay","display_name":"Hierarchical scheduling algorithms with throughput guarantees and low delay","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2804111639","doi":"https://doi.org/10.23919/wiopt.2018.8362856","mag":"2804111639"},"language":"en","primary_location":{"id":"doi:10.23919/wiopt.2018.8362856","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt.2018.8362856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","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/A5045050891","display_name":"Peruru Subrahmanya Swamy","orcid":"https://orcid.org/0000-0003-1237-4811"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Peruru Subrahmanya Swamy","raw_affiliation_strings":["Department of Electrical Engineering, IIT Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075290390","display_name":"Radha Krishna Ganti","orcid":"https://orcid.org/0000-0002-5211-5657"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Radha Krishna Ganti","raw_affiliation_strings":["Department of Electrical Engineering, IIT Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023982586","display_name":"Krishna Jagannathan","orcid":"https://orcid.org/0000-0002-4436-5103"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Krishna Jagannathan","raw_affiliation_strings":["Department of Electrical Engineering, IIT Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2262,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.35052681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"19","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9984999895095825,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9984999895095825,"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.9984999895095825,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9983000159263611,"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.7611200213432312},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6838602423667908},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6737155914306641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5580250024795532},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5251978635787964},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5222499966621399},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.4910106956958771},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.46840235590934753},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4329591989517212},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43171826004981995},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4152473211288452},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3194107413291931},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2826730012893677},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.2740623354911804},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.25309622287750244},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.22001513838768005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18980282545089722},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1493385136127472},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.11095637083053589}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7611200213432312},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6838602423667908},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6737155914306641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5580250024795532},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5251978635787964},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5222499966621399},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.4910106956958771},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46840235590934753},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4329591989517212},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43171826004981995},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4152473211288452},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3194107413291931},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2826730012893677},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.2740623354911804},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.25309622287750244},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.22001513838768005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18980282545089722},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1493385136127472},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.11095637083053589},{"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.23919/wiopt.2018.8362856","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt.2018.8362856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","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":22,"referenced_works":["https://openalex.org/W207247871","https://openalex.org/W1526359699","https://openalex.org/W1995120351","https://openalex.org/W2039917366","https://openalex.org/W2052547976","https://openalex.org/W2068265192","https://openalex.org/W2097058227","https://openalex.org/W2105177639","https://openalex.org/W2111709732","https://openalex.org/W2116071440","https://openalex.org/W2125567506","https://openalex.org/W2152859483","https://openalex.org/W2522584862","https://openalex.org/W2554963430","https://openalex.org/W2747397037","https://openalex.org/W2804111639","https://openalex.org/W3104790834","https://openalex.org/W4245558686","https://openalex.org/W4251986490","https://openalex.org/W4285719527","https://openalex.org/W6608469636","https://openalex.org/W6730070503"],"related_works":["https://openalex.org/W2091476158","https://openalex.org/W3195229121","https://openalex.org/W4309118773","https://openalex.org/W1572212932","https://openalex.org/W2121723384","https://openalex.org/W4210909622","https://openalex.org/W2063980628","https://openalex.org/W4317418931","https://openalex.org/W2955440244","https://openalex.org/W2012293136"],"abstract_inverted_index":{"We":[0],"propose":[1],"distributed":[2],"scheduling":[3,58],"algorithms":[4,29,119,131,137],"that":[5,65,120,129],"guarantee":[6],"a":[7,39,61,92],"constant":[8],"fraction":[9],"of":[10,34,55,86,94],"the":[11,25,43,52,56,73,80,83,95,99,112,118,133],"maximum":[12],"throughput":[13,53,84,115],"for":[14],"typical":[15],"wireless":[16],"topologies,":[17,107],"and":[18,22,63,124],"have":[19,121],"O(1)":[20,122,135],"delay":[21,64,123],"complexity":[23,62,136],"in":[24],"network":[26,70,81],"size.":[27,71],"Our":[28],"resolve":[30],"collisions":[31],"among":[32,117],"pairs":[33],"conflicting":[35],"nodes":[36],"by":[37,91],"assigning":[38],"master-slave":[40,44,74],"hierarchy.":[41],"When":[42,72],"hierarchy":[45,75],"is":[46,76,89],"chosen":[47,77],"randomly,":[48],"our":[49,87,108,130],"algorithm":[50,88],"matches":[51],"performance":[54,85],"maximal":[57],"policies,":[59],"with":[60,69],"do":[66],"not":[67],"scale":[68],"based":[78],"on":[79],"topology,":[82],"characterized":[90],"parameter":[93],"conflict":[96,105],"graph":[97,106],"called":[98],"master-interference":[100],"degree.":[101],"For":[102],"commonly":[103],"used":[104],"results":[109,127],"lead":[110],"to":[111],"best":[113],"known":[114],"guarantees":[116],"complexity.":[125],"Numerical":[126],"indicate":[128],"out-perform":[132],"existing":[134],"like":[138],"Q-CSMA.":[139]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}