Abstract
TCP Reno can be regarded as a distributed algorithm over the Internet to maximize aggregate utility subject to capacity. The equilibrium reached by the interaction of many competing TCPs, each implemented only on the source and destination computers, is effectively maximizing an objective function for the entire network. In this paper, a new utility function is derived for TCP Reno under the precise end-to-end drop probability. The results show theoretically that the TCP Reno model proposed by Kelly [1] is reasonable. And simulation results are provided.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
