Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Organizing multicast receivers deterministically by packet-loss correlation
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
IP multicast channels: EXPRESS support for large-scale single-source applications
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
pgmcc: a TCP-friendly single-rate multicast congestion control scheme
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Extending equation-based congestion control to multicast applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
RCP-Friendly Rate Adjustment Protocol for Continuous Media Flows Over Best Effort Networks
RCP-Friendly Rate Adjustment Protocol for Continuous Media Flows Over Best Effort Networks
Modeling TCP Throughpu: A simple model and its empirical validation
Modeling TCP Throughpu: A simple model and its empirical validation
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
A dual-track approach to TCP-friendly reliable multicast
CIIT '07 The Sixth IASTED International Conference on Communications, Internet, and Information Technology
Hi-index | 14.98 |
Abstract--As multicast applications have become widely deployed on the Internet, it is increasingly important to ensure these applications respond to network congestion in a TCP-friendly manner so as to coexist with TCP connections (which constitute the majority of the Internet traffic). In this paper, we present a RAte-based Congestion COntrOl scheme for Multicast, called RACCOOM, for applications that deploy source-based multicast trees as the communication paradigm. In the absence of packet loss, a RACCOOM session keeps track of the congestion status of the on-tree path with the largest round trip time (called the target path) and adjusts its sending rate using a TCP Vegas-like method. Upon detection of packet loss anywhere in the multicast tree, RACCOOM then responds by reducing its sending rate by half in a TCP-Reno manner. The ACK aggregation method used in RACCOOM prevents ACK implosion and yet provides the sender with a simple but comprehensive view of congestion conditions in the multicast tree. Finally, RACCOOM is equipped with mechanisms to deal with changes of the target path due to traffic change and member join/leave. To achieve TCP-friendliness, we have devised a simple method in RACCOOM to emulate how a TCP connection would behave under the same packet loss and delay characteristics. The results thus derived are used by RACCOOM to online adjust the parameters of its rate adjustment method. Alternatively, we can achieve (weighted) fairness (in terms of bandwidth sharing) among competing RACCOOM connections based on results obtained from feedback control theory. We validate the design, and demonstrate the features, of RACCOOM in ns-2. The encouraging simulation results, coupled with the fact that all the RACCOOM operations except acknowledgment aggregation (which requires modest router support) can be performed at end hosts, suggest that RACCOOM is a practical and yet effective congestion control solution for multicast applications.