Congestion Control Algorithm for Tree-based Reliable Multicast Protocols

Abstract:
This project contains a detailed description of the congestion control algorithm of tree-based reliable multicast protocol. This algorithm takes advantage of regular acknowledgements from the receivers that propagate back to the sender via the repair tree. This scalable feedback mechanism is used to collect receiver credits. Complementing the windowing mechanism, packet transmission is smoothed by using a data rate commensurate with the window size. Additional details, such as how to prune slow receivers, and how to implement the rate scheduler on non-real-time systems are also discussed. The performance of the congestion control algorithm is then evaluated in extended LANs, and wide area networks. The fairness of bandwidth sharing with other (TCP) traffic is also evaluated.

 Scalability
The protocol should be able to work under a variety of conditions

 include multiple network topologies
 variable page link speeds
 receiver set size can be to the order of at least 1000 - 10000
It is more important to have a good understanding of how and when a protocol breaks than when it works.



System Configuration
H/W System Configuration
Processor - Pentium “III

Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk - 20 GB
Floppy Drive - 1.44 MB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA

Software Requirements :-
Language : Java RMI, SWING
O/S : WIN2000 Server , TCP/IP