By Topic

MPLS multicasting using caterpillars and a graceful labelling scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Basak, A. ; Eur. Univ. of Lefke, Cyprus

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.

Published in:

Information Visualisation, 2004. IV 2004. Proceedings. Eighth International Conference on

Date of Conference:

14-16 July 2004