The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
종단 간 지연을 보장하는 제한된 지연 서비스를 제공하고 네트워크를 효율적으로 활용하기 위해 네트워크의 승인 제어 기능에는 종단 간 지연 요구 사항을 집합에 할당하기 위한 적절한 스위치별 지연 할당 정책이 필요합니다. 로컬 스위치. 이 편지는 결정론적 트래픽 모델과 속도 제어 스케줄러에 따른 최적의 지연 할당 정책을 제시합니다. 경험적 결과는 제안된 정책이 허용 부하 영역을 지표로 사용하여 EQ 할당 정책보다 더 나은 성능을 나타냄을 나타냅니다.
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.
부
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
부
@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},}
부
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 -