IEICE TRANSACTIONS on Communications
Optimal Admission Control Based on Per-Switch Delay Allocation for Networks with a Bounded Delay Service
Summary :
To provide a bounded-delay service with an end-to-end delay guarantee and utilize network efficiently, the admission control functions in a network require an adequate per-switch delay allocation policy to allocate end-to-end delay requirement to a set of local switches. This letter present an optimal delay allocation policy, according to a deterministic traffic model, and a rate-controlled scheduler. Empirical results indicate that the proposed policy perform better than EQ allocation policy, using the admission load region as index.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.7 pp.1572-1576
- Publication Date
- 2000/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Wireless Communication Switching
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yen-Ping CHU, Kuan-Cheng LIN, "Optimal Admission Control Based on Per-Switch Delay Allocation for Networks with a Bounded Delay Service" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 7, pp. 1572-1576, July 2000, doi: .
Abstract: To provide a bounded-delay service with an end-to-end delay guarantee and utilize network efficiently, the admission control functions in a network require an adequate per-switch delay allocation policy to allocate end-to-end delay requirement to a set of local switches. This letter present an optimal delay allocation policy, according to a deterministic traffic model, and a rate-controlled scheduler. Empirical results indicate that the proposed policy perform better than EQ allocation policy, using the admission load region as index.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_7_1572/_p
Copy
@ARTICLE{e83-b_7_1572,
author={Yen-Ping CHU, Kuan-Cheng LIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimal Admission Control Based on Per-Switch Delay Allocation for Networks with a Bounded Delay Service},
year={2000},
volume={E83-B},
number={7},
pages={1572-1576},
abstract={To provide a bounded-delay service with an end-to-end delay guarantee and utilize network efficiently, the admission control functions in a network require an adequate per-switch delay allocation policy to allocate end-to-end delay requirement to a set of local switches. This letter present an optimal delay allocation policy, according to a deterministic traffic model, and a rate-controlled scheduler. Empirical results indicate that the proposed policy perform better than EQ allocation policy, using the admission load region as index.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Optimal Admission Control Based on Per-Switch Delay Allocation for Networks with a Bounded Delay Service
T2 - IEICE TRANSACTIONS on Communications
SP - 1572
EP - 1576
AU - Yen-Ping CHU
AU - Kuan-Cheng LIN
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2000
AB - To provide a bounded-delay service with an end-to-end delay guarantee and utilize network efficiently, the admission control functions in a network require an adequate per-switch delay allocation policy to allocate end-to-end delay requirement to a set of local switches. This letter present an optimal delay allocation policy, according to a deterministic traffic model, and a rate-controlled scheduler. Empirical results indicate that the proposed policy perform better than EQ allocation policy, using the admission load region as index.
ER -
English
