We investigate a state dependent multicast routing scheme, called Least Load Multicast Routing (LLMR), for single rate loss networks. The algorithm is based on Least Load Routing (LLR) concept and the approach is to select the least loaded links for establishing connections. An analytical model for LLMR is developed. The accuracy of the analytical model is compared with the simulation results and is found to be very good. We also develop a simplified analytical model for fully symmetrical networks, which is also verified by comparing with simulation results.
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
Chi-Chung CHEUNG, Danny H. K. TSANG, Sanjay GUPTA, "State Dependent Multicast Routing for Single Rate Loss Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 5, pp. 1388-1396, May 2001, doi: .
Abstract: We investigate a state dependent multicast routing scheme, called Least Load Multicast Routing (LLMR), for single rate loss networks. The algorithm is based on Least Load Routing (LLR) concept and the approach is to select the least loaded links for establishing connections. An analytical model for LLMR is developed. The accuracy of the analytical model is compared with the simulation results and is found to be very good. We also develop a simplified analytical model for fully symmetrical networks, which is also verified by comparing with simulation results.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_5_1388/_p
Copy
@ARTICLE{e84-b_5_1388,
author={Chi-Chung CHEUNG, Danny H. K. TSANG, Sanjay GUPTA, },
journal={IEICE TRANSACTIONS on Communications},
title={State Dependent Multicast Routing for Single Rate Loss Networks},
year={2001},
volume={E84-B},
number={5},
pages={1388-1396},
abstract={We investigate a state dependent multicast routing scheme, called Least Load Multicast Routing (LLMR), for single rate loss networks. The algorithm is based on Least Load Routing (LLR) concept and the approach is to select the least loaded links for establishing connections. An analytical model for LLMR is developed. The accuracy of the analytical model is compared with the simulation results and is found to be very good. We also develop a simplified analytical model for fully symmetrical networks, which is also verified by comparing with simulation results.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - State Dependent Multicast Routing for Single Rate Loss Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1388
EP - 1396
AU - Chi-Chung CHEUNG
AU - Danny H. K. TSANG
AU - Sanjay GUPTA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2001
AB - We investigate a state dependent multicast routing scheme, called Least Load Multicast Routing (LLMR), for single rate loss networks. The algorithm is based on Least Load Routing (LLR) concept and the approach is to select the least loaded links for establishing connections. An analytical model for LLMR is developed. The accuracy of the analytical model is compared with the simulation results and is found to be very good. We also develop a simplified analytical model for fully symmetrical networks, which is also verified by comparing with simulation results.
ER -