Dynamic multicast routing and wavelength assignment using generic graph model for wavelength-division-multiplexing networks

Y. Zhou, G. S. Poo, S. Chen, P. Shum, L. Zhang

    Research output: Contribution to journalArticlepeer-review

    7 Citations (Scopus)

    Abstract

    The problem of dynamic multicast routing and wavelength assignment (MC-RWA) in the wavelength-routed wavelength-division-multiplexing networks is addressed. Current solutions to this problem always rely on homogeneous network constructions. However, future backbone networks tend to be heterogeneous in nature. Thus, the dynamic MC-RWA problem should be studied in a more realistic situation by considering the heterogeneity of network structures. A new graph model is proposed for the MC-RWA problem. This model is based on layered auxiliary graph which is generic and able to support various node architectures and heterogeneous network structures. Based on this graph model, the dynamic MC-RWA problem can be simply solved by an efficient multicast tree algorithm on various light-splitting and wavelength-conversion scenarios. In general, this graph model provides a universal platform to study different aspects of the dynamic MC-RWA as well as related problems.

    Original languageEnglish
    Pages (from-to)951-959
    Number of pages9
    JournalIET Communications
    Volume2
    Issue number7
    DOIs
    Publication statusPublished - Aug 6 2008

    ASJC Scopus subject areas

    • Computer Science Applications
    • Electrical and Electronic Engineering

    Fingerprint

    Dive into the research topics of 'Dynamic multicast routing and wavelength assignment using generic graph model for wavelength-division-multiplexing networks'. Together they form a unique fingerprint.

    Cite this