MPLS multicasting using caterpillars and a graceful labelling scheme

In This work we describe MPLS (multi-protocol label switching) multicasting under a specific graph (graceful) labeling with the use of the specific multicast tree topology called caterpillar. The use of a caterpillar as the multicast tree is analyzed and compared with the other tree topologies under a multicast network metric. The labeling algorithm proposed uniquely assigns link labels based on the node numbering which in turn enables to give a sharp estimate to the time-to-live parameter and assists in choosing optimal selection of rendezvous points. The graceful code for the caterpillar has revealed an efficient method (G-trace) of the reconstruction of multicast tree topology which in turn to be used for maintainability and for the other purposes in the management site.