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
이 문서에서는 서비스 품질(Qos) 요구 사항을 보장하기 위해 입력 세션에 네트워크 리소스를 할당하기 위해 연결별 종단 간 통화 허용 제어(CAC) 문제를 해결합니다. CAC 문제의 해결과 함께, 설정하려는 연결의 손실률과 지연 제한 Qos 요구 사항을 기술하고 선형으로 모델링된 관련 입력 트래픽의 통계적 특성을 설명하기 위해 트래픽 디스크립터를 제안합니다. 평균 함수에 (XNUMX 평균) 분수 브라운 운동을 더한 것입니다. 트래픽 설명자의 정보는 Qos 요구 사항을 보장하기 위해 Leaky Bucket Shaper 및 스케줄링 알고리즘을 사용하는 네트워크에서 입력 트래픽에 대한 채널 대역폭 및 버퍼 공간 할당을 결정하는 데 충분합니다. CAC 문제는 각 반복에 두 단계가 있는 반복 알고리즘에 의해 해결됩니다. 하나는 후보 종단 간 라우팅 경로 검색을 담당하고 다른 하나는 충족할 이 후보 경로의 적법성을 확인하는 역할을 합니다. Qos 요구 사항과 이러한 합법적인 경로에 리소스를 할당하는 것입니다.
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.
부
Yung-Chung WANG, Chung-Chin LU, "End-to-End Call Admission Control in Service Guaranteed Networks" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 4, pp. 791-802, April 2000, doi: .
Abstract: A per-connection end-to-end call admission control (CAC) problem is solved in this paper to allocate network resources to an input session to guarantee its quality of service (Qos) requirements. In conjunction with the solution of the CAC problem, a traffic descriptor is proposed to describe the loss rate and the delay bound Qos requirements of the connection to be set up as well as the statistical characteristics of the associated input traffic which is modeled as a linear mean function plus a (zero-mean) fractional Brownian motion. The information in the traffic descriptor is sufficient to determine the allocation of channel bandwidth and buffer space to the input traffic in a network which employs leaky bucket shapers and scheduling algorithms to guarantee the Qos requirements. The CAC problem is solved by an iterative algorithm of which there are two stages in each iteration: one is responsible for the search of a candidate end-to-end routing path and the other for the verification of the legitimacy of this candidate path to meet the Qos requirements and for the allocation of resources in such a legitimate path.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_4_791/_p
부
@ARTICLE{e83-b_4_791,
author={Yung-Chung WANG, Chung-Chin LU, },
journal={IEICE TRANSACTIONS on Communications},
title={End-to-End Call Admission Control in Service Guaranteed Networks},
year={2000},
volume={E83-B},
number={4},
pages={791-802},
abstract={A per-connection end-to-end call admission control (CAC) problem is solved in this paper to allocate network resources to an input session to guarantee its quality of service (Qos) requirements. In conjunction with the solution of the CAC problem, a traffic descriptor is proposed to describe the loss rate and the delay bound Qos requirements of the connection to be set up as well as the statistical characteristics of the associated input traffic which is modeled as a linear mean function plus a (zero-mean) fractional Brownian motion. The information in the traffic descriptor is sufficient to determine the allocation of channel bandwidth and buffer space to the input traffic in a network which employs leaky bucket shapers and scheduling algorithms to guarantee the Qos requirements. The CAC problem is solved by an iterative algorithm of which there are two stages in each iteration: one is responsible for the search of a candidate end-to-end routing path and the other for the verification of the legitimacy of this candidate path to meet the Qos requirements and for the allocation of resources in such a legitimate path.},
keywords={},
doi={},
ISSN={},
month={April},}
부
TY - JOUR
TI - End-to-End Call Admission Control in Service Guaranteed Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 791
EP - 802
AU - Yung-Chung WANG
AU - Chung-Chin LU
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2000
AB - A per-connection end-to-end call admission control (CAC) problem is solved in this paper to allocate network resources to an input session to guarantee its quality of service (Qos) requirements. In conjunction with the solution of the CAC problem, a traffic descriptor is proposed to describe the loss rate and the delay bound Qos requirements of the connection to be set up as well as the statistical characteristics of the associated input traffic which is modeled as a linear mean function plus a (zero-mean) fractional Brownian motion. The information in the traffic descriptor is sufficient to determine the allocation of channel bandwidth and buffer space to the input traffic in a network which employs leaky bucket shapers and scheduling algorithms to guarantee the Qos requirements. The CAC problem is solved by an iterative algorithm of which there are two stages in each iteration: one is responsible for the search of a candidate end-to-end routing path and the other for the verification of the legitimacy of this candidate path to meet the Qos requirements and for the allocation of resources in such a legitimate path.
ER -