The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
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
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Incremental deployment of a router-assisted reliable multicast scheme
COMM '00 Proceedings of NGC 2000 on Networked group communication
Dynamic behavior of slowly-responsive congestion control algorithms
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Extending equation-based congestion control to multicast applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On the long-run behavior of equation-based rate control
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Wave and equation based rate control using multicast round trip time
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Rate-Based End-to-End Multicast Congestion Control Protocol
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A Multicast Congestion Control Mechanism for Reliable Multicast
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Robustness to inflated subscription in multicast congestion control
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
FLID-DL: congestion control for layered multicast
IEEE Journal on Selected Areas in Communications
Scalable fair reliable multicast using active services
IEEE Network: The Magazine of Global Internetworking
A survey on TCP-friendly congestion control
IEEE Network: The Magazine of Global Internetworking
TFMCC versus ASMP: lessons learned from performance evaluation
International Journal of Network Management
Hi-index | 0.24 |
Nominee selection plays a key role in nominee-based congestion control, which is essential for multicast services to ensure fairness and congestion avoidance. Without valid design of nominee selection mechanism, the design of congestion control protocols could be inefficient or even flawed. Existing nominee selection schemes choose nominees by comparing the calculated throughput of receivers using the TCP throughput equation with the measured loss rate and round-trip time. Since the calculated throughput varies with different transmission rates, it may not accurately indicate the eligibility of a receiver to be the nominee. This causes the problem that a new nominee is not necessarily 'worse' than the current one and the 'worst' receiver could not be selected accurately. In this paper, we study the nominee selection principles and mechanisms. First, we address the problem in existing schemes by identifying the conditions for the valid use of calculated throughput. Next, we propose a new general nominee selection algorithm (GNSA) as a solution and prove that GNSA converges to the 'worst' receiver and the expected number of iterations is less than (1+ln n), where n is the group size. Finally, we demonstrate through ns-2 simulations the benefits of GNSA in terms of better fairness properties and less iterations to converge than existing nominee selection schemes such as that in TFMCC.