State dependent multicast routing for single rate loss networks
Tsang, Danny H. K.
|Source||Proceedings of International Conference on Telecommunications, Melbourne, 1997, April|
|Summary||In this paper, we investigate a state dependent multicast routing algorithm 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 load links for establishing connections. To facilitate tractable analysis, the networks considered are assumed symmetrical and fully connected. In addition, connection requests are Poisson arrival and the holding times of accepted calls are exponentially distributed. We combine one-time simulations and fixed point equation FPE) to develop an analytical model for LLMR. Analytical results are compared with simulation results and the agreement is surprisingly good. We find that the effect of link independence assumption is insignificant for the analytical model.|
Files in this item: