A dual-track approach to TCP-friendly reliable multicast

TCP-friendly reliable multicast protocol refers to multicast protocol that can have quick responses to network congestion and allows fair sharing of bandwidth with existing unicast TCP flows. In the window-based congestion control method, adjustment of the sending window and packet recovery are two inter-related issues. When packet loss occurs at any one receiver, the sender's window is reduced by half and it cannot move forward until the given receiver acknowledges the receipt of the repair packet. As a result, the throughput of the mutlicast session can be unacceptably low when the size of the mutlicast group is increased. In this paper we propose a dual-track approach that can significantly improve the overall throughput. The sender maintains two sending tracks, namely the fast track and the slow track. The fast track tries to deliver packets to receivers at a higher pace whenever possible. Packet losses on the fast track are recovered via the slow track. By doing so, packet recovery is decoupled from the rate control so that unnecessary delay in the fast track can be avoided. It has been shown that the dual-track approach is TCP-friendly and can significantly improve the throughput of the mutlicast session.

[1]  J. Crowcroft,et al.  The PGM Reliable Multicast Protocol , 2002 .

[2]  H. Jonathan Chao,et al.  TCP-friendly window congestion control with dynamic grouping for reliable multicast , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[3]  Luigi Rizzo,et al.  pgmcc: a TCP-friendly single-rate multicast , 2000, SIGCOMM.

[4]  Injong Rhee,et al.  MTCP: scalable TCP-like congestion control for reliable multicast , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[6]  David R. Cheriton,et al.  TCP-SMO: extending TCP to support medium-scale multicast applications , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Krishan K. Sabnani,et al.  Fundamental observations on multicast congestion control in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[8]  John W. Byers,et al.  Leveraging single rate schemes in multiple rate multicast congestion control design , 2004, IEEE Journal on Selected Areas in Communications.

[9]  Donald F. Towsley,et al.  The loss path multiplicity problem in multicast congestion control , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[11]  Gang Feng,et al.  The Impact of Loss Recovery on Congestion Control for Reliable Multicast , 2006, IEEE/ACM Transactions on Networking.

[12]  Sebastià Sallent,et al.  RCCMP: a TCP-friendly reliable multicast transport protocol , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[13]  Jennifer C. Hou,et al.  RACCOOM: A Rate-Based Congestion Control Approach for Multicast , 2003, IEEE Trans. Computers.

[14]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[15]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.