Tang, Limin, 1977-Billenhalli, ShreejithVardhan, HarsTacca, Marco, 1973-Fumagalli, AndreaMonti, Paolo, 1973-2013-05-232013-05-232009-052013-05-23http://hdl.handle.net/10735.1/2638An algorithm for computing alternate multicast trees in packet transport networks is proposed in this paper. The algorithm efficiently computes multiple sub-optimal tree candidates for a given multicast service request. The algorithm builds on the widely used computation of K ordered loopless shortest paths and can be applied to any connected network topology. Simulation experiments obtained for a multiprotocol label switching (MPLS) network are presented to evaluate the effectiveness and performance of the algorithm.CC BY 3.0 (Attribution)http://creativecommons.org/licenses/by/3.0/MPLS networkMulticasting (Computer networks)Alternate treesTextTang, L., S. Billenhalli, H. Vardhan, M. Tacca, A. Fumagalli, and P. Monti. 2009. "Building Alternate Multicasting Trees in MPLS Networks." The University of Texas at Dallas.EE03-2009