A measurement-based admission control algorithm using variable-sized window in ATM networks

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

The decisions of Connection Admission in ATM networks should be made in real time through the use of fast algorithm. Since it is difficult to construct an accurate model for the multiplexed traffic, approximation of the multiplexed load is necessary. In this paper, we focus on a dynamic CAC (Connection Admission Control) algorithm as a different approach, in which admission control decisions are made based on network measurements. The algorithm observes the traffic through a moving window and the window size is recomputed from the measured cell loss amount. Unlike analytic modeling, the proposed method is based on the measurements of the network load over a period that is long enough to reflect the current traffic behavior. This approach also makes is possible to reallocate network resources (bandwidth and buffers) for multiple traffic classes. The performance of the proposed method is analyzed by means of simulated tests. As will be seen in the simulation results, this approach enables us to achieve a high level of bandwidth utilization and can be easily implemented for real-time admission control while still reliably keeping the cell loss ratio below a certain level.

Original languageEnglish
Pages (from-to)171-178
Number of pages8
JournalComputer Communications
Volume21
Issue number2
Publication statusPublished - 1998 Mar 1

Fingerprint

Asynchronous transfer mode
Access control
Bandwidth
Telecommunication traffic

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{4efa89b36dd542688f3b64c3f48e7f53,
title = "A measurement-based admission control algorithm using variable-sized window in ATM networks",
abstract = "The decisions of Connection Admission in ATM networks should be made in real time through the use of fast algorithm. Since it is difficult to construct an accurate model for the multiplexed traffic, approximation of the multiplexed load is necessary. In this paper, we focus on a dynamic CAC (Connection Admission Control) algorithm as a different approach, in which admission control decisions are made based on network measurements. The algorithm observes the traffic through a moving window and the window size is recomputed from the measured cell loss amount. Unlike analytic modeling, the proposed method is based on the measurements of the network load over a period that is long enough to reflect the current traffic behavior. This approach also makes is possible to reallocate network resources (bandwidth and buffers) for multiple traffic classes. The performance of the proposed method is analyzed by means of simulated tests. As will be seen in the simulation results, this approach enables us to achieve a high level of bandwidth utilization and can be easily implemented for real-time admission control while still reliably keeping the cell loss ratio below a certain level.",
author = "Sukyoung Lee and Song, {Joo Seok}",
year = "1998",
month = "3",
day = "1",
language = "English",
volume = "21",
pages = "171--178",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "2",

}

A measurement-based admission control algorithm using variable-sized window in ATM networks. / Lee, Sukyoung; Song, Joo Seok.

In: Computer Communications, Vol. 21, No. 2, 01.03.1998, p. 171-178.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A measurement-based admission control algorithm using variable-sized window in ATM networks

AU - Lee, Sukyoung

AU - Song, Joo Seok

PY - 1998/3/1

Y1 - 1998/3/1

N2 - The decisions of Connection Admission in ATM networks should be made in real time through the use of fast algorithm. Since it is difficult to construct an accurate model for the multiplexed traffic, approximation of the multiplexed load is necessary. In this paper, we focus on a dynamic CAC (Connection Admission Control) algorithm as a different approach, in which admission control decisions are made based on network measurements. The algorithm observes the traffic through a moving window and the window size is recomputed from the measured cell loss amount. Unlike analytic modeling, the proposed method is based on the measurements of the network load over a period that is long enough to reflect the current traffic behavior. This approach also makes is possible to reallocate network resources (bandwidth and buffers) for multiple traffic classes. The performance of the proposed method is analyzed by means of simulated tests. As will be seen in the simulation results, this approach enables us to achieve a high level of bandwidth utilization and can be easily implemented for real-time admission control while still reliably keeping the cell loss ratio below a certain level.

AB - The decisions of Connection Admission in ATM networks should be made in real time through the use of fast algorithm. Since it is difficult to construct an accurate model for the multiplexed traffic, approximation of the multiplexed load is necessary. In this paper, we focus on a dynamic CAC (Connection Admission Control) algorithm as a different approach, in which admission control decisions are made based on network measurements. The algorithm observes the traffic through a moving window and the window size is recomputed from the measured cell loss amount. Unlike analytic modeling, the proposed method is based on the measurements of the network load over a period that is long enough to reflect the current traffic behavior. This approach also makes is possible to reallocate network resources (bandwidth and buffers) for multiple traffic classes. The performance of the proposed method is analyzed by means of simulated tests. As will be seen in the simulation results, this approach enables us to achieve a high level of bandwidth utilization and can be easily implemented for real-time admission control while still reliably keeping the cell loss ratio below a certain level.

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

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

M3 - Article

AN - SCOPUS:0032028127

VL - 21

SP - 171

EP - 178

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 2

ER -