| 传输合同约束下编码分组网络的效用最大化研究 |
| |
| 引用本文： | 王俊义,吴伟陵.传输合同约束下编码分组网络的效用最大化研究[J].计算机应用,2010,30(8):2224-2227. |
| |
| 作者姓名： | 王俊义 吴伟陵 |
| |
| 作者单位： | 1. 桂林电子科技大学2. |
| |
| 基金项目： | 国家自然科学基金资助项目，湖南省教育厅科研项目，桂林电子科技大学基金资助项目 |
| |
| 摘 要： | 研究在传输合同约束条件下当编码子图给定时编码分组网络的效用最大化问题。基于提出的网络效用最大化模型，通过对偶分解理论，提出了分布式的次梯度投影算法，证明了算法收敛的充分条件，最后通过仿真验证了算法的正确性。
|
| 关 键 词： | 网络编码 对偶分解 网络效用最大化 次梯度算法 编码子图 |
| 收稿时间： | 2009-10-09 |
| 修稿时间： | 2009-12-03 |
Network utility maximization of coded packet network under delivery contracts constraint |
| |
| WANG Jun-yi,WU Wei-ling.Network utility maximization of coded packet network under delivery contracts constraint[J].journal of Computer Applications,2010,30(8):2224-2227. |
| |
| Authors: | WANG Jun-yi WU Wei-ling |
| |
| Abstract: | The paper studied the problem of network utility maximization of coded packet network under delivery contracts constraint when coding subgraph was given. Based on the network utility maximization model proposed, a distributed projection subgradient algorithm for this problem based on dual decomposition theory was developed, and the sufficient condition that can make the algorithm converge to the globally optimal solutions was proved. In the end, numerical example verifier the correctness of the algorithm. |
| |
| Keywords: | network coding dual decomposition network utility maximum subgradient algorithm coding subgraph |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
