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
Les services de multidiffusion en temps réel et évolutifs sont d'une importance capitale pour les applications de l'Internet industriel des objets (IIoT). Pour réaliser ces services, l'algorithme de multidiffusion doit, d'une part, garantir que le délai maximum d'une session de multidiffusion ne dépasse pas sa limite supérieure de délai. D’un autre côté, l’algorithme devrait minimiser les coûts de session. En tant que paradigme de réseau émergent, le réseau défini par logiciel (SDN) peut fournir une vue globale du réseau aux algorithmes de multidiffusion, ouvrant ainsi de nouvelles opportunités pour réaliser les services de multidiffusion souhaités dans les environnements IIoT. Malheureusement, les algorithmes de multidiffusion basés sur SDN (SDM) existants ne peuvent pas répondre simultanément aux exigences en temps réel et évolutives. Par conséquent, dans cet article, nous nous concentrons sur la conception d’algorithmes SDM pour les environnements IIoT. Pour être plus précis, l'article convertit d'abord le problème de construction d'arbres de multidiffusion pour SDM dans les environnements IIoT en un problème d'arbre partagé au moindre coût limité par les délais et prouve qu'il s'agit d'un problème d'arbre partagé de moindre coût limité par les délais. NP-complet problème. Ensuite, l'article propose un algorithme d'arbre partagé (ST) appelé SDM4IIoT pour calculer des solutions sous-optimales au problème. L'algorithme se compose de cinq étapes : 1) construire un arbre partagé optimal en termes de délai ; 2) diviser l'arborescence en un ensemble de sous-chemins et un sous-arbre ; 3) optimiser le coût de chaque sous-trajet en assouplissant la contrainte de délai ; 4) optimiser le coût du sous-arbre de la même manière ; 5) les recombiner dans un arbre partagé. Les résultats de la simulation montrent que l’algorithme peut fournir une assistance en temps réel que les autres algorithmes ST ne peuvent pas fournir. De plus, il peut atteindre une bonne évolutivité. Son coût n’est que 20.56 % plus élevé que celui de l’algorithme ST optimal en termes de coût. De plus, son temps de calcul est également acceptable. L'algorithme peut aider à réaliser des services de multidiffusion en temps réel et évolutifs pour les applications IIoT.
Hequn LI
Northeastern University
Jiaxi LU
Northeastern University
Jinfa WANG
Institute of Information Engineering, CAS
Hai ZHAO
Northeastern University
Jiuqiang XU
Northeastern University
Xingchi CHEN
Northeastern University
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
Hequn LI, Jiaxi LU, Jinfa WANG, Hai ZHAO, Jiuqiang XU, Xingchi CHEN, "SDM4IIoT: An SDN-Based Multicast Algorithm for Industrial Internet of Things" in IEICE TRANSACTIONS on Communications,
vol. E105-B, no. 5, pp. 545-556, May 2022, doi: 10.1587/transcom.2021EBP3096.
Abstract: Real-time and scalable multicast services are of paramount importance to Industrial Internet of Things (IIoT) applications. To realize these services, the multicast algorithm should, on the one hand, ensure the maximum delay of a multicast session not exceeding its upper delay bound. On the other hand, the algorithm should minimize session costs. As an emerging networking paradigm, Software-defined Networking (SDN) can provide a global view of the network to multicast algorithms, thereby bringing new opportunities for realizing the desired multicast services in IIoT environments. Unfortunately, existing SDN-based multicast (SDM) algorithms cannot meet the real-time and scalable requirements simultaneously. Therefore, in this paper, we focus on SDM algorithm design for IIoT environments. To be specific, the paper first converts the multicast tree construction problem for SDM in IIoT environments into a delay-bounded least-cost shared tree problem and proves that it is an NP-complete problem. Then, the paper puts forward a shared tree (ST) algorithm called SDM4IIoT to compute suboptimal solutions to the problem. The algorithm consists of five steps: 1) construct a delay-optimal shared tree; 2) divide the tree into a set of subpaths and a subtree; 3) optimize the cost of each subpath by relaxing the delay constraint; 4) optimize the subtree cost in the same manner; 5) recombine them into a shared tree. Simulation results show that the algorithm can provide real-time support that other ST algorithms cannot. In addition, it can achieve good scalability. Its cost is only 20.56% higher than the cost-optimal ST algorithm. Furthermore, its computation time is also acceptable. The algorithm can help to realize real-time and scalable multicast services for IIoT applications.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2021EBP3096/_p
Copier
@ARTICLE{e105-b_5_545,
author={Hequn LI, Jiaxi LU, Jinfa WANG, Hai ZHAO, Jiuqiang XU, Xingchi CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={SDM4IIoT: An SDN-Based Multicast Algorithm for Industrial Internet of Things},
year={2022},
volume={E105-B},
number={5},
pages={545-556},
abstract={Real-time and scalable multicast services are of paramount importance to Industrial Internet of Things (IIoT) applications. To realize these services, the multicast algorithm should, on the one hand, ensure the maximum delay of a multicast session not exceeding its upper delay bound. On the other hand, the algorithm should minimize session costs. As an emerging networking paradigm, Software-defined Networking (SDN) can provide a global view of the network to multicast algorithms, thereby bringing new opportunities for realizing the desired multicast services in IIoT environments. Unfortunately, existing SDN-based multicast (SDM) algorithms cannot meet the real-time and scalable requirements simultaneously. Therefore, in this paper, we focus on SDM algorithm design for IIoT environments. To be specific, the paper first converts the multicast tree construction problem for SDM in IIoT environments into a delay-bounded least-cost shared tree problem and proves that it is an NP-complete problem. Then, the paper puts forward a shared tree (ST) algorithm called SDM4IIoT to compute suboptimal solutions to the problem. The algorithm consists of five steps: 1) construct a delay-optimal shared tree; 2) divide the tree into a set of subpaths and a subtree; 3) optimize the cost of each subpath by relaxing the delay constraint; 4) optimize the subtree cost in the same manner; 5) recombine them into a shared tree. Simulation results show that the algorithm can provide real-time support that other ST algorithms cannot. In addition, it can achieve good scalability. Its cost is only 20.56% higher than the cost-optimal ST algorithm. Furthermore, its computation time is also acceptable. The algorithm can help to realize real-time and scalable multicast services for IIoT applications.},
keywords={},
doi={10.1587/transcom.2021EBP3096},
ISSN={1745-1345},
month={May},}
Copier
TY - JOUR
TI - SDM4IIoT: An SDN-Based Multicast Algorithm for Industrial Internet of Things
T2 - IEICE TRANSACTIONS on Communications
SP - 545
EP - 556
AU - Hequn LI
AU - Jiaxi LU
AU - Jinfa WANG
AU - Hai ZHAO
AU - Jiuqiang XU
AU - Xingchi CHEN
PY - 2022
DO - 10.1587/transcom.2021EBP3096
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E105-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2022
AB - Real-time and scalable multicast services are of paramount importance to Industrial Internet of Things (IIoT) applications. To realize these services, the multicast algorithm should, on the one hand, ensure the maximum delay of a multicast session not exceeding its upper delay bound. On the other hand, the algorithm should minimize session costs. As an emerging networking paradigm, Software-defined Networking (SDN) can provide a global view of the network to multicast algorithms, thereby bringing new opportunities for realizing the desired multicast services in IIoT environments. Unfortunately, existing SDN-based multicast (SDM) algorithms cannot meet the real-time and scalable requirements simultaneously. Therefore, in this paper, we focus on SDM algorithm design for IIoT environments. To be specific, the paper first converts the multicast tree construction problem for SDM in IIoT environments into a delay-bounded least-cost shared tree problem and proves that it is an NP-complete problem. Then, the paper puts forward a shared tree (ST) algorithm called SDM4IIoT to compute suboptimal solutions to the problem. The algorithm consists of five steps: 1) construct a delay-optimal shared tree; 2) divide the tree into a set of subpaths and a subtree; 3) optimize the cost of each subpath by relaxing the delay constraint; 4) optimize the subtree cost in the same manner; 5) recombine them into a shared tree. Simulation results show that the algorithm can provide real-time support that other ST algorithms cannot. In addition, it can achieve good scalability. Its cost is only 20.56% higher than the cost-optimal ST algorithm. Furthermore, its computation time is also acceptable. The algorithm can help to realize real-time and scalable multicast services for IIoT applications.
ER -