QoS-constraint multicast restoration with 2-tuple domination core nodes selection in DWDM mesh networks

摘要

Internet Service Providers (ISP) need to support Quality-of-Service (QoS) constrains in Internet multicast applications which are often delay-sensitive and demanding on network resources. This paper proposes a QoS-constraint multicast restoration scheme in WDM mesh networks based on 2-tuple domination core node selection algorithm which minimization of total network resources in "hop-count" as metric while meeting the "delay-constraint" as a second metric. The primary aim of this work is to provide fast inter- and intra-domain routings and steady local survivability with QoS-constraints based on the information obtained from the core nodes. Our simulation results show that the proposed algorithm outperforms the Dual Tree and MRLR algorithms in terms of the minimum restoration time needed for all recovery paths, blocking probability based on the minimum restoration time, instead of minimum hop count in our previous study [1], for different network topologies.