Home > Research > Publications & Outputs > Optimal anticipative congestion control of flow...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Optimal anticipative congestion control of flows with time-varying input stream

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Optimal anticipative congestion control of flows with time-varying input stream. / Jacko, Peter; Sansò, Brunilde.
In: Performance Evaluation, Vol. 69, No. 2, 01.02.2012, p. 86-101.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Jacko, P & Sansò, B 2012, 'Optimal anticipative congestion control of flows with time-varying input stream', Performance Evaluation, vol. 69, no. 2, pp. 86-101. https://doi.org/10.1016/j.peva.2011.10.001

APA

Jacko, P., & Sansò, B. (2012). Optimal anticipative congestion control of flows with time-varying input stream. Performance Evaluation, 69(2), 86-101. https://doi.org/10.1016/j.peva.2011.10.001

Vancouver

Jacko P, Sansò B. Optimal anticipative congestion control of flows with time-varying input stream. Performance Evaluation. 2012 Feb 1;69(2):86-101. doi: 10.1016/j.peva.2011.10.001

Author

Jacko, Peter ; Sansò, Brunilde. / Optimal anticipative congestion control of flows with time-varying input stream. In: Performance Evaluation. 2012 ; Vol. 69, No. 2. pp. 86-101.

Bibtex

@article{3f4e22f721c543c8b34bc5e3886760f5,
title = "Optimal anticipative congestion control of flows with time-varying input stream",
abstract = "This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes. Motivated by the Internet flows behaving according to the Transmission Control Protocol, we consider a flow with time-varying input stream. We design a Markov decision process model for flow admission control and characterize the Whittle index in a closed form. This index measures the efficiency of flow data transmission at a router. We prove that such an index policy is optimal and that it further implies optimality of threshold policies. We apply the results to obtain an expression of the index for a single-bottleneck flow under several types of fairness criteria.",
keywords = "Markov decision process, Threshold policy, Restless bandits, Whittle index, Congestion control, Active queue management, Fairness, Transmission Control Protocol (TCP), Explicit Congestion Notification (ECN)",
author = "Peter Jacko and Brunilde Sans{\`o}",
year = "2012",
month = feb,
day = "1",
doi = "10.1016/j.peva.2011.10.001",
language = "English",
volume = "69",
pages = "86--101",
journal = "Performance Evaluation",
issn = "0166-5316",
publisher = "Elsevier",
number = "2",

}

RIS

TY - JOUR

T1 - Optimal anticipative congestion control of flows with time-varying input stream

AU - Jacko, Peter

AU - Sansò, Brunilde

PY - 2012/2/1

Y1 - 2012/2/1

N2 - This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes. Motivated by the Internet flows behaving according to the Transmission Control Protocol, we consider a flow with time-varying input stream. We design a Markov decision process model for flow admission control and characterize the Whittle index in a closed form. This index measures the efficiency of flow data transmission at a router. We prove that such an index policy is optimal and that it further implies optimality of threshold policies. We apply the results to obtain an expression of the index for a single-bottleneck flow under several types of fairness criteria.

AB - This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes. Motivated by the Internet flows behaving according to the Transmission Control Protocol, we consider a flow with time-varying input stream. We design a Markov decision process model for flow admission control and characterize the Whittle index in a closed form. This index measures the efficiency of flow data transmission at a router. We prove that such an index policy is optimal and that it further implies optimality of threshold policies. We apply the results to obtain an expression of the index for a single-bottleneck flow under several types of fairness criteria.

KW - Markov decision process

KW - Threshold policy

KW - Restless bandits

KW - Whittle index

KW - Congestion control

KW - Active queue management

KW - Fairness

KW - Transmission Control Protocol (TCP)

KW - Explicit Congestion Notification (ECN)

U2 - 10.1016/j.peva.2011.10.001

DO - 10.1016/j.peva.2011.10.001

M3 - Journal article

VL - 69

SP - 86

EP - 101

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

IS - 2

ER -