Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as "generalized constrained queueing networks" which form the basis of several different communication networks and information systems. These networks consist of a collection of queues such that only certain sets of queues can be concur...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on automatic control Jg. 53; H. 8; S. 1913 - 1931 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.09.2008
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0018-9286, 1558-2523 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider a class of queueing networks referred to as "generalized constrained queueing networks" which form the basis of several different communication networks and information systems. These networks consist of a collection of queues such that only certain sets of queues can be concurrently served. Whenever a queue is served, the system receives a certain reward. Different rewards are obtained for serving different queues, and furthermore, the reward obtained for serving a queue depends on the set of concurrently served queues. We demonstrate that the dependence of the rewards on the schedules alter fundamental relations between performance metrics like throughput and stability. Specifically, maximizing the throughput is no longer equivalent to maximizing the stability region; we therefore need to maximize one subject to certain constraints on the other. Since stability is critical for bounding packet delays and buffer overflow, we focus on maximizing the throughput subject to stabilizing the system. We design provably optimal scheduling strategies that attain this goal by scheduling the queues for service based on the queue lengths and the rewards provided by different selections. The proposed scheduling strategies are however computationally complex. We subsequently develop techniques to reduce the complexity and yet attain the same throughput and stability region. We demonstrate that our framework is general enough to accommodate random rewards and random scheduling constraints. |
|---|---|
| AbstractList | We consider a class of queueing networks referred to as "generalized constrained queueing networks" which form the basis of several different communication networks and information systems. These networks consist of a collection of queues such that only certain sets of queues can be concurrently served. Whenever a queue is served, the system receives a certain reward. Different rewards are obtained for serving different queues, and furthermore, the reward obtained for serving a queue depends on the set of concurrently served queues. We demonstrate that the dependence of the rewards on the schedules alter fundamental relations between performance metrics like throughput and stability. Specifically, maximizing the throughput is no longer equivalent to maximizing the stability region; we therefore need to maximize one subject to certain constraints on the other. Since stability is critical for bounding packet delays and buffer overflow, we focus on maximizing the throughput subject to stabilizing the system. We design provably optimal scheduling strategies that attain this goal by scheduling the queues for service based on the queue lengths and the rewards provided by different selections. The proposed scheduling strategies are however computationally complex. We subsequently develop techniques to reduce the complexity and yet attain the same throughput and stability region. We demonstrate that our framework is general enough to accommodate random rewards and random scheduling constraints. Specifically, maximizing the throughput is no longer equivalent to maximizing the stability region; we therefore need to maximize one subject to certain constraints on the other. Since stability is critical for bounding packet delays and buffer overflow, we focus on maximizing the throughput subject to stabilizing the system. |
| Author | Sarkar, S. Chaporkar, P. |
| Author_xml | – sequence: 1 givenname: P. surname: Chaporkar fullname: Chaporkar, P. organization: Indian Inst. of Technol., Mumbai – sequence: 2 givenname: S. surname: Sarkar fullname: Sarkar, S. |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20707400$$DView record in Pascal Francis |
| BookMark | eNqFks1v1DAQxS1UJLaFMwcuERJwytZf8cexWpWC1KpFu5yN44y7rrL2YicS7V9Poi0cKhVOM2P93pPGb47RUUwREHpL8JIQrE83Z6slxVgtNdVM0hdoQZpG1bSh7AgtMCaq1lSJV-i4lLtpFJyTBfqxHmzbQ7V2W-jGPsTb6ib1wQUolU-5urK_wi48zO-bbU7j7XY_DlWI1QVEyLYPD9BVqxTLkG2IU_9thBFmfH1fBtiV1-ilt32BN4_1BH3_fL5Zfakvry--rs4ua8cJG2rQ0reyYdIL77jFTmoOLW09VlQr1wChuqNcCeuoFlR1hHTUg8UMGKdty07Qp4PvPqefI5TB7EJx0Pc2QhqL0ZgJTqhk_yWVwqKhnKuJ_PhPknEuKRaz5fsn4F0ac5z2NUqwRiiN9QR9eIRscbb32UYXitnnsLP53lAsseQYT1xz4FxOpWTwxoXBDiHF-Y97Q7CZAzdT4GYO3BwCn3SnT3R_rJ9XvDsoAgD8pbmYboYI9huvfLb8 |
| CODEN | IETAA9 |
| CitedBy_id | crossref_primary_10_1186_1687_1499_2012_231 crossref_primary_10_1109_TWC_2014_2356502 crossref_primary_10_1016_j_comcom_2012_11_001 crossref_primary_10_1145_3399805 crossref_primary_10_1109_TMC_2010_90 crossref_primary_10_1109_WCL_2012_100912_120512 |
| Cites_doi | 10.1109/CDC.2005.1583011 10.1109/CDC.1990.203568 10.1145/509506.509514 10.1109/INFCOM.2000.832229 10.1145/384268.378438 10.1109/TIT.2002.802619 10.1109/90.720869 10.1239/aap/1077134474 10.1109/ICDSC.2001.918957 10.1007/s11134-005-1450-0 10.1109/INFCOM.2005.1497924 10.1109/CDC.1995.479154 10.1109/TIT.2006.881756 10.1017/S0269964802162048 10.1109/TIT.2005.847710 10.1145/285243.285258 10.1109/INFCOM.2005.1498460 10.1109/INFCOM.1998.665071 10.1109/TAC.2008.2006820 10.1109/INFCOM.2004.1357002 10.1109/CDC.2005.1582976 10.1109/9.341782 10.1017/CBO9780511984020 10.1023/A:1024714024248 10.1109/INFOCOM.2006.267 10.1109/TNET.2004.842226 10.1007/s11134-005-0858-x 10.1145/263876.263881 10.1109/9.182479 10.1109/TNET.2006.880175 |
| ContentType | Journal Article |
| Copyright | 2008 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008 |
| Copyright_xml | – notice: 2008 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D F28 |
| DOI | 10.1109/TAC.2008.929372 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering 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 |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1558-2523 |
| EndPage | 1931 |
| ExternalDocumentID | 2330733611 20707400 10_1109_TAC_2008_929372 4625216 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 VJK ~02 AAYXX CITATION IQODW RIG 7SC 7SP 7TB 8FD FR3 JQ2 L7M L~C L~D F28 |
| ID | FETCH-LOGICAL-c413t-e97fb7537f6fc4a0c794eb2bf08298c5e129d2486ac29628d11d2fea03e342bb3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000259641500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9286 |
| IngestDate | Thu Oct 02 05:45:13 EDT 2025 Thu Oct 02 06:58:16 EDT 2025 Mon Sep 29 06:43:29 EDT 2025 Mon Jun 30 10:16:37 EDT 2025 Mon Jul 21 09:17:07 EDT 2025 Tue Nov 18 20:55:36 EST 2025 Sat Nov 29 02:25:51 EST 2025 Wed Aug 27 02:48:37 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Keywords | Overflow(computer arithmetics) Optimal policy Constrained queueing networks Stability region Randomized algorithm Queueing network Delay Optimal design Multicast Queue length optimization Service differentiation throughput Queue stability Probabilistic approach Scheduling Distributed system Buffer system Constrained optimization Randomized design Queueing system randomized algorithms Wireless network Metric wireless Reward |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c413t-e97fb7537f6fc4a0c794eb2bf08298c5e129d2486ac29628d11d2fea03e342bb3 |
| 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 | 863568909 |
| PQPubID | 23500 |
| PageCount | 19 |
| ParticipantIDs | crossref_citationtrail_10_1109_TAC_2008_929372 proquest_miscellaneous_34472063 proquest_miscellaneous_880652448 proquest_miscellaneous_903641273 crossref_primary_10_1109_TAC_2008_929372 ieee_primary_4625216 proquest_journals_863568909 pascalfrancis_primary_20707400 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-09-01 |
| PublicationDateYYYYMMDD | 2008-09-01 |
| PublicationDate_xml | – month: 09 year: 2008 text: 2008-09-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on automatic control |
| PublicationTitleAbbrev | TAC |
| PublicationYear | 2008 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref35 ref13 ref34 ref12 ref36 ref14 ref31 ref30 ref33 ref11 ref32 ref2 ref1 ref16 ref19 ref18 chaporkar (ref10) 2005 ref24 meyn (ref26) 2000 ref25 chandra (ref9) 2001 ref20 ref21 cormen (ref17) 2001 ref28 ref27 chaporkar (ref15) 2008 bonald (ref7) 2001 ref29 ref8 hochbaum (ref22) 1996 ref4 ref3 ref6 ref5 keslassy (ref23) 2001 |
| References_xml | – ident: ref36 doi: 10.1109/CDC.2005.1583011 – ident: ref6 doi: 10.1109/CDC.1990.203568 – ident: ref21 doi: 10.1145/509506.509514 – ident: ref18 doi: 10.1109/INFCOM.2000.832229 – year: 2001 ident: ref7 article-title: impact of fairness on internet performance publication-title: Proc ACM SIGMETRICS doi: 10.1145/384268.378438 – ident: ref32 doi: 10.1109/TIT.2002.802619 – ident: ref28 doi: 10.1109/90.720869 – ident: ref4 doi: 10.1239/aap/1077134474 – start-page: 275 year: 2001 ident: ref9 article-title: anonymous gossip: improving multicast reliability in mobile ad-hoc networks publication-title: Proc 21st Int Conf Distributed Comput Syst (ICDCS) doi: 10.1109/ICDSC.2001.918957 – ident: ref33 doi: 10.1007/s11134-005-1450-0 – year: 2001 ident: ref23 article-title: analysis of scheduling algorithms that provide 100% throughput in input-queued switches publication-title: Proc 39th Annu Allerton Conf Commun Control Comput – year: 2000 ident: ref26 publication-title: Markov Decision Processes Models Methods Directions and Open Problems – ident: ref27 doi: 10.1109/INFCOM.2005.1497924 – ident: ref2 doi: 10.1109/CDC.1995.479154 – year: 1996 ident: ref22 publication-title: Approximation Algorithms for NP-Hard Problems – ident: ref13 doi: 10.1109/TIT.2006.881756 – ident: ref3 doi: 10.1017/S0269964802162048 – ident: ref12 doi: 10.1109/TIT.2005.847710 – ident: ref8 doi: 10.1145/285243.285258 – ident: ref25 doi: 10.1109/INFCOM.2005.1498460 – ident: ref34 doi: 10.1109/INFCOM.1998.665071 – ident: ref29 doi: 10.1109/TAC.2008.2006820 – year: 2001 ident: ref17 publication-title: Introduction to Algorithms – ident: ref31 doi: 10.1109/INFCOM.2004.1357002 – ident: ref11 doi: 10.1109/CDC.2005.1582976 – ident: ref24 doi: 10.1109/9.341782 – ident: ref20 doi: 10.1017/CBO9780511984020 – ident: ref1 doi: 10.1023/A:1024714024248 – ident: ref14 doi: 10.1109/INFOCOM.2006.267 – ident: ref19 doi: 10.1109/TNET.2004.842226 – ident: ref5 doi: 10.1007/s11134-005-0858-x – year: 2005 ident: ref10 article-title: throughput guarantees through maximal scheduling in multihop wireless networks publication-title: Proc 43d Annu Allerton Conf Communication Control Comput – ident: ref30 doi: 10.1145/263876.263881 – year: 2008 ident: ref15 publication-title: Stable scheduling policies for maximizing throughput in generalized constrained queueing systems – ident: ref35 doi: 10.1109/9.182479 – ident: ref16 doi: 10.1109/TNET.2006.880175 |
| SSID | ssj0016441 |
| Score | 1.935607 |
| Snippet | We consider a class of queueing networks referred to as "generalized constrained queueing networks" which form the basis of several different communication... Specifically, maximizing the throughput is no longer equivalent to maximizing the stability region; we therefore need to maximize one subject to certain... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1913 |
| SubjectTerms | Applied sciences Buffer overflow Communication networks Communications networks Computer science; control theory; systems Computer systems and distributed systems. User interface Constrained queueing networks Constraints Delay Exact sciences and technology Information systems Measurement multicast Networks Operational research and scientific management Operational research. Management science Operations research Optimal scheduling optimization Policies Processor scheduling Queues Queuing theory Queuing theory. Traffic theory randomized algorithms Scheduling Software Stability Strategy Studies Throughput wireless Wireless networks |
| Title | Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems |
| URI | https://ieeexplore.ieee.org/document/4625216 https://www.proquest.com/docview/863568909 https://www.proquest.com/docview/34472063 https://www.proquest.com/docview/880652448 https://www.proquest.com/docview/903641273 |
| Volume | 53 |
| WOSCitedRecordID | wos000259641500011&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 Electronic Library (IEL) customDbUrl: eissn: 1558-2523 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016441 issn: 0018-9286 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB61FQc48CqIUCg-cOBAWttxHPtYVVQcoAKxSL2FxLFRpJKtuhuE-uuZsbMRFeyBWxRPIsfjeWXG3wC8dkpJoYPKXVeGHD1ikjnOc2-1aksvUAFGENcP1fm5ubiwn3bg7XwWxnsfi8_8EV3GXH63dCP9KjtW6Kzjm3dht6p0Oqs1ZwzIrietiwIsjZ5gfAS3x4uT01Q0ia5AUclbFii2VKGCyGaFaxJSM4u_9HI0NmcP_m-aD-H-5FSyk7QLHsGOHx7DvT-gBvfhG3qV7aVnX5BJHVWff2cREhgDZYZ-K_vY_Op_9Dd0f5Fa91yNa9YPbMKl7m98x6i7Z-wpgdefRz96Ip8wz5_A17N3i9P3-dRdIXdouNbIjSq0GKxUQQenGu5QMjHMbgOdtjUO-SRtJ5XRjZNWS9MJ0cngG174Qsm2LZ7C3rAc_DNgqpNc27J0HqMrq0WrlQkYVwrqp65dmcHRZsVrN0GP02wv6xiCcFsji1JDzMSiDN7MD1wl1I3tpPvEgZlsWvwMDm-xdB6XhG-EiiuDgw2P60lsV7UhtD5juc3g1TyK8kZJlGbwy3FVE0Iifm2RAdtCYShXjV6T2U5iKfsr0HN8_u_ZH8DdTV0KFy9gb309-pdwx_1c96vrw7jxfwPvIABo |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VggQc-CqIUGh94MCBtLbjeO1jVVEVsV2BWKTeQuLYVaSSrbobhPrrmXGyERXsgZsVTyLHk7FnMuP3AN46paTQQaWuzkOKHjHZHOept1pVuRe4AEYQ1-lkNjPn5_bzFrwfz8J472PxmT-gZszl1wvX0a-yQ4XOOj75Dtwl5izRn9Yacwa0s_frLpqwNHoA8hHcHs6PjvuySXQGsom8tQdFUhUqiSyXOCuhp7P4a2WO283J4_8b6BN4NLiV7Kj_Dp7Clm-fwcM_wAZ34Dv6ldWlZ19RTTXVn1-wCAqMoTJDz5Wdlb-aH80NXZ_35D1X3Yo1LRuQqZsbXzPi94ysEtj-0vnOk_iAev4cvp18mB-fpgO_Qupw61qhPiahwnBlEnRwquQObRMD7SrQeVvjUFPS1lIZXTpptTS1ELUMvuSZz5SsquwFbLeL1r8EpmrJtc1z5zG-slpUWpmAkaUgRnXt8gQO1jNeuAF8nEZ7WcQghNsCVdRTYvYqSuDdeMNVj7uxWXSHNDCKDZOfwN4tlY79khCOcOlKYHet42Iw3GVhCK_PWG4T2B970eIojVK2ftEtC8JIxLfNEmAbJAxlq9FvMptFLOV_BfqOr_49-n24fzo_mxbTj7NPu_BgXaXCxWvYXl13_g3ccz9XzfJ6LxrBb2EKA68 |
| 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=Stable+Scheduling+Policies+for+Maximizing+Throughput+in+Generalized+Constrained+Queueing+Systems&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Chaporkar%2C+P&rft.au=Sarkar%2C+S&rft.date=2008-09-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9286&rft.eissn=1558-2523&rft.volume=53&rft.issue=8&rft.spage=1913&rft_id=info:doi/10.1109%2FTAC.2008.929372&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2330733611 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon |