Short-term fairness and long-term QoS

Bo Tan; R. Srikant

doi:10.1109/CISS.2008.4558701

Short-term fairness and long-term QoS

Bo Tan, R. Srikant

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

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 filetransfer 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.

Original language	English (US)
Title of host publication	CISS 2008, The 42nd Annual Conference on Information Sciences and Systems
Pages	1201-1204
Number of pages	4
DOIs	https://doi.org/10.1109/CISS.2008.4558701
State	Published - 2008
Externally published	Yes
Event	CISS 2008, 42nd Annual Conference on Information Sciences and Systems - Princeton, NJ, United States Duration: Mar 19 2008 → Mar 21 2008

Publication series

Name	CISS 2008, The 42nd Annual Conference on Information Sciences and Systems

Other

Other	CISS 2008, 42nd Annual Conference on Information Sciences and Systems
Country/Territory	United States
City	Princeton, NJ
Period	3/19/08 → 3/21/08

ASJC Scopus subject areas

Computer Science Applications
Information Systems
Control and Systems Engineering

Access to Document

10.1109/CISS.2008.4558701

Cite this

Tan, B & Srikant, R 2008, Short-term fairness and long-term QoS. in CISS 2008, The 42nd Annual Conference on Information Sciences and Systems., 4558701, CISS 2008, The 42nd Annual Conference on Information Sciences and Systems, pp. 1201-1204, CISS 2008, 42nd Annual Conference on Information Sciences and Systems, Princeton, NJ, United States, 3/19/08. https://doi.org/10.1109/CISS.2008.4558701

@inproceedings{080c3371178e4b968fea8009e1bfc2b3,

title = "Short-term fairness and long-term QoS",

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 filetransfer 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.",

author = "Bo Tan and R. Srikant",

year = "2008",

doi = "10.1109/CISS.2008.4558701",

language = "English (US)",

isbn = "9781424422470",

series = "CISS 2008, The 42nd Annual Conference on Information Sciences and Systems",

pages = "1201--1204",

booktitle = "CISS 2008, The 42nd Annual Conference on Information Sciences and Systems",

note = "CISS 2008, 42nd Annual Conference on Information Sciences and Systems ; Conference date: 19-03-2008 Through 21-03-2008",

}

TY - GEN

T1 - Short-term fairness and long-term QoS

AU - Tan, Bo

AU - Srikant, R.

PY - 2008

Y1 - 2008

N2 - 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 filetransfer 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.

AB - 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 filetransfer 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.

UR - http://www.scopus.com/inward/record.url?scp=51849145836&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51849145836&partnerID=8YFLogxK

U2 - 10.1109/CISS.2008.4558701

DO - 10.1109/CISS.2008.4558701

M3 - Conference contribution

SN - 9781424422470

T3 - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems

SP - 1201

EP - 1204

BT - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems

T2 - CISS 2008, 42nd Annual Conference on Information Sciences and Systems

Y2 - 19 March 2008 through 21 March 2008

ER -

Short-term fairness and long-term QoS

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this