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

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

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