单源非均匀需求网络中可实现的信息率

C. Chekuri, C. Fragouli, E. Soljanin
{"title":"单源非均匀需求网络中可实现的信息率","authors":"C. Chekuri, C. Fragouli, E. Soljanin","doi":"10.1109/ISIT.2006.261718","DOIUrl":null,"url":null,"abstract":"A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where each receiver would like to receive information from the source at a rate that is equal to its min-cut value. This problem has been formulated before, and in contrast to the uniform case, it has been shown that the non-uniform case does not admit a good characterization. Motivated by this, we formulate relaxations of the problem and present some preliminary results","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On Achievable Information Rates in Single-Source Non-Uniform Demand Networks\",\"authors\":\"C. Chekuri, C. Fragouli, E. Soljanin\",\"doi\":\"10.1109/ISIT.2006.261718\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where each receiver would like to receive information from the source at a rate that is equal to its min-cut value. This problem has been formulated before, and in contrast to the uniform case, it has been shown that the non-uniform case does not admit a good characterization. Motivated by this, we formulate relaxations of the problem and present some preliminary results\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261718\",\"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 International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261718","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

非均匀需求网络由一个源和一组与源具有不同最小割值的接收器组成。我们研究这样一种情况,即每个接收器都希望以等于其最小截值的速率从源接收信息。这个问题以前已经公式化了,与均匀情况相比,已经证明非均匀情况不能很好地表征。在此基础上,我们提出了该问题的松弛式,并给出了一些初步的结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Achievable Information Rates in Single-Source Non-Uniform Demand Networks
A non-uniform demand network consists of a source and a set of receivers that have different min-cut values from the source. We look at the case where each receiver would like to receive information from the source at a rate that is equal to its min-cut value. This problem has been formulated before, and in contrast to the uniform case, it has been shown that the non-uniform case does not admit a good characterization. Motivated by this, we formulate relaxations of the problem and present some preliminary results
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信