| 利用network coding的多速率多播最大吞吐量问题研究 |
| |
| 引用本文： | 张牧,张顺颐,刘伟彦.利用network coding的多速率多播最大吞吐量问题研究[J].电路与系统学报,2007,12(3):78-83. |
| |
| 作者姓名： | 张牧 张顺颐 刘伟彦 |
| |
| 作者单位： | 南京邮电大学,江苏省通信与网络技术工程研究中心,江苏,南京,210003 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，江苏省高技术研究发展计划项目 |
| |
| 摘 要： | 本文研究了利用network coding的多速率多播最大吞吐量问题.与以往研究重点集中在单速率多播中的network coding研究工作不同,本文考虑了链路的异构性问题并采用多速率多播来解决该问题.首先文中形式化地描述了多速率多播最大可得吞吐量问题,并证明了在分层独立和层速率固定条件下,利用network coding的多速率多播最大吞吐量问题是NP-hard类问题,同时给出了最大吞吐量的上界.此外本文同时也研究了分层相关和层速率可变情况下的最大吞吐量问题.
|
| 关 键 词： | 多播 吞吐量 |
| 文章编号： | 1007-0249（2007）03-0078-06 |
| 修稿时间： | 2006-06-192006-09-13 |
On the optimal multi-rate throughput for multicast with network coding |
| |
| ZHANG Mu,ZHANG Shun-yi,LIU Wei-yan.On the optimal multi-rate throughput for multicast with network coding[J].Journal of Circuits and Systems,2007,12(3):78-83. |
| |
| Authors: | ZHANG Mu ZHANG Shun-yi LIU Wei-yan |
| |
| Abstract: | The maximal achievable multi-rate throughput problem of a multicast session at the presence of network coding is investigated in this paper.Deviating from previous works which focus on single-rate network coding,our work takes the heterogeneity of sinks into account and provides multiple data layers to address the problem.Firstly formulated is the maximal achievable throughput problem with the assumption that the data layers are independent and layer rates are static.It is proved that the problem in this case is,unfortunately,Non-deterministic Polynomial-time(NP)-hard.In addition,the formulation is extended to the problems with dependent layers and dynamic layers. |
| |
| Keywords: | Network coding |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
