IEICE TRANSACTIONS on Communications
The Multicast Tree Based Routing for The Complete Broadcast Multipoint-to-Multipoint Communications
Summary :
This paper studies routing methods for the complete broadcast multipoint-to-multipoint communication. For a Z-node (Z-site) of the participants of the connection, each site transmits one signal and receives Z-1 signals. The routing method based on connecting each participant by multiple directed point-to-point circuits uses wasteful bandwidth that the source-to-destination data may be duplicated needlessly. We propose routing methods that the connection approach is based on setting multicast tree routes that each participant (site) has one own multicast tree connecting to the other participants under two constraints: the delay-bounded constraint of source-destination path and the available constrained bandwidth for the service of links. For this routing approach, we propose both heuristic algorithm finding approximate solution and search enumeration based algorithm finding optimal solution, and compare the approximate solution with the optimal solution. This approach can lower costs for the subscribers and conserves bandwidth resources for the network providers.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E78-B No.5 pp.720-728
- Publication Date
- 1995/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Communication Networks and Service
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Vorawut PRIWAN, Hitoshi AIDA, Tadao SAITO, "The Multicast Tree Based Routing for The Complete Broadcast Multipoint-to-Multipoint Communications" in IEICE TRANSACTIONS on Communications,
vol. E78-B, no. 5, pp. 720-728, May 1995, doi: .
Abstract: This paper studies routing methods for the complete broadcast multipoint-to-multipoint communication. For a Z-node (Z-site) of the participants of the connection, each site transmits one signal and receives Z-1 signals. The routing method based on connecting each participant by multiple directed point-to-point circuits uses wasteful bandwidth that the source-to-destination data may be duplicated needlessly. We propose routing methods that the connection approach is based on setting multicast tree routes that each participant (site) has one own multicast tree connecting to the other participants under two constraints: the delay-bounded constraint of source-destination path and the available constrained bandwidth for the service of links. For this routing approach, we propose both heuristic algorithm finding approximate solution and search enumeration based algorithm finding optimal solution, and compare the approximate solution with the optimal solution. This approach can lower costs for the subscribers and conserves bandwidth resources for the network providers.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e78-b_5_720/_p
Copy
@ARTICLE{e78-b_5_720,
author={Vorawut PRIWAN, Hitoshi AIDA, Tadao SAITO, },
journal={IEICE TRANSACTIONS on Communications},
title={The Multicast Tree Based Routing for The Complete Broadcast Multipoint-to-Multipoint Communications},
year={1995},
volume={E78-B},
number={5},
pages={720-728},
abstract={This paper studies routing methods for the complete broadcast multipoint-to-multipoint communication. For a Z-node (Z-site) of the participants of the connection, each site transmits one signal and receives Z-1 signals. The routing method based on connecting each participant by multiple directed point-to-point circuits uses wasteful bandwidth that the source-to-destination data may be duplicated needlessly. We propose routing methods that the connection approach is based on setting multicast tree routes that each participant (site) has one own multicast tree connecting to the other participants under two constraints: the delay-bounded constraint of source-destination path and the available constrained bandwidth for the service of links. For this routing approach, we propose both heuristic algorithm finding approximate solution and search enumeration based algorithm finding optimal solution, and compare the approximate solution with the optimal solution. This approach can lower costs for the subscribers and conserves bandwidth resources for the network providers.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - The Multicast Tree Based Routing for The Complete Broadcast Multipoint-to-Multipoint Communications
T2 - IEICE TRANSACTIONS on Communications
SP - 720
EP - 728
AU - Vorawut PRIWAN
AU - Hitoshi AIDA
AU - Tadao SAITO
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E78-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1995
AB - This paper studies routing methods for the complete broadcast multipoint-to-multipoint communication. For a Z-node (Z-site) of the participants of the connection, each site transmits one signal and receives Z-1 signals. The routing method based on connecting each participant by multiple directed point-to-point circuits uses wasteful bandwidth that the source-to-destination data may be duplicated needlessly. We propose routing methods that the connection approach is based on setting multicast tree routes that each participant (site) has one own multicast tree connecting to the other participants under two constraints: the delay-bounded constraint of source-destination path and the available constrained bandwidth for the service of links. For this routing approach, we propose both heuristic algorithm finding approximate solution and search enumeration based algorithm finding optimal solution, and compare the approximate solution with the optimal solution. This approach can lower costs for the subscribers and conserves bandwidth resources for the network providers.
ER -
English
