Abstract

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 parti- tioning 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.