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
Des procédés de mise en œuvre des fonctions SS7 sont proposés pour un nœud de commutation décentralisé de grande capacité ; ils satisfont à la condition de cacher les configurations distribuées aux nœuds adjacents. Premièrement, les méthodes d'hébergement et d'acquisition de lignes sont clarifiées pour un nœud de commutation de grande capacité dans lequel plusieurs modules sont utilisés pour réaliser des circuits interurbains et des liaisons de signalisation SS7. Deux méthodes sont alors proposées pour allouer les fonctions SS7 au sein du nœud de commutation. L'un répartit les fonctions sur plusieurs modules à commutation de circuits (allocation distribuée) tandis que l'autre centralise les fonctions dans des modules de signalisation dédiés (allocation centralisée). Nous évaluons quantitativement les deux méthodes en termes d'échelle de nœud par rapport au nombre de modules et de liaisons de signalisation requis, au taux de transfert de données inter-modules requis et à la capacité de gestion du trafic des nœuds lorsqu'un module particulier tombe en panne. À partir des résultats de l'évaluation, nous montrons que l'allocation distribuée doit être utilisée pour les nœuds à petite échelle et l'allocation centralisée pour les nœuds à grande échelle. Nous montrons également l'efficacité d'une méthode permettant d'éviter un problème caractéristique qui survient lorsqu'un module particulier tombe en panne. Enfin, nous implémentons un système expérimental à titre d'exemple.
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
Etsuo MASUDA, Hideo SHIMBO, Katsuyuki KAWASE, Masanori HIRANO, "Implementation of SS No. 7 Functions in a Large-Capacity Switching Node with Distributed Configuration" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 12, pp. 2635-2647, December 2000, doi: .
Abstract: Methods for implementing SS7 functions are proposed for a large-capacity decentralized switching node; they satisfy the condition of hiding distributed configurations from adjacent nodes. First, line accommodation and acquisition methods are clarified for a large-capacity switching node in which multiple modules are used to realize trunk circuits and SS7 signaling links. Two methods are then proposed for allocating SS7 functions within the switching node. One distributes the functions over multiple circuit-switched modules (distributed allocation) while the other centralizes the functions in dedicated signaling modules (centralized allocation). We quantitatively evaluate both methods in terms of node scale versus the number of modules and signaling links required, the inter-module data transfer rate required, and the node traffic handling capacity when a particular module fails. From the evaluation results, we show that the distributed allocation should be employed for small-scale nodes and the centralized allocation for large-scale nodes. We also show the effectiveness of a method for avoiding a characteristic problem that arises when a particular module fails. Finally, we implement an experimental system as an example.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_12_2635/_p
Copier
@ARTICLE{e83-b_12_2635,
author={Etsuo MASUDA, Hideo SHIMBO, Katsuyuki KAWASE, Masanori HIRANO, },
journal={IEICE TRANSACTIONS on Communications},
title={Implementation of SS No. 7 Functions in a Large-Capacity Switching Node with Distributed Configuration},
year={2000},
volume={E83-B},
number={12},
pages={2635-2647},
abstract={Methods for implementing SS7 functions are proposed for a large-capacity decentralized switching node; they satisfy the condition of hiding distributed configurations from adjacent nodes. First, line accommodation and acquisition methods are clarified for a large-capacity switching node in which multiple modules are used to realize trunk circuits and SS7 signaling links. Two methods are then proposed for allocating SS7 functions within the switching node. One distributes the functions over multiple circuit-switched modules (distributed allocation) while the other centralizes the functions in dedicated signaling modules (centralized allocation). We quantitatively evaluate both methods in terms of node scale versus the number of modules and signaling links required, the inter-module data transfer rate required, and the node traffic handling capacity when a particular module fails. From the evaluation results, we show that the distributed allocation should be employed for small-scale nodes and the centralized allocation for large-scale nodes. We also show the effectiveness of a method for avoiding a characteristic problem that arises when a particular module fails. Finally, we implement an experimental system as an example.},
keywords={},
doi={},
ISSN={},
month={December},}
Copier
TY - JOUR
TI - Implementation of SS No. 7 Functions in a Large-Capacity Switching Node with Distributed Configuration
T2 - IEICE TRANSACTIONS on Communications
SP - 2635
EP - 2647
AU - Etsuo MASUDA
AU - Hideo SHIMBO
AU - Katsuyuki KAWASE
AU - Masanori HIRANO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2000
AB - Methods for implementing SS7 functions are proposed for a large-capacity decentralized switching node; they satisfy the condition of hiding distributed configurations from adjacent nodes. First, line accommodation and acquisition methods are clarified for a large-capacity switching node in which multiple modules are used to realize trunk circuits and SS7 signaling links. Two methods are then proposed for allocating SS7 functions within the switching node. One distributes the functions over multiple circuit-switched modules (distributed allocation) while the other centralizes the functions in dedicated signaling modules (centralized allocation). We quantitatively evaluate both methods in terms of node scale versus the number of modules and signaling links required, the inter-module data transfer rate required, and the node traffic handling capacity when a particular module fails. From the evaluation results, we show that the distributed allocation should be employed for small-scale nodes and the centralized allocation for large-scale nodes. We also show the effectiveness of a method for avoiding a characteristic problem that arises when a particular module fails. Finally, we implement an experimental system as an example.
ER -