This study proposes a new window-based congestion control algorithm for TCP networks. This algorithm is named as TCP-Log. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The proposed algorithm generalizes the AIMD algorithms used for the TCP connections. These algorithms provide additive increase using logarithmic inverse of the current window size and provide multiplicative decrease using logarithmic inverse of the current window size. TCP compatibility of the algorithm is evaluated using the simulation of the proposed model. Simulations are done by ns2, a discrete event simulator. The simulations explore the benefits of using TCP-Log in transport layer. The results are compared with TCP/Tahoe,TCP/Reno TCP/Newreno, TCP/Sack, TCP/Fack. The comparisons show that the proposed algorithm performs better in terms of throughput and bandwidth utilization.
展开▼
