A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method
Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multicast tree (known as a multicast joining node,...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-04-01
|
Series: | Future Internet |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-5903/15/5/156 |
_version_ | 1797600013261471744 |
---|---|
author | Zhenyu Tian Jiali You Linlin Hu |
author_facet | Zhenyu Tian Jiali You Linlin Hu |
author_sort | Zhenyu Tian |
collection | DOAJ |
description | Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multicast tree (known as a multicast joining node, or MJN) to establish a multicast distribution path from the MJN to itself. The MJN selection method runs on the DR and has a significant impact on the distribution of the multicast tree, that directly affects the load distribution in the network. However, the current MJN selection method cannot effectively detect the load status of the downlink multicast path in the case of asymmetric routing, leading to network congestion and limiting the number of multicast groups that the network can accommodate (multicast capacity). To solve this problem, we propose an MJN selection method based on the reverse shortest path tree (RSPT). RSPT can effectively detect the load status of downlink multicast paths in case of routing asymmetry. Based on the detection results of RSPT, DR can select the MJN with the lowest path load to join the multicast tree. Our experimental results indicate that compared to existing multicast methods, our method has a lower cost and delay, and can effectively balance the network load in the case of asymmetric routing, increasing multicast capacity by more than two times. |
first_indexed | 2024-03-11T03:42:27Z |
format | Article |
id | doaj.art-38d0713bcfa14b329cc574c4f1d95a71 |
institution | Directory Open Access Journal |
issn | 1999-5903 |
language | English |
last_indexed | 2024-03-11T03:42:27Z |
publishDate | 2023-04-01 |
publisher | MDPI AG |
record_format | Article |
series | Future Internet |
spelling | doaj.art-38d0713bcfa14b329cc574c4f1d95a712023-11-18T01:26:51ZengMDPI AGFuture Internet1999-59032023-04-0115515610.3390/fi15050156A Reverse Shortest Path Tree-Based Multicast Joining Node Selection MethodZhenyu Tian0Jiali You1Linlin Hu2National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, ChinaNational Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, ChinaNational Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, ChinaNetwork layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multicast tree (known as a multicast joining node, or MJN) to establish a multicast distribution path from the MJN to itself. The MJN selection method runs on the DR and has a significant impact on the distribution of the multicast tree, that directly affects the load distribution in the network. However, the current MJN selection method cannot effectively detect the load status of the downlink multicast path in the case of asymmetric routing, leading to network congestion and limiting the number of multicast groups that the network can accommodate (multicast capacity). To solve this problem, we propose an MJN selection method based on the reverse shortest path tree (RSPT). RSPT can effectively detect the load status of downlink multicast paths in case of routing asymmetry. Based on the detection results of RSPT, DR can select the MJN with the lowest path load to join the multicast tree. Our experimental results indicate that compared to existing multicast methods, our method has a lower cost and delay, and can effectively balance the network load in the case of asymmetric routing, increasing multicast capacity by more than two times.https://www.mdpi.com/1999-5903/15/5/156network layer multicastmulticast joining nodeasymmetric routingmulticast capacity |
spellingShingle | Zhenyu Tian Jiali You Linlin Hu A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method Future Internet network layer multicast multicast joining node asymmetric routing multicast capacity |
title | A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method |
title_full | A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method |
title_fullStr | A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method |
title_full_unstemmed | A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method |
title_short | A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method |
title_sort | reverse shortest path tree based multicast joining node selection method |
topic | network layer multicast multicast joining node asymmetric routing multicast capacity |
url | https://www.mdpi.com/1999-5903/15/5/156 |
work_keys_str_mv | AT zhenyutian areverseshortestpathtreebasedmulticastjoiningnodeselectionmethod AT jialiyou areverseshortestpathtreebasedmulticastjoiningnodeselectionmethod AT linlinhu areverseshortestpathtreebasedmulticastjoiningnodeselectionmethod AT zhenyutian reverseshortestpathtreebasedmulticastjoiningnodeselectionmethod AT jialiyou reverseshortestpathtreebasedmulticastjoiningnodeselectionmethod AT linlinhu reverseshortestpathtreebasedmulticastjoiningnodeselectionmethod |