期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于网络编码的分层媒体多播中的层速率分配优化 被引量：4

Optimal Layer Rate Allocation in Layered Media Multicast Based on Network Coding
在线阅读 下载PDF
导出
摘要 该文研究了基于网络编码的分层媒体多播中的层速率优化分配问题。通过优化分配层速率,最大化所有接收节点的接收速率总和。由于该问题是一个非线性整数规划的问题,该文提出了一个时间复杂度为O(|V||T|2|E|2)的启发式的层速率分配算法MRAA。算法MRAA根据各接收节点的接收带宽将网络图按分层层数优化分解成子图,每个子图中各接收节点的最大流的最小值即是相应的层速率。模拟实验表明,算法MRAA相比已有算法对网络吞吐量提高15%-18%,对各接收节点的平均带宽利用率改善6%-10%。 This paper focuses on layer rate allocation in network coding based layered media multicast.The sum of receiving rates of all receivers is maximized by optimizing layer rate allocation.Since it is a nonlinear integer programming,a heuristic algorithm,MRAA（M-layer Rate Allocation Algorithm）,is proposed with the time complexity O（｜ V ｜｜ T ｜2 ｜ E ｜2 ） to solve it.Algorithm MRAA decomposes the network graph into several subgraphs,and the minimum of the maximum flows of all receivers in each subgraph is the corresponding layer rate.Numerical results indicate that the algorithm MRAA can increase the network throughput by 15%-18% and improve the average bandwidth utilization rate of the receivers by 6%-10%,compared with the algorithm in the existing work.
作者 林晓斌 许胤龙 詹成 王青山
机构地区 中国科学技术大学计算机科学与技术学院 安徽省高性能计算重点实验室 合肥工业大学理学院
出处 《电子与信息学报》 EI CSCD 北大核心 2010年第10期2421-2428,共8页 Journal of Electronics & Information Technology
基金 国家自然科学基金(60773036)资助课题
关键词 网络编码 网络异构性 分层媒体多播 层速率分配 非线性整数规划 Network coding Network heterogeneity Layered media multicast Layer rate allocation Nonlinear integer programming
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献16

  • 1McCanne S,Jacobson V,and Vetterli M.Receiver-driven layered multicast.Proc.of ACM SIGCOMM 1996,Stanford,CA,USA,Aug.1996:117-130.
  • 2Ahlswede R,Cai N,and Li S R,et al..Network information flow.IEEE Transactions on Information Theory,2000,46(4):1204-1216.
  • 3Koetter R and Medard M.An algebraic approach to network coding.IEEE/ACM Transactions on Networking,2000,11(5):782-795.
  • 4Li S R,Yueng R W,and Cai N.Linear network coding.IEEE Transactions on Information Theory,2003,49(2):371-381.
  • 5Sanders P,Egner S,and Tolhuizen L.Polynomial time algorithms for network information flow.Proc.of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures(SPAA),San Diego,CA,USA,June 2003:286-294.
  • 6Sundaram N,Ramanathan P,and Banerjee S.Multirate media stream using network coding.Proc.of the 43rd Allerton Conference on Communication,Control,and Computing,Monticello,IL,USA,Sep.2005.
  • 7Wu X,Ma B,and Sarshar N.Rainbow network problems and multiple description coding.IEEE Transactions on Information Theory,2008,54(10):4565-4574.
  • 8Shao M,Wu X,and Sarshar N.Rainbow network flow with network coding.Proc.of NetCod 2008,Hong Kong,China,Jan.2008:1-6.
  • 9Shao M,Dumitrescu S,and Wu X.Toward the optimal multirate multicast for lossy packet network.Proc.of ACM Multimedia 08,Vancouver,BC,Canada,Oct.2008:765-768.
  • 10Zhao J,Yang F,and Zhang Q,et al..LION:Layered overlay multicast with network coding.IEEE Transactions on Multimedia,2006,8(5):1021-1032.

二级参考文献9

  • 1Menger K. Zur allgemeiner Kurventheories. Fund. Math., 1927, 10: 96-115.
  • 2Edmonds J. Edge-Disjoint Brachings, in Combinatorial Algorithms. Rustin REd. New York: Academic Press, 1973: 91-96.
  • 3Jain K, Mahdian M, and Salavatipour M. Packing Steiner trees, in the 14th ACM-SIAM Symposium on Discrete Algorithms 2003, Baltimore, MD, Jan 2003: 448-453.
  • 4Ahlswede R, Cai N, Li S R, and Yeung R. Network information flow. IEEE Trans. on Information Theory, 2000, 46(4): 1204-1216.
  • 5Koetter R and Medard M. An algebraic approach to network coding. IEEE/ACM Trans. on Networking, 2003, 11(5): 782-795.
  • 6Li S, Yeung R and Cai N. Linear network coding. IEEE Trans.on Information Theory, 2003, 49(2): 371-381.
  • 7Sanders P, Egner S, and Tolhuizen L. Polynomial time algorithms for network information flow. in Proc. of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, June 2003: 286-294.
  • 8McCanne S, Jacobson V, and Vetterli M. Receiver-driven layered multicast, in Proc. of ACM SIGOMM 1996, Stanford, CA, August 1996: 117-130.
  • 9Ford L R and Fulkerson D R. Maximal flow through a network. Canadian Journal of Mathematics, 1956, 8(3): 399-404.

共引文献5

同被引文献23

引证文献4

二级引证文献3

电子与信息学报
2010年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部