How expensive is link utilization?

Rade Stanojevic, Robert Shorten

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in understanding this relationship stem from the fact that it depends on the complex nature of arriving traffic and the problems associated with modelling such traffic. Existing AQM schemes achieve a "low delay" and "high utilization" by responding early to congestion without considering the exact relationship between delay and utilization. However, in the context of exploiting the delay/utilization tradeoff, the optimal choice of a queueing scheme's control parameter depends on the cost associated with the relative importance of queueing delay and utilization. The optimal choice of control parameter is the one that maximizes a benefit that can be defined as the difference between utilization and cost associated with queuing delay. We present a generic algorithm Optimal Delay-Utilization control of t (ODU-t) that is designed with a performance goal of maximizing this benefit. Its novelty lies in fact that it maximizes the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor does it require complex parameter estimation. Moreover, other performance metrics like loss rate or jitter can be directly incorporated into the optimization framework as well. Packet level ns2 simulations are given to demonstrate the behavior of the proposed algorithm.

Original languageEnglish
Title of host publicationNetwork Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings
Pages54-64
Number of pages11
Volume4465 LNCS
Publication statusPublished - 2007
Externally publishedYes
Event1st Euro-NGI / FGI Conference on Network Control and Optimization, NET-COOP 2007 - Avignon, France
Duration: 5 Jun 20077 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4465 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st Euro-NGI / FGI Conference on Network Control and Optimization, NET-COOP 2007
CountryFrance
CityAvignon
Period5/6/077/6/07

Fingerprint

Queueing
Jitter
Parameter estimation
Costs
Traffic
Control Parameter
Maximise
Traffic Modeling
Queuing
Performance Metrics
Optimal Algorithm
Networking
Congestion
Parameter Estimation
Open Problems
Trade-offs
Optimization
Demonstrate
Relationships
Simulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Stanojevic, R., & Shorten, R. (2007). How expensive is link utilization? In Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings (Vol. 4465 LNCS, pp. 54-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4465 LNCS).

How expensive is link utilization? / Stanojevic, Rade; Shorten, Robert.

Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. Vol. 4465 LNCS 2007. p. 54-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4465 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stanojevic, R & Shorten, R 2007, How expensive is link utilization? in Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. vol. 4465 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4465 LNCS, pp. 54-64, 1st Euro-NGI / FGI Conference on Network Control and Optimization, NET-COOP 2007, Avignon, France, 5/6/07.
Stanojevic R, Shorten R. How expensive is link utilization? In Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. Vol. 4465 LNCS. 2007. p. 54-64. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Stanojevic, Rade ; Shorten, Robert. / How expensive is link utilization?. Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings. Vol. 4465 LNCS 2007. pp. 54-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{438648e0ec924b3684c42078755948c5,
title = "How expensive is link utilization?",
abstract = "Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in understanding this relationship stem from the fact that it depends on the complex nature of arriving traffic and the problems associated with modelling such traffic. Existing AQM schemes achieve a {"}low delay{"} and {"}high utilization{"} by responding early to congestion without considering the exact relationship between delay and utilization. However, in the context of exploiting the delay/utilization tradeoff, the optimal choice of a queueing scheme's control parameter depends on the cost associated with the relative importance of queueing delay and utilization. The optimal choice of control parameter is the one that maximizes a benefit that can be defined as the difference between utilization and cost associated with queuing delay. We present a generic algorithm Optimal Delay-Utilization control of t (ODU-t) that is designed with a performance goal of maximizing this benefit. Its novelty lies in fact that it maximizes the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor does it require complex parameter estimation. Moreover, other performance metrics like loss rate or jitter can be directly incorporated into the optimization framework as well. Packet level ns2 simulations are given to demonstrate the behavior of the proposed algorithm.",
author = "Rade Stanojevic and Robert Shorten",
year = "2007",
language = "English",
isbn = "3540727086",
volume = "4465 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "54--64",
booktitle = "Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings",

}

TY - GEN

T1 - How expensive is link utilization?

AU - Stanojevic, Rade

AU - Shorten, Robert

PY - 2007

Y1 - 2007

N2 - Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in understanding this relationship stem from the fact that it depends on the complex nature of arriving traffic and the problems associated with modelling such traffic. Existing AQM schemes achieve a "low delay" and "high utilization" by responding early to congestion without considering the exact relationship between delay and utilization. However, in the context of exploiting the delay/utilization tradeoff, the optimal choice of a queueing scheme's control parameter depends on the cost associated with the relative importance of queueing delay and utilization. The optimal choice of control parameter is the one that maximizes a benefit that can be defined as the difference between utilization and cost associated with queuing delay. We present a generic algorithm Optimal Delay-Utilization control of t (ODU-t) that is designed with a performance goal of maximizing this benefit. Its novelty lies in fact that it maximizes the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor does it require complex parameter estimation. Moreover, other performance metrics like loss rate or jitter can be directly incorporated into the optimization framework as well. Packet level ns2 simulations are given to demonstrate the behavior of the proposed algorithm.

AB - Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in understanding this relationship stem from the fact that it depends on the complex nature of arriving traffic and the problems associated with modelling such traffic. Existing AQM schemes achieve a "low delay" and "high utilization" by responding early to congestion without considering the exact relationship between delay and utilization. However, in the context of exploiting the delay/utilization tradeoff, the optimal choice of a queueing scheme's control parameter depends on the cost associated with the relative importance of queueing delay and utilization. The optimal choice of control parameter is the one that maximizes a benefit that can be defined as the difference between utilization and cost associated with queuing delay. We present a generic algorithm Optimal Delay-Utilization control of t (ODU-t) that is designed with a performance goal of maximizing this benefit. Its novelty lies in fact that it maximizes the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor does it require complex parameter estimation. Moreover, other performance metrics like loss rate or jitter can be directly incorporated into the optimization framework as well. Packet level ns2 simulations are given to demonstrate the behavior of the proposed algorithm.

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

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

M3 - Conference contribution

SN - 3540727086

SN - 9783540727088

VL - 4465 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 54

EP - 64

BT - Network Control and Optimization - First EuroFGI International Conference, NET-COOP 2007, Proceedings

ER -