Charge-Sensitive TCP and Rate Control . Richard J. La Department of EECS UC Berkeley November 22, 1999. Motivation. Network users have a great deal of freedom as to how they can share the available bandwidth in the network
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Richard J. La
Department of EECS
November 22, 1999
1) solves for all
4) is the unique solution to
Further, the resulting rate at the unique stable point w*is weighted proportionally fair that solves NETWOKR(A, C ; p).
where is connection i’s queue size at resource j
where is the price per unit flow, which is the queuing delay
is a decreasing function of .
(a) for all p such that
(b) for allpsuch that