DocumentCode :
2046544
Title :
Short-term fairness and long-term QoS
Author :
Tan, Bo ; Ying, Lei ; Srikant, R.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana - Champaign, Champaign, IL
fYear :
2008
fDate :
19-21 March 2008
Firstpage :
1201
Lastpage :
1204
Abstract :
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.
Keywords :
Internet; Lyapunov matrix equations; quality of service; resource allocation; stochastic processes; Internet; Lyapunov techniques; Poisson process; connection-level models; file transfer delay; long-term QoS; network link capacity; resource allocation; short-term fairness; Algorithm design and analysis; Computer networks; Distributed algorithms; Distributed computing; IP networks; Proportional control; Resource management; Stability; Throughput; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
978-1-4244-2246-3
Electronic_ISBN :
978-1-4244-2247-0
Type :
conf
DOI :
10.1109/CISS.2008.4558701
Filename :
4558701
Link To Document :
بازگشت