Bounds implied by drift and applications

Research output: Contribution to journalConference article

Abstract

A recurring theme in the design of control schemes for computer communication networks has been to identify the drift of critical quantities such as queue lengths, and then devise control strategies that close the loop. A useful tool for the performance analysis of such strategies are bounds on deviations from the expected trajectory. This talk identifies an incomplete list of such tools that have been used in a broad class of applications, for both stochastic and deterministically constrained models of load.

Original languageEnglish (US)
Number of pages1
JournalPerformance Evaluation Review
Volume43
Issue number1
DOIs
StatePublished - Jun 24 2015
EventACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2015 - Portland, United States
Duration: Jun 15 2015Jun 19 2015

Fingerprint

Telecommunication networks
Trajectories

Keywords

  • Drift analysis
  • Lyapunov function
  • Stability

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Bounds implied by drift and applications. / Hajek, Bruce.

In: Performance Evaluation Review, Vol. 43, No. 1, 24.06.2015.

Research output: Contribution to journalConference article

@article{ddd311244ff44397b2521f1b7fb75ce2,
title = "Bounds implied by drift and applications",
abstract = "A recurring theme in the design of control schemes for computer communication networks has been to identify the drift of critical quantities such as queue lengths, and then devise control strategies that close the loop. A useful tool for the performance analysis of such strategies are bounds on deviations from the expected trajectory. This talk identifies an incomplete list of such tools that have been used in a broad class of applications, for both stochastic and deterministically constrained models of load.",
keywords = "Drift analysis, Lyapunov function, Stability",
author = "Bruce Hajek",
year = "2015",
month = "6",
day = "24",
doi = "10.1145/2796314.2745902",
language = "English (US)",
volume = "43",
journal = "Performance Evaluation Review",
issn = "0163-5999",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - Bounds implied by drift and applications

AU - Hajek, Bruce

PY - 2015/6/24

Y1 - 2015/6/24

N2 - A recurring theme in the design of control schemes for computer communication networks has been to identify the drift of critical quantities such as queue lengths, and then devise control strategies that close the loop. A useful tool for the performance analysis of such strategies are bounds on deviations from the expected trajectory. This talk identifies an incomplete list of such tools that have been used in a broad class of applications, for both stochastic and deterministically constrained models of load.

AB - A recurring theme in the design of control schemes for computer communication networks has been to identify the drift of critical quantities such as queue lengths, and then devise control strategies that close the loop. A useful tool for the performance analysis of such strategies are bounds on deviations from the expected trajectory. This talk identifies an incomplete list of such tools that have been used in a broad class of applications, for both stochastic and deterministically constrained models of load.

KW - Drift analysis

KW - Lyapunov function

KW - Stability

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

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

U2 - 10.1145/2796314.2745902

DO - 10.1145/2796314.2745902

M3 - Conference article

AN - SCOPUS:84955589402

VL - 43

JO - Performance Evaluation Review

JF - Performance Evaluation Review

SN - 0163-5999

IS - 1

ER -