A TCP-friendly congestion control scheme for multicast with network coding

作者：Li Gaifan; Xu Yinlong^*

来源：Journal of Computational Information Systems, 2013, 9(21): 8541-8548.

DOI：10.12733/jcis7229

• Competing flow
• Congestion window
• Dynamical networks
• Link capacities
• Multicast data
• TCP-friendly
• TCP-friendly congestion control
• Window control

The available link capacities in networks change dynamically and are hard to be predicted, congestion control is needed to make full use of bandwidth while maintaining fairness among competing flows. This paper proposes a TCP-friendly congestion control scheme for network-coding-based multicast flows. Suppose that a network-coding-based multicast is realized with a multipath topology, which is regarded as multiple multicast trees. Different receivers of the same tree receive multicast data at different rates, which ensures that the multicast flow of each path from source to a receiver can be treated as a unicast flow. For each unicast flow, the receiver keeps a congestion window and runs window control modeled after TCP. Our experiments show that our congestion control scheme makes full use of bandwidth, reacts quickly to dynamical networks and achieves higher throughput than traditional multicast and single-rate network coding congestion control schemes. We also examine the fairness of our scheme.

• 出版日期2013
• 单位中国科学技术大学