摘要: 描述一类多编码组播情形下的网络效用最大化问题,引入用于稳定发送节点窗口和中间节点队列的约束。基于问题的原始及原 始-对偶形式,分别提出2种网络编码拥塞控制模型,并通过Lyapunov判据证明了模型的全局渐近稳定性。该模型是完全分布式的反馈控制系统,所描述的算法只要求端到端的信息交换,能应对网络的动态变化,且具有类TCP拥塞控制的形式,从而显示其与现行网络架构的兼容性。
关键词:
网络编码,
网络效用最大化,
拥塞控制,
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
中图分类号:
吴智昊. 基于效用优化的网络编码拥塞控制模型[J]. 计算机工程, 2011, 37(6): 100-103.
TUN Zhi-Hao. Congestion Control Model for Network Coding Based on Utility Optimization[J]. Computer Engineering, 2011, 37(6): 100-103.