pgmcc
- 28 August 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (4) , 17-28
- https://doi.org/10.1145/347059.347390
Abstract
We present a single rate multicast congestion control scheme(pgmcc) which is TCP-friendly and achieves scalability, stability and fast response to variations in network conditions. pgmcc is suitable for both non-reliable and reliable data transfers; it uses a window-based TCP-like controller based on positive ACKs and run between the sender and a group's representative, the acker. The innovative part of pgmcc is a fast and low-overhead procedure to select (and track changes of) the acker, which permits us to consider the acker as a moving receiver rather than a changing one. As such, the scheme is robust to measurement errors, and supports fast response to changes in the receiver set and/or network conditions. The scheme has been implemented in the PGM protocol, and the paper presents a number of experimental results on its performance.Keywords
This publication has 11 references indexed in Scilit:
- Scalable fair reliable multicast using active servicesIEEE Network, 2000
- Scalable feedback for large groupsIEEE/ACM Transactions on Networking, 1999
- Modeling TCP throughputPublished by Association for Computing Machinery (ACM) ,1998
- A digital fountain approach to reliable distribution of bulk dataPublished by Association for Computing Machinery (ACM) ,1998
- Parity-based loss recovery for reliable multicast transmissionIEEE/ACM Transactions on Networking, 1998
- RMDPACM SIGMOBILE Mobile Computing and Communications Review, 1998
- The macroscopic behavior of the TCP congestion avoidance algorithmACM SIGCOMM Computer Communication Review, 1997
- Effective erasure codes for reliable computer communication protocolsACM SIGCOMM Computer Communication Review, 1997
- DummynetACM SIGCOMM Computer Communication Review, 1997
- Receiver-driven layered multicastPublished by Association for Computing Machinery (ACM) ,1996