Performance evaluation and analysis of datagram congestion control algorithms in IP networks

Providing a TCP-friendly congestion control protocol to support multimedia applications has been a great challenge for many researchers. DCCP (Datagram Congestion Control Protocol) is a promising protocol that was proposed recently. This thesis proposes to use VCP (Variable-structure congestion Control Protocol) to overcome the shortcomings of RED (Random Early Detection). We make mathematical analysis and run OPNET simulation to validate DCCP/VCP congestion control strategy. We have also conducted some performance analysis and made comparison with some other related traffic congestion control strategies under both wired and WiMAX environments. The simulation results show that DCCP/VCP can maintain a shorter buffer queue size than the other congestion control strategies. DCCP/VCP also provides zero packet drop rate which solves the random packet loss problem in RED router.