By Topic

Hybrid graph-based traffic grooming for multicast connections in mesh optical networks

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

3 Author(s)
Panayiotou, T. ; Dept. of Electr. & Comput. Eng., Univ. of Cyprus, Nicosia, Cyprus ; Ellinas, G. ; Antoniades, N.

This paper investigates the problem of multicast traffic grooming in transparent optical networks utilizing a grooming approach that is based on routing/grooming of multicast calls on hybrid graphs (HGs). HGs are constructed dynamically upon the arrival of each multicast call, in such a way that they are consisting of both the available physical links and the logical links with available free capacity. Two schemes for building the HGs are proposed, namely the minimum free capacity light-tree first (MCF) and the maximum free capacity light-tree first (MXCF), and also a novel hybrid Steiner tree (HST) heuristic for routing/grooming on HGs is presented. The proposed routing/grooming approach exhibits improved performance in terms of blocking probability compared to existing multicast grooming approaches that route/groom multicast calls by considering physical and logical links separately.

Published in:

Communication Systems (ICCS), 2012 IEEE International Conference on

Date of Conference:

21-23 Nov. 2012