The Community for Technology Leaders
Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256) (1998)
Austin, Texas
Oct. 13, 1998 to Oct. 16, 1998
ISBN: 0-8186-8988-9
pp: 0168
This paper evaluates the congestion control performance of Pseudofed, a congestion-controlled, reliable multicast transport protocol for bulk data transfer. Pseudofed's congestion control mechanism is based on the concept of representatives, a small, dynamic set of multicast group members. By reducing the congestion control problem to a bounded set of receivers, representatives allow the point-to-point congestion control model used by unicast protocols like TCP to scale to larger multicast groups. Other features that contribute to the scalability of Pseudofed's congestion control algorithm are: (1) attempting to distinguish between correlated and uncorrelated packet losses, (2) not requiring complete knowledge of the multicast group, and (3) not exchanging control communication with congestion-free subtrees.As the Internet evolves, it is difficult to predict what the ``real'' internet of the future will look like. Simulations allowed us to demonstrate that Pseudofed's congestion control algorithm can operate in a wide range of network conditions, including highly congested links with mismatching bandwidth capacities. As proof of concept, we also ran MBone experiments with Pseudofed. These preliminary MBone experiments demonstrate Pseudofed's ability to operate in a diverse, uncontrolled network environment.

K. Obraczka and D. DeLucia, "Congestion Control Performance of a Reliable Multicast Protocol," Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256)(ICNP), Austin, Texas, 1998, pp. 0168.
89 ms
(Ver 3.3 (11022016))