Abstract: This paper researches the utility maximization problem of network coding scheme-based packet network (ie. coded packet network). Depending on the correspondence between network coding and network flows and multicast tree decomposition method, the coded packet Network Utility Maximization(NUM) model is established. A distributed projection subgradient algorithm for the problem is derived, and sufficient condition that can make the algorithm converge to the globally optimal solutions is found through finding an effective Lipschiz constant. Numerical example is provided to validate the correctness of the algorithm.

Key words: network coding, Network Utility Maximization(NUM), subgradient algorithm

摘要： 对基于网络编码方案的分组网络(即编码分组网络)的效用最大化问题进行研究。利用网络编码和网络流的对应关系以及组播树分解方法提出单通话编码分组网络效用最大化模型。基于对偶分解理论推导出解决单通话编码分组网络效用最大化问题的分布式次梯度投影算法，找到一个有效的Lipschiz常数从而得到算法收敛的充分条件。通过仿真验证了该算法的正确性。

关键词: 网络编码, 网络效用最大化, 次梯度算法

CLC Number: 

• TN925.5