Department of Computer Science and Information Engineering
National Chung Cheng University
Chiayi, Taiwan 621, R.O.C.
More and more applications require that multicast connections be established. In this paper, the multicast problem in single rate loss networks is studied. Two algorithms, one based on the least loaded routing (LLR) concept and the other one based on the Markov decision process (MDP), are developed. Our simulation results indicate that the LLR-based algorithm yields very competitive performance as compared to the MDP-based algorithm. Since the computational complexity required by MDP-based algorithms is higher than that required by LLR-based algorithms, we conclude that the LLR approach can be considered as a very simple and efficient approach for solving the multicast routing problem in single rate loss networks.
Keywords: multicast, Markov decision process, least loaded routing, loss networks
Received February 8, 1996; revised October 10, 1996.
Communicated by Jin-Fu Chang.
* This research was supported in part by the National Science Council of Taiwan, R.O.C., under contract NSC-84-2213-E-194-026.