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 utilisateur typique se préoccupe uniquement de la qualité de service d'un réseau de bout en bout. Par conséquent, la manière dont les exigences de bout en bout sont mappées aux exigences du nœud de commutation local et à l'utilisation maximale du réseau dépend de la conception interne du réseau. Dans cet article, nous abordons le problème de l’allocation de QOS. Nous avons dérivé une politique d'allocation de QOS optimale et décidé de la limite d'utilisation maximale dans un modèle de trafic déterministe. Nous avons adopté le délai le plus défavorable comme exigence de QOS de bout en bout et locale. Avec le modèle de trafic (σ, ρ), nous avons dérivé une formule pour le délai et le nombre de connexions. Nous avons constaté qu'avec le délai défini comme mesure de QOS, il existe une différence significative dans les performances des politiques d'allocation. Nous avons également développé une stratégie d'évaluation pour analyser les politiques d'allocation. Les résultats numériques pour deux topologies de réseau simples : le modèle de réseau tandem et le modèle de charge de trafic inégale, comparent la politique d'allocation égale avec la politique d'allocation optimale et montrent l'exactitude et l'efficacité de la politique d'allocation de 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.
Copier
Yen-Ping CHU, E-Hong HWANG, Kuan-Cheng LIN, Chin-Hsing CHEN, "Local Allocation of End-to-End Delay Requirement" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 9, pp. 1380-1387, September 1999, doi: .
Abstract: A typical user is concerned only with the quality of service of a network on an end-to-end basis. Therefore, how end-to-end requirements are mapped into the local switching node requirements and maximum network utilization is a function of network internal design. In this paper, we address the problem of QOS allocation. We derived an optimal QOS allocation policy and decided the maximum utilization bound in a deterministic traffic model. We adopted the worst case delay bound as the end-to-end and local QOS requirement. With (σ, ρ) traffic model, we derived a formula for delay bound and the number of connections. We found that with the delay bound as the QOS metric, there is a significant difference in the performance of allocation policies. We also developed an evaluation strategy to analyze allocation policies. The numerical results for two simple network topologies: tandem network model and uneven traffic load model, compare the equal allocation policy with the optimal allocation policy and show the correctness and efficiency of QOS allocation policy.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_9_1380/_p
Copier
@ARTICLE{e82-b_9_1380,
author={Yen-Ping CHU, E-Hong HWANG, Kuan-Cheng LIN, Chin-Hsing CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={Local Allocation of End-to-End Delay Requirement},
year={1999},
volume={E82-B},
number={9},
pages={1380-1387},
abstract={A typical user is concerned only with the quality of service of a network on an end-to-end basis. Therefore, how end-to-end requirements are mapped into the local switching node requirements and maximum network utilization is a function of network internal design. In this paper, we address the problem of QOS allocation. We derived an optimal QOS allocation policy and decided the maximum utilization bound in a deterministic traffic model. We adopted the worst case delay bound as the end-to-end and local QOS requirement. With (σ, ρ) traffic model, we derived a formula for delay bound and the number of connections. We found that with the delay bound as the QOS metric, there is a significant difference in the performance of allocation policies. We also developed an evaluation strategy to analyze allocation policies. The numerical results for two simple network topologies: tandem network model and uneven traffic load model, compare the equal allocation policy with the optimal allocation policy and show the correctness and efficiency of QOS allocation policy.},
keywords={},
doi={},
ISSN={},
month={September},}
Copier
TY - JOUR
TI - Local Allocation of End-to-End Delay Requirement
T2 - IEICE TRANSACTIONS on Communications
SP - 1380
EP - 1387
AU - Yen-Ping CHU
AU - E-Hong HWANG
AU - Kuan-Cheng LIN
AU - Chin-Hsing CHEN
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 1999
AB - A typical user is concerned only with the quality of service of a network on an end-to-end basis. Therefore, how end-to-end requirements are mapped into the local switching node requirements and maximum network utilization is a function of network internal design. In this paper, we address the problem of QOS allocation. We derived an optimal QOS allocation policy and decided the maximum utilization bound in a deterministic traffic model. We adopted the worst case delay bound as the end-to-end and local QOS requirement. With (σ, ρ) traffic model, we derived a formula for delay bound and the number of connections. We found that with the delay bound as the QOS metric, there is a significant difference in the performance of allocation policies. We also developed an evaluation strategy to analyze allocation policies. The numerical results for two simple network topologies: tandem network model and uneven traffic load model, compare the equal allocation policy with the optimal allocation policy and show the correctness and efficiency of QOS allocation policy.
ER -