具有突发擦除的编码两跳网络的时延和能量性能

D. Lucani, J. Kliewer
{"title":"具有突发擦除的编码两跳网络的时延和能量性能","authors":"D. Lucani, J. Kliewer","doi":"10.1109/ISWCS.2011.6125410","DOIUrl":null,"url":null,"abstract":"We consider two-hop line networks where the communication links are bursty packet erasure channels modeled as a simple two-state Gilbert-Elliott channel. The first and second node in the line have local information with Poisson-distributed arrivals available and intend to communicate this information to the receiving node in the line. We consider an online approach and random linear network coding for erasure correction. We provide a queueing-theoretic analysis of two different models, a genie aided full duplex model and a partially genie aided half-duplex model, where the genie only provides the channel state information. Channel-aware policies are shown to reduce delay by up to a factor of 3 in our examples and significantly increase the network's stable throughput region compared to a simple queue-length driven policy.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On the delay and energy performance in coded two-hop line networks with bursty erasures\",\"authors\":\"D. Lucani, J. Kliewer\",\"doi\":\"10.1109/ISWCS.2011.6125410\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider two-hop line networks where the communication links are bursty packet erasure channels modeled as a simple two-state Gilbert-Elliott channel. The first and second node in the line have local information with Poisson-distributed arrivals available and intend to communicate this information to the receiving node in the line. We consider an online approach and random linear network coding for erasure correction. We provide a queueing-theoretic analysis of two different models, a genie aided full duplex model and a partially genie aided half-duplex model, where the genie only provides the channel state information. Channel-aware policies are shown to reduce delay by up to a factor of 3 in our examples and significantly increase the network's stable throughput region compared to a simple queue-length driven policy.\",\"PeriodicalId\":414065,\"journal\":{\"name\":\"2011 8th International Symposium on Wireless Communication Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 8th International Symposium on Wireless Communication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2011.6125410\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 8th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2011.6125410","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

我们考虑两跳线路网络,其中通信链路是突发数据包擦除通道,建模为简单的两状态吉尔伯特-艾略特通道。线路中的第一个和第二个节点拥有泊松分布到达的本地信息,并打算将此信息传递给线路中的接收节点。我们考虑了一种在线方法和随机线性网络编码来进行擦除校正。本文对精灵辅助的全双工模型和部分精灵辅助的半双工模型进行了队列理论分析,其中精灵只提供信道状态信息。在我们的示例中,与简单的队列长度驱动策略相比,通道感知策略可以将延迟减少3倍,并显着增加网络的稳定吞吐量区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the delay and energy performance in coded two-hop line networks with bursty erasures
We consider two-hop line networks where the communication links are bursty packet erasure channels modeled as a simple two-state Gilbert-Elliott channel. The first and second node in the line have local information with Poisson-distributed arrivals available and intend to communicate this information to the receiving node in the line. We consider an online approach and random linear network coding for erasure correction. We provide a queueing-theoretic analysis of two different models, a genie aided full duplex model and a partially genie aided half-duplex model, where the genie only provides the channel state information. Channel-aware policies are shown to reduce delay by up to a factor of 3 in our examples and significantly increase the network's stable throughput region compared to a simple queue-length driven policy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信