Throughput performance of d-tree multicast capable optical cross-connect under synchronous traffic

This paper investigates the throughput performance of the d-tree multicast capable optical cross-connect (MC-OXC) by using the separated unicast/multicast splitter-and-delivery (SUM-SaD) switches under synchronous traffic. A d-tree property is introduced to constrain the ability that the MC-OXC and SUM-SaD can accommodate the numbers of light trees. We propose the maximal independent set (MIS) model of the conflict graph to establish as most sessions as possible. It needs to find the d-constrained MIS (d-MIS) of multicast conflict graph and the MIS of the remained unicast conflict graph to maximize the throughput under the assumption that the multicast sessions have higher priority than the unicast ones. The MIS problem of the conflict graph is NP-complete, and two heuristic conflict-based algorithms: minimal conflict first (MCF) and first see first service (FSFS) are proposed to find the MIS of the conflict graph. The minimal member first (MMF) and maximal member first (MAMF) algorithms are applied to determine the d-MIS of multicast conflict graph uniquely. Simulation results show that the d-tree MC-OXC at d ¿ 2 achieves favorable throughput performance. When the wavelength resource on each fiber link is scarce, the performances of the four conflict-based MIS algorithms are different and behave in the order of MCF, MMF, FSFS and MAMF from best to worst.