Building alternate multitasking trees in MPLS networks

DSpace/Manakin Repository

Building alternate multitasking trees in MPLS networks

Show full item record

Title: Building alternate multitasking trees in MPLS networks
Author(s):
Tang, Limin, 1977-;
Billenhalli, Shreejith;
Vardhan, Hars;
Tacca, Marco, 1973-;
Fumagalli, Andrea;
Monti, Paolo, 1973-
Sponsors: Eric Jonsson School of Engineering and Computer Science. Open Networking Advanced Research (OpNeAR) Laboratory.
Next Generation Optical Network (NeGONet) Group
Kungl. Tekniska högskolan (KTH). Photonics and Microwave Engineering (FMI). School of Information and Communication Technology
Royal Institute of Technology (Kista, Sweden)
Date Created: 2009-05
Format: Text
Item Type: Technical report
Keywords: MPLS network
Multicasting (Computer networks)
Alternate trees
Abstract: An 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.
Series Title: Technical Report (University of Texas at Dallas. Department of Electrical Engineering)
Series Number: EE03-2009
Publisher: The University of Texas at Dallas
Persistent Link: http://hdl.handle.net/10735.1/2638
Bibliographic Citation: Tang, 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.
Terms of Use: This work is licensed under a Creative Commons Attribution 3.0 Unported License.

Files in this item

Files Size Format View
ECS-TR-EE-Tang-310335.61.pdf 299.7Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)


Show full item record