Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
IEEE/ACM Transactions on Networking (TON)
pgmcc: a TCP-friendly single-rate multicast congestion control scheme
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
FLID-DL: congestion control for layered multicast
COMM '00 Proceedings of NGC 2000 on Networked group communication
Understanding TCP vegas: a duality model
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
LE-SBCC: Loss-Event Oriented Source-Based Multicast Congestion Control
Multimedia Tools and Applications
STAIR: Practical AIMD Multirate Multicast Congestion Control
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Accumulation-based congestion control
IEEE/ACM Transactions on Networking (TON)
GSC: a generic source-based congestion control algorithm for reliable multicast
Computer Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Multicast for multimedia collaborative applications: services and mechanisms
International Journal of Advanced Media and Communication
Configurable active multicast congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.24 |
In this paper, we propose MCA, an end-to-end multicast congestion avoidance scheme with feedback suppression. Congestion avoidance [J. Comput. Netw. ISDN 17 (1989) 1] is different from congestion control in the sense that our scheme detects and responds to network congestion without necessarily inducing packet loss. Our scheme is a single-rate scheme and operates end-to-end, i.e. the sending rate is controlled by the source based on feedback from the most congested receiver and does not expect packet marking or other support from intermediate nodes. We design it to be robust under both lossless and lossy situations. Congestion is detected at receivers using the concept of accumulation (the number of buffered bits of a flow inside the network) and simple thresholding techniques proposed in our recent unicast work [Accumulation-based congestion control (submitted)]. For the purposes of choosing representative (the most congested receiver) by the source and suppressing feedback by receivers, each receiver maintains its Good Throughput Rate At Congestion (G-TRAC) (the product of receiving rate during congestion epochs and 1-f, where f is congestion occurrence frequency).In this way, receivers do not need to continuously (either densely or sparsely) exchange packets with the sender (e.g. to measure RTT). Therefore, MCA is scalable for large-size groups. We evaluate the design and demonstrate the performance of MCA using detailed ns-2 simulations.