Building alternate multitasking trees in MPLS networks

dc.contributor.authorTang, Limin, 1977-en_US
dc.contributor.authorBillenhalli, Shreejithen_US
dc.contributor.authorVardhan, Harsen_US
dc.contributor.authorTacca, Marco, 1973-en_US
dc.contributor.authorFumagalli, Andreaen_US
dc.contributor.authorMonti, Paolo, 1973-en_US
dc.contributor.sponsorEric Jonsson School of Engineering and Computer Science. Open Networking Advanced Research (OpNeAR) Laboratory.en_US
dc.contributor.sponsorNext Generation Optical Network (NeGONet) Groupen_US
dc.contributor.sponsorKungl. Tekniska högskolan (KTH). Photonics and Microwave Engineering (FMI). School of Information and Communication Technologyen_US
dc.contributor.sponsorRoyal Institute of Technology (Kista, Sweden)en_US
dc.description.abstractAn 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.en_US
dc.identifier.bibliographicCitationTang, 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.en_US
dc.publisherThe University of Texas at Dallasen_US
dc.relation.isPartOfTechnical Report (University of Texas at Dallas. Department of Electrical Engineering)en_US
dc.rightsCC BY 3.0 (Attribution)en_US
dc.subjectMPLS networken_US
dc.subjectMulticasting (Computer networks)en_US
dc.subjectAlternate treesen_US
dc.titleBuilding alternate multitasking trees in MPLS networksen_US
dc.type.genreTechnical reporten_US


Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
299.77 KB
Adobe Portable Document Format