广播擦除信道的延迟约束容量:基于线性编码的研究

Chih-Chun Wang
{"title":"广播擦除信道的延迟约束容量:基于线性编码的研究","authors":"Chih-Chun Wang","doi":"10.1109/ISIT.2016.7541830","DOIUrl":null,"url":null,"abstract":"Supporting delay-sensitive traffic is critical to the next-generation communication network. This work studies the 1-to-2 broadcast packet erasure channels with causal ACKnowledgement (ACK), which is motivated by practical downlink access point networks. While the corresponding delay-constrained Shannon capacity remains an open problem (no existing analysis tools can be directly applied), this work focuses on linear codes and proposes three new definitions of delay-constrained throughput based on different outage metrics: the file-based, the rank-based, and the packet-based ones. It then fully characterizes the corresponding linear coding capacity regions for relatively-short-delay flows - flows for which the delay requirement is no larger than the interval of file arrivals.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Delay-constrained capacity for broadcast erasure channels: A linear-coding-based study\",\"authors\":\"Chih-Chun Wang\",\"doi\":\"10.1109/ISIT.2016.7541830\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Supporting delay-sensitive traffic is critical to the next-generation communication network. This work studies the 1-to-2 broadcast packet erasure channels with causal ACKnowledgement (ACK), which is motivated by practical downlink access point networks. While the corresponding delay-constrained Shannon capacity remains an open problem (no existing analysis tools can be directly applied), this work focuses on linear codes and proposes three new definitions of delay-constrained throughput based on different outage metrics: the file-based, the rank-based, and the packet-based ones. It then fully characterizes the corresponding linear coding capacity regions for relatively-short-delay flows - flows for which the delay requirement is no larger than the interval of file arrivals.\",\"PeriodicalId\":198767,\"journal\":{\"name\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2016.7541830\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

支持对延迟敏感的业务是下一代通信网络的关键。本文研究了具有因果确认(ACK)的1对2广播包擦除信道,该信道是由实际下行接入点网络驱动的。虽然相应的延迟约束香农容量仍然是一个开放的问题(没有现有的分析工具可以直接应用),但这项工作侧重于线性代码,并提出了基于不同中断度量的延迟约束吞吐量的三种新定义:基于文件的,基于秩的和基于包的。然后,它充分表征了相对较短延迟流的相应线性编码容量区域-延迟要求不大于文件到达间隔的流。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Delay-constrained capacity for broadcast erasure channels: A linear-coding-based study
Supporting delay-sensitive traffic is critical to the next-generation communication network. This work studies the 1-to-2 broadcast packet erasure channels with causal ACKnowledgement (ACK), which is motivated by practical downlink access point networks. While the corresponding delay-constrained Shannon capacity remains an open problem (no existing analysis tools can be directly applied), this work focuses on linear codes and proposes three new definitions of delay-constrained throughput based on different outage metrics: the file-based, the rank-based, and the packet-based ones. It then fully characterizes the corresponding linear coding capacity regions for relatively-short-delay flows - flows for which the delay requirement is no larger than the interval of file arrivals.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信