Comparison of different congestion control algorithm (minimum cost flow control and TCP):
Congestion control in packet networks has proven to be a difficult problem, in general. Properties. However, this problem is particularly challenging in the Internet, due to very limited degree of network observability and controllability. In order to accommodate rapid growth and proliferation, the design of the IP protocol and the requirements placed on studied individual subnetworks have been kept at a minimum. Consequently, the main form of congestion control possible in the current Internet is endtoend control of user traffic. In this project, we will implement a class of minimum cost flow control (MCFC) algorithms for adjusting session rates or window sizes. Two algorithm versions will be implemented, a coarse version is geared towards implementation in the current Internet, relying on the endtoend packet loss observations as indication of congestion. A more complete version anticipates an Internet where sessions can solicit explicit congestion information through a concise probing comprehensive mechanism. We show that TCP congestion control, after some modification, may be treated as a special case of the MCFC algorithms, and compare the performance of TCP with this algorithm. We will use opnet as the tool.
Reference: