A coded-feedback construction of locally minimum-cost multicast network codes

Chih-Chun Wang
{"title":"A coded-feedback construction of locally minimum-cost multicast network codes","authors":"Chih-Chun Wang","doi":"10.1109/ALLERTON.2008.4797548","DOIUrl":null,"url":null,"abstract":"There are two common network models for network coded traffic: one is the fractional rate model (the primary model for non-coded communication) and the other is the integer rate model used for detailed coding analysis on packet-by-packet behaviors. The existing approach of finding minimum-cost multicast network codes is based on the fractional rate model and solves the corresponding linear-programming (LP) problem. The LP-based network optimization generally converges slowly due to the small step size and does not take care of the packet-by-packet coding behavior of network coding. This paper develops a minimum-cost multicast scheme based on the integer rate model. The new scheme exploits a new concept of coded feedback, takes full advantages of the forward network-coded traffic, and possesses many practical advantages for efficient implementation. The complexity and performance of the coded-feedback scheme are studied both analytically and through simulations.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797548","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

There are two common network models for network coded traffic: one is the fractional rate model (the primary model for non-coded communication) and the other is the integer rate model used for detailed coding analysis on packet-by-packet behaviors. The existing approach of finding minimum-cost multicast network codes is based on the fractional rate model and solves the corresponding linear-programming (LP) problem. The LP-based network optimization generally converges slowly due to the small step size and does not take care of the packet-by-packet coding behavior of network coding. This paper develops a minimum-cost multicast scheme based on the integer rate model. The new scheme exploits a new concept of coded feedback, takes full advantages of the forward network-coded traffic, and possesses many practical advantages for efficient implementation. The complexity and performance of the coded-feedback scheme are studied both analytically and through simulations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
局部最小代价组播网络码的编码反馈构造
网络编码流量有两种常用的网络模型:一种是分数速率模型(非编码通信的主要模型),另一种是整数速率模型,用于对逐包行为进行详细的编码分析。现有的寻找最小代价组播网络代码的方法是基于分数率模型,解决相应的线性规划问题。基于lp的网络优化由于步长较小,收敛速度较慢,并且不考虑网络编码的逐包编码行为。提出了一种基于整数速率模型的最小代价组播方案。该方案利用了编码反馈的新概念,充分利用了前向网络编码流量的优势,具有许多实用的优点,便于高效实现。通过分析和仿真研究了编码反馈方案的复杂度和性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Learning sparse doubly-selective channels Ergodic two-user interference channels: Is separability optimal? Weight distribution of codes on hypergraphs Compound multiple access channels with conferencing decoders Transmission techniques for relay-interference networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1