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
Dans cet article, nous proposons un nouvel algorithme de consolidation appelé algorithme de rétroaction cellulaire (SBF) de gestion sélective des ressources vers l'arrière (BRM). Il permet d'obtenir une réponse rapide et un faible bruit de consolidation en transférant sélectivement la cellule BRM de la branche la plus encombrée vers la source au lieu d'attendre de toutes les branches. Des modèles mathématiques sont dérivés pour caractériser quantitativement les performances, c'est-à-dire le temps de réponse et l'ACR de la source, du SBF et des algorithmes proposés précédemment. L'interopérabilité des algorithmes de consolidation dans le débit binaire disponible (ABR) point à multipoint est étudiée. Nous abordons les aspects du temps de réponse, du bruit de consolidation et de l'effet du délai aller-retour asymétrique (RTD) entre le point de branchement et la destination. Toutes les combinaisons de quatre algorithmes de consolidation différents sont interopérées dans les configurations de réseau local/métropolitain (LAN/MAN) et de réseau étendu (WAN). Grâce à une méthode de simulation, nous avons constaté que l'algorithme de consolidation utilisé au point de branchement le plus élevé du flux, en particulier dans la configuration WAN, joue un rôle important dans la détermination des performances du réseau. Cependant, l’algorithme de consolidation utilisé au point de branchement inférieur du flux affecte de manière insignifiante les performances du réseau. Par conséquent, afin d'obtenir des performances bonnes et efficaces du réseau interopéré d'algorithmes de consolidation, un algorithme de réponse rapide avec un faible bruit de consolidation doit être utilisé au point de branchement le plus élevé du flux et un algorithme simple et facile à mettre en œuvre doit être utilisé au niveau du flux inférieur. point de branchement.
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
Naris RANGSINOPPAMAS, Tanun JARUVITAYAKOVIT, Prasit PRAPINMONGKOLKARN, "Interoperation and Analysis of Consolidation Algorithm for Point-to-Multipoint ABR Service in ATM Networks" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 5, pp. 987-1001, May 2002, doi: .
Abstract: In this paper, we propose a new consolidation algorithm called the Selective Backward Resource Management (BRM) cell Feedback (SBF) algorithm. It achieves a fast response and low consolidation noise by selectively forwarding BRM cell from the most congested branch to the source instead of waiting from all branches. Mathematical models are derived to quantitatively characterize the performance, i.e. the response time and ACR of the source, of SBF and previously proposed algorithms. The interoperation of consolidation algorithms in point-to-multipoint available bit rate (ABR) is investigated. We address response time, consolidation noise and the effect of asymmetrical round trip delay (RTD) from branch point to destinations aspects. All combinations of four different consolidation algorithms are interoperated in both local/metropolitan area network (LAN/MAN) and wide area network (WAN) configuration. By a simulation method, we found that the consolidation algorithm used at the uppermost stream branch point, especially in WAN configuration, plays an important role in determining the performance of the network. However, consolidation algorithm used at the lower stream branch point affects the network performance insignificantly. Hence, in order to achieve a good and effective performance of the consolidation algorithms interoperated network, a fast response with low consolidation noise algorithm should be used at the uppermost stream branch point and a simple and easy to implement algorithm should be used at the lower stream branch point.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_5_987/_p
Copier
@ARTICLE{e85-b_5_987,
author={Naris RANGSINOPPAMAS, Tanun JARUVITAYAKOVIT, Prasit PRAPINMONGKOLKARN, },
journal={IEICE TRANSACTIONS on Communications},
title={Interoperation and Analysis of Consolidation Algorithm for Point-to-Multipoint ABR Service in ATM Networks},
year={2002},
volume={E85-B},
number={5},
pages={987-1001},
abstract={In this paper, we propose a new consolidation algorithm called the Selective Backward Resource Management (BRM) cell Feedback (SBF) algorithm. It achieves a fast response and low consolidation noise by selectively forwarding BRM cell from the most congested branch to the source instead of waiting from all branches. Mathematical models are derived to quantitatively characterize the performance, i.e. the response time and ACR of the source, of SBF and previously proposed algorithms. The interoperation of consolidation algorithms in point-to-multipoint available bit rate (ABR) is investigated. We address response time, consolidation noise and the effect of asymmetrical round trip delay (RTD) from branch point to destinations aspects. All combinations of four different consolidation algorithms are interoperated in both local/metropolitan area network (LAN/MAN) and wide area network (WAN) configuration. By a simulation method, we found that the consolidation algorithm used at the uppermost stream branch point, especially in WAN configuration, plays an important role in determining the performance of the network. However, consolidation algorithm used at the lower stream branch point affects the network performance insignificantly. Hence, in order to achieve a good and effective performance of the consolidation algorithms interoperated network, a fast response with low consolidation noise algorithm should be used at the uppermost stream branch point and a simple and easy to implement algorithm should be used at the lower stream branch point.},
keywords={},
doi={},
ISSN={},
month={May},}
Copier
TY - JOUR
TI - Interoperation and Analysis of Consolidation Algorithm for Point-to-Multipoint ABR Service in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 987
EP - 1001
AU - Naris RANGSINOPPAMAS
AU - Tanun JARUVITAYAKOVIT
AU - Prasit PRAPINMONGKOLKARN
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2002
AB - In this paper, we propose a new consolidation algorithm called the Selective Backward Resource Management (BRM) cell Feedback (SBF) algorithm. It achieves a fast response and low consolidation noise by selectively forwarding BRM cell from the most congested branch to the source instead of waiting from all branches. Mathematical models are derived to quantitatively characterize the performance, i.e. the response time and ACR of the source, of SBF and previously proposed algorithms. The interoperation of consolidation algorithms in point-to-multipoint available bit rate (ABR) is investigated. We address response time, consolidation noise and the effect of asymmetrical round trip delay (RTD) from branch point to destinations aspects. All combinations of four different consolidation algorithms are interoperated in both local/metropolitan area network (LAN/MAN) and wide area network (WAN) configuration. By a simulation method, we found that the consolidation algorithm used at the uppermost stream branch point, especially in WAN configuration, plays an important role in determining the performance of the network. However, consolidation algorithm used at the lower stream branch point affects the network performance insignificantly. Hence, in order to achieve a good and effective performance of the consolidation algorithms interoperated network, a fast response with low consolidation noise algorithm should be used at the uppermost stream branch point and a simple and easy to implement algorithm should be used at the lower stream branch point.
ER -