DMCA
Comments on the Performance of Measurement-Based Admission Control Algorithms (2000)
Cached
Download Links
- [www.ieee-infocom.org]
- [www.netlab.hut.fi]
- DBLP
Other Repositories/Bibliography
| Citations: | 114 - 1 self |
BibTeX
@INPROCEEDINGS{Breslau00commentson,
author = {Lee Breslau and Sugih Jamin and Scott Shenker},
title = {Comments on the Performance of Measurement-Based Admission Control Algorithms},
booktitle = {},
year = {2000},
pages = {1233--1242}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Relaxed real-time services that do not provide guaranteed loss rates or delay bounds are of considerable interest in the Internet, since these services can achieve higher utilization than hard real-time services while still providing adequate service to adaptive real-time applications. Achieving this higher level of utilization depends on an admission control algorithm that does not rely on worst-case bounds to guide its admission decisions. Measurement-based admission control is one such approach, and several measurement-based admission control algorithms have been proposed in the literature. In this paper, we use simulation to compare the performance of several of these algorithms. We find that all of them achieve nearly the same utilization for a given packet loss rate, and that none of them are capable of accurately meeting loss targets. I. INTRODUCTION In an effort to better support applications with real-time constraints, several new per-flow packet delivery services have been ...
Keyphrases
measurement-based admission control algorithm several measurement-based admission control algorithm adequate service support application real-time application hard real-time service utilization depends considerable interest relaxed real-time service admission control worst-case bound admission decision measurement-based admission control real-time constraint loss target packet loss rate guaranteed loss rate
