Details
| Original language | English |
|---|---|
| Pages | 318-325 |
| Number of pages | 8 |
| Publication status | Published - 2005 |
| Externally published | Yes |
| Event | Next Generation Internet Networks, NGI 2005 - Roma, Italy Duration: 18 Apr 2005 → 20 Apr 2005 |
Conference
| Conference | Next Generation Internet Networks, NGI 2005 |
|---|---|
| Country/Territory | Italy |
| City | Roma |
| Period | 18 Apr 2005 → 20 Apr 2005 |
Abstract
To provide statistical service guarantee and achieve high network utilization, measurement-based admission control (MBAC) has been studied for over one decade. Many MBAC algorithms have been proposed in the literature. However, most of them belong to aggregate MBAC algorithms which assume or require that (1) First-In-First-Out (FIFO) is used for aggregating flows; (2) statistical service guarantees are provided to the aggregate of admitted flows; (3) each flow requires and experiences the same statistical service guarantees as the aggregate. In this paper, we focus on per-flow MBAC that aims to provide possibly different statistical service guarantees to individual flows in an aggregate. Particularly, we propose a simple per-flow MBAC algorithm in which dynamic priority scheduling (DPS) is adopted to aggregate flows. With this DPS-based per-flow MBAC algorithm, a newly admitted flow is always given a lower priority level than all existing flows, and its priority level is improved if an existing flow leaves the system. Consequently, once a flow is admitted, its received service will not be adversely affected by other flows admitted after it. Because of this, there is no need to re-check or adjust network resources allocated to existing flows due to the admission of a new flow.
ASJC Scopus subject areas
- Engineering(all)
- General Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
2005. 318-325 Paper presented at Next Generation Internet Networks, NGI 2005, Roma, Italy.
Research output: Contribution to conference › Paper › Research › peer review
}
TY - CONF
T1 - Measurement-Based Admission Control for a Flow-Aware Network
AU - Jiang, Yuming
AU - Emstad, Peder J.
AU - Nevin, Anne
AU - Nicola, Victor
AU - Fidler, Markus
PY - 2005
Y1 - 2005
N2 - To provide statistical service guarantee and achieve high network utilization, measurement-based admission control (MBAC) has been studied for over one decade. Many MBAC algorithms have been proposed in the literature. However, most of them belong to aggregate MBAC algorithms which assume or require that (1) First-In-First-Out (FIFO) is used for aggregating flows; (2) statistical service guarantees are provided to the aggregate of admitted flows; (3) each flow requires and experiences the same statistical service guarantees as the aggregate. In this paper, we focus on per-flow MBAC that aims to provide possibly different statistical service guarantees to individual flows in an aggregate. Particularly, we propose a simple per-flow MBAC algorithm in which dynamic priority scheduling (DPS) is adopted to aggregate flows. With this DPS-based per-flow MBAC algorithm, a newly admitted flow is always given a lower priority level than all existing flows, and its priority level is improved if an existing flow leaves the system. Consequently, once a flow is admitted, its received service will not be adversely affected by other flows admitted after it. Because of this, there is no need to re-check or adjust network resources allocated to existing flows due to the admission of a new flow.
AB - To provide statistical service guarantee and achieve high network utilization, measurement-based admission control (MBAC) has been studied for over one decade. Many MBAC algorithms have been proposed in the literature. However, most of them belong to aggregate MBAC algorithms which assume or require that (1) First-In-First-Out (FIFO) is used for aggregating flows; (2) statistical service guarantees are provided to the aggregate of admitted flows; (3) each flow requires and experiences the same statistical service guarantees as the aggregate. In this paper, we focus on per-flow MBAC that aims to provide possibly different statistical service guarantees to individual flows in an aggregate. Particularly, we propose a simple per-flow MBAC algorithm in which dynamic priority scheduling (DPS) is adopted to aggregate flows. With this DPS-based per-flow MBAC algorithm, a newly admitted flow is always given a lower priority level than all existing flows, and its priority level is improved if an existing flow leaves the system. Consequently, once a flow is admitted, its received service will not be adversely affected by other flows admitted after it. Because of this, there is no need to re-check or adjust network resources allocated to existing flows due to the admission of a new flow.
UR - http://www.scopus.com/inward/record.url?scp=33744480302&partnerID=8YFLogxK
U2 - 10.1109/NGI.2005.1431683
DO - 10.1109/NGI.2005.1431683
M3 - Paper
AN - SCOPUS:33744480302
SP - 318
EP - 325
T2 - Next Generation Internet Networks, NGI 2005
Y2 - 18 April 2005 through 20 April 2005
ER -