A Refined Performance Characterization of Longest-Queue-First Policy in Wireless Networks
One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms have been introduced to address the problem. However, solving the problem to optimality for general wireless interference models is known to...
Saved in:
| Published in | IEEE/ACM transactions on networking Vol. 19; no. 5; pp. 1382 - 1395 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
IEEE
01.10.2011
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1063-6692 1558-2566 |
| DOI | 10.1109/TNET.2011.2108314 |
Cover
| Abstract | One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms have been introduced to address the problem. However, solving the problem to optimality for general wireless interference models is known to be NP-hard. The research community is currently focusing on finding simpler suboptimal scheduling algorithms and on characterizing the algorithm performance. In this paper, we address the performance of a specific scheduling policy called Longest Queue First (LQF), which has gained significant recognition lately due to its simplicity and high efficiency in empirical studies. There has been a sequence of studies characterizing the guaranteed performance of the LQF schedule, culminating at the construction of the σ-local pooling concept by Joo In this paper, we refine the notion of σ -local pooling and use the refinement to capture a larger region of guaranteed performance. |
|---|---|
| AbstractList | One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms have been introduced to address the problem. However, solving the problem to optimality for general wireless interference models is known to be NP-hard. The research community is currently focusing on finding simpler suboptimal scheduling algorithms and on characterizing the algorithm performance. In this paper, we address the performance of a specific scheduling policy called Longest Queue First (LQF), which has gained significant recognition lately due to its simplicity and high efficiency in empirical studies. There has been a sequence of studies characterizing the guaranteed performance of the LQF schedule, culminating at the construction of the [Formula Omitted]-local pooling concept by Joo In this paper, we refine the notion of [Formula Omitted]-local pooling and use the refinement to capture a larger region of guaranteed performance. One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms have been introduced to address the problem. However, solving the problem to optimality for general wireless interference models is known to be NP-hard. The research community is currently focusing on finding simpler suboptimal scheduling algorithms and on characterizing the algorithm performance. In this paper, we address the performance of a specific scheduling policy called Longest Queue First (LQF), which has gained significant recognition lately due to its simplicity and high efficiency in empirical studies. There has been a sequence of studies characterizing the guaranteed performance of the LQF schedule, culminating at the construction of the σ-local pooling concept by Joo In this paper, we refine the notion of σ -local pooling and use the refinement to capture a larger region of guaranteed performance. One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms have been introduced to address the problem. However, solving the problem to optimality for general wireless interference models is known to be NP-hard. The research community is currently focusing on finding simpler suboptimal scheduling algorithms and on characterizing the algorithm performance. In this paper, we address the performance of a specific scheduling policy called Longest Queue First (LQF), which has gained significant recognition lately due to its simplicity and high efficiency in empirical studies. There has been a sequence of studies characterizing the guaranteed performance of the LQF schedule, culminating at the construction of the sigma -local pooling concept by Joo [et al] In this paper, we refine the notion of sigma -local pooling and use the refinement to capture a larger region of guaranteed performance. |
| Author | Bo Li Ye Xia Boyaci, C. |
| Author_xml | – sequence: 1 surname: Bo Li fullname: Bo Li email: boli@cise.ufl.edu organization: Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL, USA – sequence: 2 givenname: C. surname: Boyaci fullname: Boyaci, C. email: cboyaci@cise.ufl.edu organization: Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL, USA – sequence: 3 surname: Ye Xia fullname: Ye Xia email: yx1@cise.ufl.edu organization: Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL, USA |
| BookMark | eNp9kMFOGzEQQC1EJULaD6i4WL1w2uCx1876iCKgSBHQKlXVk-V1xmC6scHeVUW_vhuCOOTQ08zhvdHoHZPDmCIS8hnYDIDps9XNxWrGGcCMA2sE1AdkAlI2FZdKHY47U6JSSvMjclzKI2MgGFcT8uucfkcfIq7pHWaf8sZGh3TxYLN1Pebw1_YhRZo8XaZ4j6Wvvg04YHUZcunpXeqCe6Eh0p8hY4el0Bvs_6T8u3wkH7ztCn56m1Py4_JitfhaLW-vrhfny8oJXvdV6633Drz30jEOqLlrJKzX3COXreWaadHWNWdta52u3VoIdErMhW21bOtGTMnp7u5TTs_D-KDZhOKw62zENBSjlWhqUAAj-WWPfExDjuNzptENB96M7JTMd5DLqZSM3rjQvzbosw2dAWa2wc02uNkGN2_BRxP2zKccNja__Nc52TkBEd95OQc1Z1L8AwEpjpE |
| CODEN | IEANEP |
| CitedBy_id | crossref_primary_10_1109_TNET_2015_2451090 crossref_primary_10_1109_TCNS_2017_2673539 crossref_primary_10_1016_j_comnet_2017_04_011 crossref_primary_10_1109_TNET_2014_2360365 |
| Cites_doi | 10.1109/TIT.2007.913537 10.1145/1374618.1374634 10.1239/aap/1151337082 10.1109/INFCOM.2007.11 10.1109/PERCOMW.2006.79 10.1109/INFOCOM.2006.176 10.1109/INFCOM.2007.191 10.1109/TNET.2006.872546 10.1214/aoap/1177004828 10.1109/18.825799 10.1109/9.182479 10.1109/ITA.2008.4601094 10.1007/BF02579273 10.1109/INFCOM.2010.5462046 10.1109/JSAC.2004.830909 10.1109/CDC.2006.376968 10.1109/TNET.2008.918109 10.1109/TNET.2009.2026276 10.1109/INFCOM.2007.240 10.1145/1530748.1530771 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2011 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2011 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TNET.2011.2108314 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library 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://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2566 |
| EndPage | 1395 |
| ExternalDocumentID | 2484647811 10_1109_TNET_2011_2108314 5716705 |
| 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 AAYOK AAYXX CITATION RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c324t-bfaffc1fff5c021e92c851dd2fe25ba29093b4420bbac94cd33ec6373ab95b483 |
| IEDL.DBID | RIE |
| ISSN | 1063-6692 |
| IngestDate | Thu Sep 04 18:49:44 EDT 2025 Sun Jun 29 12:30:37 EDT 2025 Thu Apr 24 23:00:13 EDT 2025 Tue Jul 01 01:49:15 EDT 2025 Tue Aug 26 17:18:08 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-c324t-bfaffc1fff5c021e92c851dd2fe25ba29093b4420bbac94cd33ec6373ab95b483 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 898212896 |
| PQPubID | 32020 |
| PageCount | 14 |
| ParticipantIDs | proquest_miscellaneous_963841611 ieee_primary_5716705 crossref_citationtrail_10_1109_TNET_2011_2108314 crossref_primary_10_1109_TNET_2011_2108314 proquest_journals_898212896 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2011-Oct. 2011-10-00 20111001 |
| PublicationDateYYYYMMDD | 2011-10-01 |
| PublicationDate_xml | – month: 10 year: 2011 text: 2011-Oct. |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE/ACM transactions on networking |
| PublicationTitleAbbrev | TNET |
| PublicationYear | 2011 |
| 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 | ref13 ref12 ref15 ref14 ref11 livingston (ref18) 1990; 79 garey (ref19) 1979 ref10 ref2 ref1 sharma (ref5) 2006 birand (ref17) 2009 ref24 ref23 ref25 ref20 ref22 ref21 ref8 west (ref16) 2001 ref9 ref4 ref3 ref6 sharma (ref7) 2007 |
| References_xml | – ident: ref21 doi: 10.1109/TIT.2007.913537 – ident: ref13 doi: 10.1145/1374618.1374634 – ident: ref8 doi: 10.1239/aap/1151337082 – ident: ref24 doi: 10.1109/INFCOM.2007.11 – ident: ref4 doi: 10.1109/PERCOMW.2006.79 – ident: ref23 doi: 10.1109/INFOCOM.2006.176 – ident: ref25 doi: 10.1109/INFCOM.2007.191 – ident: ref2 doi: 10.1109/TNET.2006.872546 – ident: ref12 doi: 10.1214/aoap/1177004828 – year: 2001 ident: ref16 publication-title: Introduction to Graph Theory – year: 1979 ident: ref19 publication-title: Computers and Intractability A Guide to the Theory of NP-Completeness – ident: ref11 doi: 10.1109/18.825799 – ident: ref6 doi: 10.1109/9.182479 – ident: ref9 doi: 10.1109/ITA.2008.4601094 – start-page: 227 year: 2006 ident: ref5 article-title: On the complexity of scheduling in wireless networks publication-title: Proc ACM MobiCom – ident: ref20 doi: 10.1007/BF02579273 – ident: ref14 doi: 10.1109/INFCOM.2010.5462046 – year: 2009 ident: ref17 publication-title: Analyzing the performance of greedy maximal scheduling via local pooling and graph theory – volume: 79 start-page: 187 year: 1990 ident: ref18 article-title: Perfect dominating sets publication-title: Congressus Numerantium – ident: ref3 doi: 10.1109/JSAC.2004.830909 – ident: ref22 doi: 10.1109/CDC.2006.376968 – ident: ref10 doi: 10.1109/TNET.2008.918109 – ident: ref1 doi: 10.1109/TNET.2009.2026276 – start-page: 2072 year: 2007 ident: ref7 article-title: Joint congestion control and distributed scheduling for throughput guarantees in wireless networks publication-title: Proc IEEE InfoCom doi: 10.1109/INFCOM.2007.240 – ident: ref15 doi: 10.1145/1530748.1530771 |
| SSID | ssj0013026 |
| Score | 2.033401 |
| Snippet | One of the major challenges in wireless networking is how to optimize the link scheduling decisions under interference constraints. Recently, a few algorithms... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1382 |
| SubjectTerms | Algorithms Communities Focusing Interference local pooling Longest Queue First (LQF) policy Optimization Policies Recognition Schedules Scheduling Scheduling algorithm stability Stability analysis Studies Wireless networks wireless networks scheduling |
| Title | A Refined Performance Characterization of Longest-Queue-First Policy in Wireless Networks |
| URI | https://ieeexplore.ieee.org/document/5716705 https://www.proquest.com/docview/898212896 https://www.proquest.com/docview/963841611 |
| Volume | 19 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1La9wwEB7SnJJD89iWbjcpOvRU4q0s-SEdl7BLCM2SlA2kJ2ONJQhZ7NBdX_LrM7K9zpPSm4xkI2akeXhmvgH4HuYKrcIkkEr4MCPxQmHqAuSY0wQJwCZ5_GKenF1H5zfxzRac9LUw1tom-cyO_bCJ5RcV1v5XGTnvYZJ6wNIPdMzaWq2niAFvWquRhyODJNGii2CGXP9czKeLFqyT_Bslw-iFDmqaqryRxI16me3BxWZjbVbJ3bhemzE-vMJs_N-d78PHzs5kk_ZgHMCWLQ9h9xn64AD-TNhv6-i5YJdP5QPstIdwbis0WeXYr6r0cajgqra1DWa3ZDKyFlGY3ZbMZ9AuSWKyeZtTvvoE17Pp4vQs6DotBEgG1TowLncOQ-dcjKT0rRZIllhRCGdFbHKhuZYmigQ3JkcdYSGlxUSmMjc6NpGSn2G7rEr7BVgUK5ITKVc5GSe6EIYjJpF1ToYFDdMh8A3tM-xgyH03jGXWuCNcZ55dmWdX1rFrCD_6V-5bDI5_LR548vcLO8oPYbRhcNbd0lWmtCLNrXQyBNbP0vXyMZO8tFW9yrx88j5g-PX9745gR2yyAsMj2F7_re0xmSlr8605n4-dguQ2 |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwEB5V5QAcyqMglvLwgRMii2M7iX2sqq4W2F0B2krlZMUTW6qokordXPj1jJNsChRV3BzZiawZex6ZmW8A3qSlRq8xT6QWMcxIvNBYhAQ5ljRBArBLHl-u8vmZ-niene_Bu7EWxnvfJZ_5aRx2sfyqwTb-KiPnPc2LCFh6h_S-yvpqreuYAe-aq5GPI5M8N2KIYabcvF-vTtc9XCd5OFqm6g8t1LVVuSGLOwUzewDL3db6vJLv03brpvjzL9TG_937QzgYLE123B-NR7Dn68dw_zf8wUP4dsy--kDPFft8XUDATkYQ575GkzWBLZo6RqKSL61vfTK7IKOR9ZjC7KJmMYf2kmQmW_VZ5ZsncDY7XZ_Mk6HXQoJkUm0TF8oQMA0hZEhq3xuBZItVlQheZK4UhhvplBLcuRKNwkpKj7ksZOlM5pSWT2G_bmr_DJjKNEmKguuSzBNTCccRc-VDkGlFw2ICfEd7iwMQeeyHcWk7h4QbG9llI7vswK4JvB1fuepROG5bfBjJPy4cKD-Box2D7XBPN1YbTbpbm3wCbJylCxajJmXtm3Zjo4SKXmD6_N_ffQ135-vlwi4-rD4dwT2xyxFMX8D-9kfrX5LRsnWvurP6C7Zr54M |
| 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=A+Refined+Performance+Characterization+of+Longest-Queue-First+Policy+in+Wireless+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Bo+Li&rft.au=Boyaci%2C+C.&rft.au=Ye+Xia&rft.date=2011-10-01&rft.pub=IEEE&rft.issn=1063-6692&rft.volume=19&rft.issue=5&rft.spage=1382&rft.epage=1395&rft_id=info:doi/10.1109%2FTNET.2011.2108314&rft.externalDocID=5716705 |
| 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 |