{"id":"https://openalex.org/W2091074056","doi":"https://doi.org/10.1109/icc.2004.1312657","title":"Service level agreement (SLA) based scheduling algorithms for wireless networks","display_name":"Service level agreement (SLA) based scheduling algorithms for wireless networks","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2091074056","doi":"https://doi.org/10.1109/icc.2004.1312657","mag":"2091074056"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1312657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312657","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":"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/A5044042259","display_name":"Mehdi Alasti","orcid":null},"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":"M. Alasti","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040273119","display_name":"Farrokh Farrokhi","orcid":"https://orcid.org/0000-0002-7559-3934"},"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":"F.R. Farrokhi","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027269911","display_name":"Masoud Olfat","orcid":null},"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":"M. Olfat","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038077586","display_name":"K.J. Ray Liu","orcid":null},"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":"K.J. Ray Liu","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Electr & Comput. Eng., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1028","last_page":"1032 Vol.2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9983999729156494,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9979000091552734,"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.864186704158783},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.7553330659866333},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6156095266342163},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.6088765859603882},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.595816433429718},{"id":"https://openalex.org/keywords/service-level-agreement","display_name":"Service-level agreement","score":0.5433036684989929},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5357709527015686},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5234985947608948},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5119510889053345},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5063508749008179},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.48560112714767456},{"id":"https://openalex.org/keywords/mobile-qos","display_name":"Mobile QoS","score":0.48008424043655396},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.46044811606407166},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.44527581334114075},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4403155446052551},{"id":"https://openalex.org/keywords/service-provider","display_name":"Service provider","score":0.34409984946250916},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.26202666759490967},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.24768218398094177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21248853206634521},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1502085030078888}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.864186704158783},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.7553330659866333},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6156095266342163},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.6088765859603882},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.595816433429718},{"id":"https://openalex.org/C2778160497","wikidata":"https://www.wikidata.org/wiki/Q869830","display_name":"Service-level agreement","level":3,"score":0.5433036684989929},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5357709527015686},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5234985947608948},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5119510889053345},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5063508749008179},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.48560112714767456},{"id":"https://openalex.org/C169761439","wikidata":"https://www.wikidata.org/wiki/Q6886951","display_name":"Mobile QoS","level":4,"score":0.48008424043655396},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.46044811606407166},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.44527581334114075},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4403155446052551},{"id":"https://openalex.org/C116537","wikidata":"https://www.wikidata.org/wiki/Q2169973","display_name":"Service provider","level":3,"score":0.34409984946250916},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.26202666759490967},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.24768218398094177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21248853206634521},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1502085030078888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2004.1312657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312657","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.419.3719","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.3719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sig.umd.edu/publications/alasti_sla_scheduling_icc_200406.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W102695963","https://openalex.org/W1533238833","https://openalex.org/W1950183092","https://openalex.org/W2098174889","https://openalex.org/W2098432798","https://openalex.org/W2116748333","https://openalex.org/W2120086682","https://openalex.org/W2126385342","https://openalex.org/W2127414672","https://openalex.org/W2158283087","https://openalex.org/W6604164793","https://openalex.org/W6655085538","https://openalex.org/W6674995601","https://openalex.org/W6678428036"],"related_works":["https://openalex.org/W1990357417","https://openalex.org/W2129448549","https://openalex.org/W2117584696","https://openalex.org/W3151407988","https://openalex.org/W1507603933","https://openalex.org/W2117099395","https://openalex.org/W2049462322","https://openalex.org/W2059640064","https://openalex.org/W2071937864","https://openalex.org/W2099143546"],"abstract_inverted_index":{"The":[0,72],"objective":[1],"of":[2,12,37],"scheduling":[3,78],"algorithms":[4,79],"in":[5,18],"wireless":[6,45],"networks":[7],"is":[8],"to":[9,40,48,67],"provide":[10,80],"quality":[11],"service":[13,96],"(QoS)":[14],"for":[15,43,52,95],"mobile":[16],"users":[17],"a":[19,35],"shared":[20],"environment":[21],"and":[22,47,63,91],"at":[23],"the":[24,28,50,69],"same":[25],"time":[26],"utilize":[27],"system":[29],"resources":[30],"efficiently.":[31],"We":[32,59],"have":[33,60],"introduced":[34],"notion":[36],"income":[38,94],"maximization":[39],"increase":[41],"throughput":[42],"multimedia":[44],"systems":[46],"maintain":[49],"QoS":[51,85],"each":[53],"user":[54],"above":[55],"an":[56],"agreed":[57],"level.":[58],"proposed":[61],"greedy":[62],"dynamic":[64],"programming":[65],"approaches":[66],"solve":[68],"optimization":[70],"problem.":[71],"simulation":[73],"results":[74],"reveal":[75],"that":[76],"our":[77],"high":[81,93],"network":[82,89],"throughput,":[83],"support":[84],"even":[86],"under":[87],"heavy":[88],"loads,":[90],"generate":[92],"provider.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}