Clique-partitioning connections-scheduling with faulty switches in dilated benes network

In this paper, we study the problem of connections -scheduling with faulty switches in a dilated re-arrangeable photonic network, say dilated Benes network (DBN). We map the connections-scheduling problem to a variant of the clique partitioning problem, and then use a heuristic algorithm for scheduling the connections. The simulation results show that the proposed method is efficient and it can maintain the reliability of the DBN network by tolerating some faulty switches.