Flow enforcement algorithms for ATM networks

Lars Dittmann; Søren B. Jacobsen; Klaus Moth

doi:10.1109/49.76632

Flow enforcement algorithms for ATM networks

Lars Dittmann
, Søren B. Jacobsen
, Klaus Moth

Research output: Contribution to journal › Journal article › Research › peer-review

625 Downloads (Orbit)

Abstract

Four measurement algorithms for flow enforcement in asynchronous transfer mode (ATM) networks are presented. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletraffic theory and partly on signal processing theory, is carried out. It is seen that the time constant involved increases with the increasing burstiness of the connection. It is suggested that the RMS measurement bandwidth be used to dimension linear algorithms for equal flow enforcement characteristics. Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewal-type connection using the four algorithms. The corresponding hardware demands are estimated aid compared

Original language	English
Journal	I E E E Journal on Selected Areas in Communications
Volume	9
Issue number	3
Pages (from-to)	343-350
ISSN	0733-8716
DOIs	https://doi.org/10.1109/49.76632
Publication status	Published - 1991

Bibliographical note

Copyright: 1991 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Access to Document

10.1109/49.76632

DittmannFinal published version, 847 KB

OpenUrl availability

Full text

Cite this

@article{eff4b0a3c76f469684e557ac7dff5ea1,

title = "Flow enforcement algorithms for ATM networks",

abstract = "Four measurement algorithms for flow enforcement in asynchronous transfer mode (ATM) networks are presented. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletraffic theory and partly on signal processing theory, is carried out. It is seen that the time constant involved increases with the increasing burstiness of the connection. It is suggested that the RMS measurement bandwidth be used to dimension linear algorithms for equal flow enforcement characteristics. Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewal-type connection using the four algorithms. The corresponding hardware demands are estimated aid compared",

author = "Lars Dittmann and Jacobsen, \{S{\o}ren B.\} and Klaus Moth",

note = "Copyright: 1991 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE",

year = "1991",

doi = "10.1109/49.76632",

language = "English",

volume = "9",

pages = "343--350",

journal = "I E E E Journal on Selected Areas in Communications",

issn = "0733-8716",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Flow enforcement algorithms for ATM networks

AU - Dittmann, Lars

AU - Jacobsen, Søren B.

AU - Moth, Klaus

N1 - Copyright: 1991 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

PY - 1991

Y1 - 1991

N2 - Four measurement algorithms for flow enforcement in asynchronous transfer mode (ATM) networks are presented. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletraffic theory and partly on signal processing theory, is carried out. It is seen that the time constant involved increases with the increasing burstiness of the connection. It is suggested that the RMS measurement bandwidth be used to dimension linear algorithms for equal flow enforcement characteristics. Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewal-type connection using the four algorithms. The corresponding hardware demands are estimated aid compared

AB - Four measurement algorithms for flow enforcement in asynchronous transfer mode (ATM) networks are presented. The algorithms are the leaky bucket, the rectangular sliding window, the triangular sliding window, and the exponentially weighted moving average. A comparison, based partly on teletraffic theory and partly on signal processing theory, is carried out. It is seen that the time constant involved increases with the increasing burstiness of the connection. It is suggested that the RMS measurement bandwidth be used to dimension linear algorithms for equal flow enforcement characteristics. Implementations are proposed on the block diagram level, and dimensioning examples are carried out when flow enforcing a renewal-type connection using the four algorithms. The corresponding hardware demands are estimated aid compared

U2 - 10.1109/49.76632

DO - 10.1109/49.76632

M3 - Journal article

SN - 0733-8716

VL - 9

SP - 343

EP - 350

JO - I E E E Journal on Selected Areas in Communications

JF - I E E E Journal on Selected Areas in Communications

IS - 3

ER -

Flow enforcement algorithms for ATM networks

Abstract

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this