With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.
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.
Copy
Paul C. HUANG, Yoshiaki TANAKA, "Multicast Routing Based on Predicted Traffic Statistics" in IEICE TRANSACTIONS on Communications,
vol. E77-B, no. 10, pp. 1188-1193, October 1994, doi: .
Abstract: With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e77-b_10_1188/_p
Copy
@ARTICLE{e77-b_10_1188,
author={Paul C. HUANG, Yoshiaki TANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Multicast Routing Based on Predicted Traffic Statistics},
year={1994},
volume={E77-B},
number={10},
pages={1188-1193},
abstract={With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Multicast Routing Based on Predicted Traffic Statistics
T2 - IEICE TRANSACTIONS on Communications
SP - 1188
EP - 1193
AU - Paul C. HUANG
AU - Yoshiaki TANAKA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E77-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1994
AB - With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.
ER -