Algorithms to Managing Unicast, Multicast and Broadcast Transmission for Optical Switches

摘要

This paper deals with an optical switching problem concerning an architecture represented by input-output request matrix. New algorithms such as LS, Q-family and J-family are presented and thoroughly studied. J-family algorithms are some modifications of the well known Double algorithm. The study focuses on comparison between the considered algorithms and known algorithms such as Double and Exact. The local comparison criteria consist of the number of decomposed matrices, the number of empty slots, the total time of decomposition and excess. As the global index of performance the weighted penalty is introduced, which comprises local criteria. The properties of the proposed algorithms are shown on examples, where matrices with various elements are decomposed into permutation matrices (switch configurations). An idea of experimentation system and some results of investigations are presented. The properties of the considered algorithms are discussed, especially significant results for LS algorithm are described.