Short-term fairness and long-term QoS

We consider connection-level models of resource allocation in the Internet, where files arrive into the network according to a Poisson process and the size of each file is exponentially distributed. The link capacities in the network are assumed to be shared among the files in the network using a proportionally-fair resource allocation scheme. In this paper, we are interested in the impact of this resource allocation on the file-transfer delay experienced by the users of the network. Towards this end, we derive a simple upper bound on the expected number of files in the network using Lyapunov techniques.