计算机应用 ›› 2010, Vol. 30 ›› Issue (8): 2224-2227.

• 网络与通信 • 上一篇    下一篇

传输合同约束下编码分组网络的效用最大化研究

王俊义1,吴伟陵2   

  1. 1. 桂林电子科技大学
    2.
  • 收稿日期:2009-10-09 修回日期:2009-12-03 发布日期:2010-07-30 出版日期:2010-08-01
  • 通讯作者: 王俊义
  • 基金资助:
    编码网络的效用最大化研究;微弱信号检测及数据去噪研究

Network utility maximization of coded packet network under delivery contracts constraint

  • Received:2009-10-09 Revised:2009-12-03 Online:2010-07-30 Published:2010-08-01
  • Supported by:
    Study of Network Utility Maximization of Coded Packet Network; Study of Weak Signal Detection and Data Denoising

摘要: 研究在传输合同约束条件下当编码子图给定时编码分组网络的效用最大化问题。基于提出的网络效用最大化模型,通过对偶分解理论,提出了分布式的次梯度投影算法,证明了算法收敛的充分条件,最后通过仿真验证了算法的正确性。

关键词: 网络编码, 对偶分解, 网络效用最大化, 次梯度算法, 编码子图

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.

Key words: network coding, dual decomposition, network utility maximum, subgradient algorithm, coding subgraph