Stable Throughput for Multicast With Random Linear Coding
This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory Jg. 57; H. 1; S. 267 - 281 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.01.2011
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from a single queue. We juxtapose this to a coding strategy that is simply a form of classical random linear coding. We show that there are configurations for which the stable throughput region of the scheduling strategy is a strict subset of the corresponding throughput region of the coding strategy. This analysis is performed for both time-invariant and time-varying channels. The analysis is also performed both with and without accounting for the impact on throughput of including coding overhead symbols in each encoded packet. Additionally, we compare coding strategies that only code within individual queues against a coding strategy that codes across separate queues. The strategy that codes across queues simply sends packets from all queues to all receivers. As a result, this strategy sends many packets to unnecessary recipients. We show, surprisingly, that there are cases where the strategy that codes across queues can achieve the same throughput region achievable by coding within individual queues. |
|---|---|
| AbstractList | This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from a single queue. We juxtapose this to a coding strategy that is simply a form of classical random linear coding. We show that there are configurations for which the stable throughput region of the scheduling strategy is a strict subset of the corresponding throughput region of the coding strategy. This analysis is performed for both time-invariant and time-varying channels. The analysis is also performed both with and without accounting for the impact on throughput of including coding overhead symbols in each encoded packet. Additionally, we compare coding strategies that only code within individual queues against a coding strategy that codes across separate queues. The strategy that codes across queues simply sends packets from all queues to all receivers. As a result, this strategy sends many packets to unnecessary recipients. We show, surprisingly, that there are cases where the strategy that codes across queues can achieve the same throughput region achievable by coding within individual queues. This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each time slot, a scheduler observes the lengths of all queues and the connectivities of all links and can transmit the head-of-the-line packet from a single queue. We juxtapose this to a coding strategy that is simply a form of classical random linear coding. We show that there are configurations for which the stable throughput region of the scheduling strategy is a strict subset of the corresponding throughput region of the coding strategy. This analysis is performed for both time-invariant and time-varying channels. The analysis is also performed both with and without accounting for the impact on throughput of including coding overhead symbols in each encoded packet. Additionally, we compare coding strategies that only code within individual queues against a coding strategy that codes across separate queues. The strategy that codes across queues simply sends packets from all queues to all receivers. As a result, this strategy sends many packets to unnecessary recipients. We show, surprisingly, that there are cases where the strategy that codes across queues can achieve the same throughput region achievable by coding within individual queues. [PUBLICATION ABSTRACT] |
| Author | Ephremides, Anthony Cogill, Randy Shrader, Brooke |
| Author_xml | – sequence: 1 givenname: Randy surname: Cogill fullname: Cogill, Randy email: rcogill@virginia.edu organization: Dept. of Syst. & Inf. Eng., Univ. of Virginia, Charlottesville, VA, USA – sequence: 2 givenname: Brooke surname: Shrader fullname: Shrader, Brooke email: brooke.shrader@ll.mit.edu organization: Lincoln Lab., Massachusetts Inst. of Technol., Lexington, MA, USA – sequence: 3 givenname: Anthony surname: Ephremides fullname: Ephremides, Anthony email: etony@umd.edu organization: Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23746795$$DView record in Pascal Francis |
| BookMark | eNp9kM9LHDEUx4NY6Gq9F7wMguBlNJn8PsrSWmGl0K70GDIzL25kNlmTzKH_vZHd9uDB0-PL-3wfj88JOg4xAEJfCb4mBOub9f36usM1dVjjjrAjtCCcy1YLzo7RAmOiWs2Y-oxOcn6ukXHSLZD-XWw_QbPepDg_bXZzaVxMzcM8FT_YXJo_vmyaXzaMcdusfACbmmUcfXj6gj45O2U4O8xT9Pj923r5o139vLtf3q7agXJaWiuxBIl7oQAc5aNwWg39yPqOUOGwHq0aBe4cYNDget4rNRJnZV1Twl1PT9HV_u4uxZcZcjFbnweYJhsgztkQIQnlijFd0Yt36HOcU6jfGUUl5RxzUqHLA2TzYCeXbBh8Nrvktzb9NR2VTEjNKyf23JBizgmcGXyxxcdQkvWTIdi8iTdVvHkTbw7iaxG_K_67_UHlfF_xAPAf50JSiRl9BdCzjjA |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_TIT_2016_2537837 crossref_primary_10_1109_TNET_2013_2295608 crossref_primary_10_1109_JSAC_2011_110517 crossref_primary_10_1109_TIT_2014_2337311 crossref_primary_10_1109_TIT_2011_2171516 crossref_primary_10_1109_TVT_2014_2365181 crossref_primary_10_1109_TCOMM_2012_102512_120046 crossref_primary_10_1109_TIT_2016_2634007 crossref_primary_10_1109_TMC_2017_2687928 |
| Cites_doi | 10.1109/ISIT.2003.1228459 10.1109/WIOPT.2006.1666502 10.1109/TIT.2008.2006454 10.1002/j.1538-7305.1960.tb03959.x 10.1109/ITW.2006.322852 10.1109/LCOMM.2011.031611.101189 10.1109/ALLERTON.2008.4797576 10.1049/ip-com:20050237 10.1109/49.329342 10.1109/ISIT.2006.261959 10.1109/TIT.2002.807285 10.1109/TIT.2010.2095110 10.1109/ISIT.2008.4594942 10.1109/18.212277 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TIT.2010.2090214 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis 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 Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EISSN | 1557-9654 |
| EndPage | 281 |
| ExternalDocumentID | 2236025641 23746795 10_1109_TIT_2010_2090214 5673704 |
| Genre | orig-research Feature |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c353t-a707e70b68eef35d6f98cbd4b2136f09da8d602fe0e9efb5b88d1fa7213315fb3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 19 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000285842100018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Thu Oct 02 05:35:46 EDT 2025 Sun Nov 30 04:32:49 EST 2025 Mon Jul 21 09:13:47 EDT 2025 Sat Nov 29 03:53:10 EST 2025 Tue Nov 18 22:18:25 EST 2025 Tue Aug 26 17:16:41 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Time variable channel Wireless telecommunication Information rate Teletraffic Downlink Cross-layer control wireless networks Scheduling queueing systems Random coding Information transmission Data broadcast Information dissemination random linear coding Multicast Time invariance Linear coding Queueing system Traffic management Cross-layer approach Traffic control Wireless network Connectedness |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c353t-a707e70b68eef35d6f98cbd4b2136f09da8d602fe0e9efb5b88d1fa7213315fb3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 837355051 |
| PQPubID | 36024 |
| PageCount | 15 |
| ParticipantIDs | proquest_journals_837355051 crossref_citationtrail_10_1109_TIT_2010_2090214 crossref_primary_10_1109_TIT_2010_2090214 ieee_primary_5673704 pascalfrancis_primary_23746795 proquest_miscellaneous_1671358449 |
| PublicationCentury | 2000 |
| PublicationDate | 2011-Jan. 2011-01-00 2011 20110101 |
| PublicationDateYYYYMMDD | 2011-01-01 |
| PublicationDate_xml | – month: 01 year: 2011 text: 2011-Jan. |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2011 |
| 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 | meyn (ref18) 2007 ref12 ref15 ref14 cogill (ref5) 2008 ref11 ref22 ref21 ref2 ref17 draper (ref6) 2006 ref16 ross (ref20) 2007 ref19 ho (ref13) 2006 ref8 ref7 ghaderi (ref10) 2007 ref4 ref3 georgiadis (ref9) 2006 asmussen (ref1) 1987 |
| References_xml | – year: 2006 ident: ref6 article-title: rateless coding for non-ergodic channels with decoder channel state information publication-title: IEEE Trans Inf Theory – year: 2006 ident: ref13 article-title: on constructive network coding for multiple unicasts publication-title: Proc Forty-Fourth Allerton Conference on Communication Control and Computing – ident: ref14 doi: 10.1109/ISIT.2003.1228459 – ident: ref16 doi: 10.1109/WIOPT.2006.1666502 – ident: ref8 doi: 10.1109/TIT.2008.2006454 – ident: ref11 doi: 10.1002/j.1538-7305.1960.tb03959.x – ident: ref21 doi: 10.1109/ITW.2006.322852 – ident: ref19 doi: 10.1109/LCOMM.2011.031611.101189 – year: 1987 ident: ref1 publication-title: Applied Probability and Queues – year: 2007 ident: ref10 publication-title: Reliability Benefit of Network Coding – year: 2007 ident: ref20 publication-title: Introduction to Probability Models – ident: ref3 doi: 10.1109/ALLERTON.2008.4797576 – year: 2006 ident: ref9 publication-title: Foundations and Trends in Networking – year: 2008 ident: ref5 article-title: stable throughput for multicast with intersession network coding publication-title: IEEE Military Communications Conference – ident: ref17 doi: 10.1049/ip-com:20050237 – ident: ref12 doi: 10.1109/49.329342 – ident: ref2 doi: 10.1109/ISIT.2006.261959 – ident: ref15 doi: 10.1109/TIT.2002.807285 – ident: ref7 doi: 10.1109/TIT.2010.2095110 – year: 2007 ident: ref18 article-title: stability and asymptotic optimality of generalized maxweight policies publication-title: SIAM J Contr Optim – ident: ref4 doi: 10.1109/ISIT.2008.4594942 – ident: ref22 doi: 10.1109/18.212277 |
| SSID | ssj0014512 |
| Score | 2.1048863 |
| Snippet | This paper compares scheduling and coding strategies for a multicast version of a classic downlink problem. We consider scheduling strategies where, in each... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 267 |
| SubjectTerms | Accounting Applied sciences Channels Codes Coding Coding, codes Connectivity Cross-layer control Encoding Exact sciences and technology Information processing Information theory Information, signal and communications theory Markov processes Multicast Packet transmission Queueing analysis queueing systems Queues Queuing random linear coding Receivers Scheduling Signal and communications theory Stability criteria Strategy Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teletraffic Throughput Transmission and modulation (techniques and equipments) wireless networks |
| Title | Stable Throughput for Multicast With Random Linear Coding |
| URI | https://ieeexplore.ieee.org/document/5673704 https://www.proquest.com/docview/837355051 https://www.proquest.com/docview/1671358449 |
| Volume | 57 |
| WOSCitedRecordID | wos000285842100018&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: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS91AEB-seGgP1aqlqVW20Euh8e1X9uNYRFEoIuW1egvZzSwVbFJMXv_-7iZ5QWkpCDkEdkLCzE5mZufjB_DBGRk0V6msSvNcOpHQALnOla98jdx7McC9ff-iLy_NzY292oBPcy8MIg7FZ3icbodcft36VToqWxQJVCUN_3ymtRp7teaMgSzYOBmcRQWOMcc6JUntYnmxHGu4eCpCZPKRCRowVVJFZNVFpoQRzeKvH_Ngbc62n_adO_By8irJ53EbvIINbHZhe43YQCYF3oUXD8YP7oGNnqa7Q7IcsXoiLYkuLBl6cn3V9eT6tv9BvlZN3f4kMWiNSkFO2mTs9uHb2eny5DyfoBRyLwrR55WmGjV1yiAGUdQqWONdLR1nQgVq68rUivKAFC0GVzhjahaqGB4KwYrgxGvYbNoG3wCxwmjPXHS0OEqK2jrLOXPRLZPKiUAzWKy5W_ppzniCu7grh3iD2jLKo0zyKCd5ZPBxfuLXOGPjP7R7id8z3cTqDI4eCXBe5yLhqdgig4O1RMtJS7syBuciRWgsg_fzalSvlDOpGmxXXclUwjA0Utq3_37zATwfj5nT9Q42-_sVHsKW_93fdvdHwx79A16A4gE |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3Na9VAEB9KFdSD1VYx1tYVvAjGt1_J7h5LaWnx-RCJ2lvIbmZpoSbS5Pn3u5vkhRZFEHII7ISEmZ3MzM7HD-Ct1dIrnseyKsVTaUVEA-QqzV3lauTOiQHu7dtSrVb64sJ83oL3cy8MIg7FZ_gh3g65_Lp163hUtsgiqEoc_nkvk5LTsVtrzhnIjI2zwVlQ4RB1bJKS1CyK82Ks4uKxDJHJO0ZoQFWJNZFVF9jiRzyLP37Ng7053fm_L30Cjye_khyNG-EpbGGzCzsbzAYyqfAuPLo1gHAPTPA17TWSYkTrCbQkOLFk6Mp1VdeT71f9JflSNXX7g4SwNagFOW6juXsGX09PiuOzdAJTSJ3IRJ9WiipU1OYa0Yuszr3RztbSciZyT01d6Tqn3CNFg95mVuua-SoEiEKwzFvxHLabtsEXQIzQyjEbXC2OkqIy1nDObHDMZG6FpwksNtwt3TRpPAJeXJdDxEFNGeRRRnmUkzwSeDc_8XOcsvEP2r3I75luYnUCh3cEOK9zERFVTJbA_kai5aSnXRnCcxFjNJbAm3k1KFjMmlQNtuuuZHlEMdRSmpd_f_NreHBWfFqWy_PVx314OB46x-sVbPc3azyA--5Xf9XdHA779TdGpuVI |
| 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+Throughput+for+Multicast+With+Random+Linear+Coding&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=COGILL%2C+Randy&rft.au=SHRADER%2C+Brooke&rft.au=EPHREMIDES%2C+Anthony&rft.date=2011&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=0018-9448&rft.volume=57&rft.issue=1&rft.spage=267&rft.epage=281&rft_id=info:doi/10.1109%2FTIT.2010.2090214&rft.externalDBID=n%2Fa&rft.externalDocID=23746795 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |