组播擦除信道的排队延迟

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI:10.1109/ITW2.2006.323834

B. Shrader, A. Ephremides

{"title":"组播擦除信道的排队延迟","authors":"B. Shrader, A. Ephremides","doi":"10.1109/ITW2.2006.323834","DOIUrl":null,"url":null,"abstract":"In this work we address the stability and delay performance of a multicast erasure channel with random arrivals at the source node. We consider both a standard retransmission (ARQ) scheme as well as random linear coding. Our results show that while random linear coding may outperform re-transmissions for heavy traffic, the delay incurred by the use of random linear codes is significantly higher when the source is lightly loaded","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"On the queueing delay of a multicast erasure channel\",\"authors\":\"B. Shrader, A. Ephremides\",\"doi\":\"10.1109/ITW2.2006.323834\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we address the stability and delay performance of a multicast erasure channel with random arrivals at the source node. We consider both a standard retransmission (ARQ) scheme as well as random linear coding. Our results show that while random linear coding may outperform re-transmissions for heavy traffic, the delay incurred by the use of random linear codes is significantly higher when the source is lightly loaded\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323834\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 37

摘要

在这项工作中，我们解决了随机到达源节点的多播擦除信道的稳定性和延迟性能。我们既考虑了标准重传(ARQ)方案，也考虑了随机线性编码。我们的研究结果表明，虽然随机线性编码在大流量时可能比重传性能更好，但当源负载较轻时，使用随机线性编码引起的延迟明显更高

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the queueing delay of a multicast erasure channel

In this work we address the stability and delay performance of a multicast erasure channel with random arrivals at the source node. We consider both a standard retransmission (ARQ) scheme as well as random linear coding. Our results show that while random linear coding may outperform re-transmissions for heavy traffic, the delay incurred by the use of random linear codes is significantly higher when the source is lightly loaded

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

自引率

0.00%

发文量