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
Un système de contrôle d'admission d'appel (CAC) basé sur des informations statistiques est proposé, appelé système CAC statistique. Un schéma conventionnel doit gérer les informations de session pour chaque lien afin de mettre à jour la bande passante résiduelle d'un réseau en temps réel. Ce schéma présente un problème d’évolutivité en termes de taille du réseau. Le CAC statistique rejette les demandes d'établissement de session conformément à un ratio précalculé, appelé taux de rejet. Le taux de rejet est calculé à l'aide d'informations statistiques sur la bande passante demandée pour chaque liaison, de sorte que la probabilité de congestion soit inférieure à une limite supérieure spécifiée par un opérateur de réseau. Le CAC statistique est plus évolutif en termes de taille de réseau que le schéma conventionnel car il n'a pas besoin de conserver les informations sur l'état de session hébergées. Les résultats numériques montrent que le CAC statistique, même sans informations exactes sur l'état de la session, ne dégrade que légèrement l'utilisation du réseau par rapport au schéma conventionnel.
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.
Copier
Takayuki FUJIWARA, Eiji OKI, Kohei SHIOMOTO, "Call Admission Control Scheme Based on Statistical Information" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 4, pp. 1361-1364, April 2009, doi: 10.1587/transcom.E92.B.1361.
Abstract: A call admission control (CAC) scheme based on statistical information is proposed, called the statistical CAC scheme. A conventional scheme needs to manage session information for each link to update the residual bandwidth of a network in real time. This scheme has a scalability problem in terms of network size. The statistical CAC rejects session setup requests in accordance to a pre-computed ratio, called the rejection ratio. The rejection ratio is computed by using statistical information about the bandwidth requested for each link so that the congestion probability is less than an upper bound specified by a network operator. The statistical CAC is more scalable in terms of network size than the conventional scheme because it does not need to keep accommodated session state information. Numerical results show that the statistical CAC, even without exact session state information, only slightly degrades network utilization compared with the conventional scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.1361/_p
Copier
@ARTICLE{e92-b_4_1361,
author={Takayuki FUJIWARA, Eiji OKI, Kohei SHIOMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={Call Admission Control Scheme Based on Statistical Information},
year={2009},
volume={E92-B},
number={4},
pages={1361-1364},
abstract={A call admission control (CAC) scheme based on statistical information is proposed, called the statistical CAC scheme. A conventional scheme needs to manage session information for each link to update the residual bandwidth of a network in real time. This scheme has a scalability problem in terms of network size. The statistical CAC rejects session setup requests in accordance to a pre-computed ratio, called the rejection ratio. The rejection ratio is computed by using statistical information about the bandwidth requested for each link so that the congestion probability is less than an upper bound specified by a network operator. The statistical CAC is more scalable in terms of network size than the conventional scheme because it does not need to keep accommodated session state information. Numerical results show that the statistical CAC, even without exact session state information, only slightly degrades network utilization compared with the conventional scheme.},
keywords={},
doi={10.1587/transcom.E92.B.1361},
ISSN={1745-1345},
month={April},}
Copier
TY - JOUR
TI - Call Admission Control Scheme Based on Statistical Information
T2 - IEICE TRANSACTIONS on Communications
SP - 1361
EP - 1364
AU - Takayuki FUJIWARA
AU - Eiji OKI
AU - Kohei SHIOMOTO
PY - 2009
DO - 10.1587/transcom.E92.B.1361
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2009
AB - A call admission control (CAC) scheme based on statistical information is proposed, called the statistical CAC scheme. A conventional scheme needs to manage session information for each link to update the residual bandwidth of a network in real time. This scheme has a scalability problem in terms of network size. The statistical CAC rejects session setup requests in accordance to a pre-computed ratio, called the rejection ratio. The rejection ratio is computed by using statistical information about the bandwidth requested for each link so that the congestion probability is less than an upper bound specified by a network operator. The statistical CAC is more scalable in terms of network size than the conventional scheme because it does not need to keep accommodated session state information. Numerical results show that the statistical CAC, even without exact session state information, only slightly degrades network utilization compared with the conventional scheme.
ER -