Low-Complexity Scheduling Algorithms for Multichannel Downlink Wireless Networks
This paper considers the problem of designing scheduling algorithms for multichannel (e.g., OFDM-based) wireless downlink networks, with a large number of users and proportionally large bandwidth. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-...
Uloženo v:
| Vydáno v: | IEEE/ACM transactions on networking Ročník 20; číslo 5; s. 1608 - 1621 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
01.10.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1063-6692, 1558-2566 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper considers the problem of designing scheduling algorithms for multichannel (e.g., OFDM-based) wireless downlink networks, with a large number of users and proportionally large bandwidth. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, it is shown that it has zero rate function in our setting). To address this, a class of algorithms called iterated Heaviest matching with Longest Queues First (iHLQF) is proposed. The algorithms in this class are shown to be throughput-optimal for a general class of arrival/channel processes, and also rate-function-optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF, however, has higher complexity than MaxWeight ( n 4 versus n 2 , respectively). To overcome this issue, a new algorithm called Server-Side Greedy (SSG) is proposed. It is shown that SSG is throughput-optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity ( n 2 ) that is comparable to the MaxWeight algorithm. Thus, it provides a nice tradeoff between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations. |
|---|---|
| AbstractList | This paper considers the problem of designing scheduling algorithms for multichannel (e.g., OFDM-based) wireless downlink networks, with a large number of users and proportionally large bandwidth. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, it is shown that it has zero rate function in our setting). To address this, a class of algorithms called iterated Heaviest matching with Longest Queues First (iHLQF) is proposed. The algorithms in this class are shown to be throughput-optimal for a general class of arrival/channel processes, and also rate-function-optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF, however, has higher complexity than MaxWeight ([Formula Omitted] versus [Formula Omitted], respectively). To overcome this issue, a new algorithm called Server-Side Greedy (SSG) is proposed. It is shown that SSG is throughput-optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity [Formula Omitted] that is comparable to the MaxWeight algorithm. Thus, it provides a nice tradeoff between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations. This paper considers the problem of designing scheduling algorithms for multichannel (e.g., OFDM-based) wireless downlink networks, with a large number of users and proportionally large bandwidth. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, it is shown that it has zero rate function in our setting). To address this, a class of algorithms called iterated Heaviest matching with Longest Queues First (iHLQF) is proposed. The algorithms in this class are shown to be throughput-optimal for a general class of arrival/channel processes, and also rate-function-optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF, however, has higher complexity than MaxWeight ( n 4 versus n 2 , respectively). To overcome this issue, a new algorithm called Server-Side Greedy (SSG) is proposed. It is shown that SSG is throughput-optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity ( n 2 ) that is comparable to the MaxWeight algorithm. Thus, it provides a nice tradeoff between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations. |
| Author | Lei Ying Srikant, R. Bodas, S. Shakkottai, S. |
| Author_xml | – sequence: 1 givenname: S. surname: Bodas fullname: Bodas, S. email: bodas@mit.edu organization: Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA – sequence: 2 givenname: S. surname: Shakkottai fullname: Shakkottai, S. email: shakkott@mail.utexas.edu organization: Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA – sequence: 3 surname: Lei Ying fullname: Lei Ying email: leiying@iastate.edu organization: Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA – sequence: 4 givenname: R. surname: Srikant fullname: Srikant, R. email: rsrikant@illinois.edu organization: Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA |
| BookMark | eNp9kD1PwzAQhi0EEp8_ALFEYmFJ8TmJk4yolA-pfEgUMVque6EG1y62o8K_x1URAwO64W543tPds0-2rbNIyDHQAQBtzyf3o8mAUWADBk1V03aL7EFVNTmrON9OM-VFznnLdsl-CG-UQkEZ3yOPY7fKh26xNPip41f2pOY46422r9mFeXVex_kiZJ3z2V1volZzaS2a7NKtbILesxft0WAI2T3GlfPv4ZDsdNIEPPrpB-T5ajQZ3uTjh-vb4cU4VwXjMVeykLWCDqe8BFmyadlVLYeiayvaMDUDrmaKyynWZcehbuSMNbLDaqrauoYWigNyttm79O6jxxDFQgeFxkiLrg8CeJ3-hwQn9PQP-uZ6b9N1AgAYr2hRskTVG0p5F4LHTigdZdTORi-1EUDF2rRYmxZr0-LHdErCn-TS64X0X_9mTjYZjYi_PIdUDIpv4ByL-w |
| CODEN | IEANEP |
| CitedBy_id | crossref_primary_10_1109_TMC_2019_2949291 crossref_primary_10_3390_s19225005 crossref_primary_10_1109_TVT_2015_2474695 crossref_primary_10_1109_TWC_2023_3277861 crossref_primary_10_1109_TMECH_2016_2553522 crossref_primary_10_1109_TSMC_2016_2632155 |
| Cites_doi | 10.1137/06067746X 10.1109/9.182479 10.1109/9.341782 10.1109/TIT.2006.883633 10.1109/TIT.2007.903141 10.1109/TNET.2004.842226 10.1109/INFCOM.2010.5462047 10.1109/TIT.2009.2016051 10.1109/INFCOM.2002.1019396 10.1214/aoap/1075828046 10.1109/18.212277 10.1109/TIT.2004.838375 10.1007/s11134-008-9072-y 10.1239/aap/1103662957 10.1109/TNET.2007.893876 10.1145/1555349.1555364 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2012 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2012 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TNET.2012.2185709 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2566 |
| EndPage | 1621 |
| ExternalDocumentID | 2791531941 10_1109_TNET_2012_2185709 6161621 |
| Genre | orig-research |
| GroupedDBID | -DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c326t-ca3a7c1feb641a42b4f59613f95082cd16cdc6abe74f6178ad28afe5bc9771913 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000310141400022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1063-6692 |
| IngestDate | Sun Sep 28 07:42:20 EDT 2025 Sun Nov 09 07:19:11 EST 2025 Tue Nov 18 21:39:56 EST 2025 Sat Nov 29 03:05:16 EST 2025 Tue Aug 26 17:02:34 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c326t-ca3a7c1feb641a42b4f59613f95082cd16cdc6abe74f6178ad28afe5bc9771913 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| PQID | 1112650342 |
| PQPubID | 32020 |
| PageCount | 14 |
| ParticipantIDs | proquest_journals_1112650342 crossref_citationtrail_10_1109_TNET_2012_2185709 proquest_miscellaneous_1671551771 crossref_primary_10_1109_TNET_2012_2185709 ieee_primary_6161621 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-10-01 |
| PublicationDateYYYYMMDD | 2012-10-01 |
| PublicationDate_xml | – month: 10 year: 2012 text: 2012-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE/ACM transactions on networking |
| PublicationTitleAbbrev | TNET |
| PublicationYear | 2012 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref12 ref15 ref20 ref11 ref10 ref21 andrews (ref13) 2000 venkataramanan (ref8) 2007 ref1 ref17 forum (ref2) 2006 ref16 ref19 ref18 ref7 ref9 ref4 (ref3) 2006 ref6 ref5 shakkottai (ref14) 2002; 207 |
| References_xml | – ident: ref11 doi: 10.1137/06067746X – year: 2006 ident: ref2 publication-title: Mobile WiMAX Part I A Technical Overview and Performance Evaluation – ident: ref12 doi: 10.1109/9.182479 – ident: ref21 doi: 10.1109/9.341782 – ident: ref6 doi: 10.1109/TIT.2006.883633 – year: 2007 ident: ref8 article-title: Structural properties of LDP for queue-length based wireless scheduling algorithms publication-title: Proc Annu Allerton Conf Commun Control Comput – ident: ref16 doi: 10.1109/TIT.2007.903141 – ident: ref20 doi: 10.1109/TNET.2004.842226 – ident: ref1 doi: 10.1109/INFCOM.2010.5462047 – ident: ref19 doi: 10.1109/TIT.2009.2016051 – ident: ref15 doi: 10.1109/INFCOM.2002.1019396 – ident: ref9 doi: 10.1214/aoap/1075828046 – ident: ref5 doi: 10.1109/18.212277 – ident: ref18 doi: 10.1109/TIT.2004.838375 – year: 2000 ident: ref13 publication-title: CDMA data QoS scheduling on the forward link with variable channel conditions – ident: ref7 doi: 10.1007/s11134-008-9072-y – ident: ref10 doi: 10.1239/aap/1103662957 – volume: 207 start-page: 185 year: 2002 ident: ref14 article-title: Scheduling for multiple flows sharing a time-varying channel: The exponential rule publication-title: Ann Math Statist – year: 2006 ident: ref3 publication-title: Requirements for Evolved UTRA (E-UTRA) and Evolved UTRAN (E-UTRAN) – ident: ref17 doi: 10.1109/TNET.2007.893876 – ident: ref4 doi: 10.1145/1555349.1555364 |
| SSID | ssj0013026 |
| Score | 2.150711 |
| Snippet | This paper considers the problem of designing scheduling algorithms for multichannel (e.g., OFDM-based) wireless downlink networks, with a large number of... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1608 |
| SubjectTerms | Algorithm design and analysis Algorithms Arrivals Buffers Channels Complexity Complexity theory Downlink Large deviations low complexity Mathematical analysis Mathematical models Resource management Scheduling Scheduling algorithms Servers small buffer Studies Throughput Wireless networks |
| Title | Low-Complexity Scheduling Algorithms for Multichannel Downlink Wireless Networks |
| URI | https://ieeexplore.ieee.org/document/6161621 https://www.proquest.com/docview/1112650342 https://www.proquest.com/docview/1671551771 |
| Volume | 20 |
| WOSCitedRecordID | wos000310141400022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE/IET Electronic Library customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60eNCDb7FaZQVPYjTZbHabY_GBBymCFbyFZHejQk2kTRX_vTObtBYUwUsIZPOayex-k_lmBuBYRwKnXrRvEYYRbvzYy0xmPBHkVlEBOW1d15Jb1e93Hx_juwU4neXCWGsd-cye0a6L5ZtST-hX2blEeCIpa3xRKVXnan1HDHzXWg09nNCTMuZNBDPw4_NB_2pAJC5-xqnyEXEP59Yg11Tlx0zslpfrtf892DqsNjCS9Wq9b8CCLTZhZa644Bbc3ZYfHpk7lbysPtk9qscQ7_yJ9YZP5eilen4dM8SszCXhUgZwYYfskqrno4PKiBc7xHmQ9Wum-HgbHq6vBhc3XtM_wdMIyipPp2GqNAo9kyJIBc9EHsW4fOfU-ZVrE0httEwzq0ROmYKp4d00t1GmERSiHxfuQKsoC7sLLEc_kKs8SH3ZFcbwWIcmRPO1uRUqEqYN_lSiiW6Ki1OPi2HinAw_TkgJCSkhaZTQhpPZKW91ZY2_Bm-R1GcDG4G3oTNVW9LY3ph8Go64MxS8DUezw2g1FApJC1tOcIxUhBXxNfd-v_I-LNP9a9peB1rVaGIPYEm_Vy_j0aH79L4A7fzWrg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS4RAEB-iguqh7-j63KCnyE7XdT0fow-KLgm6oDfR3bWCS-POK_rvm1ntCoqgFxFcZZ1xdmec3_wGYF8FApdetG_h-wEe3MjJdKYd4eUmJAI5ZWzXkm4Yx537--hmAg7HtTDGGAs-M0d0anP5ulQj-lXWluieSKoanwqE4F5drfWVM3BtczWMcXxHyog3OUzPjdq9-KxHMC5-xIn7iNCH33Yh21blx1psN5jzhf9NbRHmG0eSHdeaX4IJUyzD3Dd6wRW46ZZvDhk8kV5W7-wWFaQJef7AjvsP5eCpenweMvRamS3DpRrgwvTZKfHnY4jKCBnbx5WQxTVWfLgKd-dnvZMLp-mg4Ch0yypHpX4aKhR7JoWXCp6JPIhwA8-p9ytX2pNKK5lmJhQ51QqmmnfS3ASZQrcQIzl_DSaLsjDrwHKMBHmYe6krO0JrHilf-2jAJjciDIRugfsp0UQ19OLU5aKf2DDDjRJSQkJKSBoltOBgfMtLza3x1-AVkvp4YCPwFmx9qi1prG9IUQ1Hz9MXvAV748toN5QMSQtTjnCMDMlbxNfc-P3JuzBz0bvuJt3L-GoTZmkuNYhvCyarwchsw7R6rZ6Ggx37GX4AP-nZ9Q |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Low-Complexity+Scheduling+Algorithms+for+Multichannel+Downlink+Wireless+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Bodas%2C+S.&rft.au=Shakkottai%2C+S.&rft.au=Lei+Ying&rft.au=Srikant%2C+R.&rft.date=2012-10-01&rft.pub=IEEE&rft.issn=1063-6692&rft.volume=20&rft.issue=5&rft.spage=1608&rft.epage=1621&rft_id=info:doi/10.1109%2FTNET.2012.2185709&rft.externalDocID=6161621 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon |