关键词: 网络编码, 网络效用最大化, 拥塞控制, Lyapunov稳定性

Abstract: This paper formulates a class of Network Utility Maximization(NUM) problem for coded multicasts, which incorporates constraint used to stabilize sender’s packet buffer and intermediate node’s queue. Based on primal and primal-dual form of the problem, it proposes two congestion control models for network coding, whose stability is demonstrated through Lyapunov criteria. The models are entirely distributed feedback control systems. The corresponding algorithms can handle network dynamism with only end-to-end information exchange, and have the form of TCP-like congestion control, showing their compatibility with current network architecture.

Key words: network coding, Network Utility Maximization(NUM), congestion control, Lyapunov stability