Multi-cast waveband grooming algorithms in multi-domain optical networks

Multi-cast waveband grooming algorithms in multi-domain optical networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

With the increasing of number of multimedia network applications, multi-cast services are becoming more and more popular. At the same time, the waveband switching technique is proposed to save ports and to reduce the cost of optical cross-connect. However, the existing multi-cast waveband grooming algorithms are mostly limited to single-domain optical networks. The size of optical backbones keeps enlarging, and the backbones are actually divided into multiple independent domains to provide the needed scalability and confidentiality. To solve these problems, the authors propose three heuristic algorithms: per-domain multi-cast grooming (PDMG), virtual topology multi-cast grooming (VTMG) and hierarchical multi-domain multi-cast grooming (HMMG). The main difference between these algorithms is that the inter-domain routing is performed in a different manner; in other words, the routings in PDMG, VTMG and HMMG are computed based on the domain-by-domain fixed routing table, the high layer in the aggregative virtual topology of multi-domains and the hierarchical integrated multi-cast auxiliary graph, respectively. For the intra-domain routing, the three algorithms employ the same method based on an intra-domain multi-cast integrated auxiliary graph. Simulation results show that compared with PDMG and VTMG, HMMG has the best performance in terms of the number of ports saved and the blocking probability.


    1. 1)
      • Cao, X., Qiao, C.: `Wavelength assignment in waveband switching networks with wavelength conversion', Proc. GLOBECOM’04, November 2004, Houston, USA, p. 1943–1947.
    2. 2)
      • Kolarov, A., Sengupta, B.: `A study of waveband routing and wavelength assignment in multi-granular hybrid optical networks', Proc. ICC’05, May 2005, Seoul, Korea, p. 239–243.
    3. 3)
    4. 4)
      • R. UI-Mustafa , A.E. Kamal . Design and provisioning of WDM networks with multicast traffic grooming. IEEE J. Sel. Areas Commun. , 4 , 37 - 53
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
      • Benhaddou, D., Dandu, S.: `A new dynamic path computation algorithm for multi-domain optical networks', Proc. ICTON-MW, December 2008, Marrakesh, Morocco, p. 1–6.
    10. 10)
    11. 11)
      • Yang, X., Ramamurthy, B.: `Inter-domain dynamic routing in multi-layer optical transport networks', Proc. GLOBECOM’ 03, December 2003, California, USA, p. 2623–2627.
    12. 12)
    13. 13)
      • Chen, B., Dutta, R.: `On the application of K-center algorithms to hierarchical traffic grooming', Proc. Broadband Networks, October 2005, Massachusetts, USA, p. 1218–1224.
    14. 14)
      • Iyer, M., Rouskas, G.: `A hierarchical model for multigranular optical networks. Networks and systems', Proc. Broadband Networks, October 2008, Queensland, Australia, p. 444–451.
    15. 15)
    16. 16)
      • Billah, A., Wang, B.: `Multicast traffic grooming in WDM optical mesh networks', Proc. GLOBECOM’ 03, December 2003, San Francisco, USA, p. 2755–2760.
    17. 17)
      • H. Takahasi , A. Matsuyama . An approximate solution for the Steiner problem in graphs. Math. Jap , 6 , 573 - 577

Related content

This is a required field
Please enter a valid email address