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.
KeywordsNetwork transmission algorithm experimentation system
Unable to display preview. Download preview PDF.
- 1.Pozniak-Koszalka, I., Zydek, D.: Architecture and Algorithms of Unicast, Multicast and Broadcast Transmission for Optical Switching. In: Proc. of ICN 2007 Sainte-Luce, France, p. 95. IEEE Computer Society Press, Los Alamitos (2007)Google Scholar
- 5.Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh - Structured Networks with Using Multistage Simulation. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 8.International Engineering Consortium, http://www.iec.org
- 9.Kasprzak, A.: Packet Switching Wide Area Networks, WPWR, Wroclaw /in Polish/ (1999)Google Scholar