TCP/IP illustrated (vol. 2): the implementation
TCP/IP illustrated (vol. 2): the implementation
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
This paper proposes a modified TCP Reno algorithm to provide differentiated services and assured services in the Internet. We introduce two new parameters, slow-start threshold hopping coefficient and minimum congestion window, to TCP Reno algorithm. The algorithm supports both relative service differentiation among best-effort traffic as well as minimum bandwidth guarantee for assured service connections. Theoretical analysis and simulation results prove the convergence and validity of the algorithm.