Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Towles, B., Dally, W.J.: Guaranteed Scheduling for Switches with Configuration Overhead. IEEE/ACM Trans. on Net 11, 835–847 (2003)
Inukai, T.: An Efficient SS/TDMA Time Slot Assignment Algorithm. IEEE Trans. Commun. 27, 1449–1455 (1979)
Neukermans, A., Ramaswami, R.R.: MEMS Technology for Optical Networking Applications. IEEE Commun. Mag. 39, 62–69 (2001)
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)
Crescenzi, P., Deng, X., Papadimitriou, C.: On Approximating a Scheduling Problem. Journal of Combinatorial Optimization 5, 287–297 (2001)
Koszalka, L.: Static and Dynamic Allocation Algorithms in Mesh Structured Networks. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds.) ICDCIT 2006. LNCS, vol. 4317, pp. 39–50. Springer, Heidelberg (2006)
International Engineering Consortium, http://www.iec.org
Kasprzak, A.: Packet Switching Wide Area Networks, WPWR, Wroclaw /in Polish/ (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zydek, D., Koszalka, L., Pozniak-Koszalka, I., Burnham, K.J. (2008). Algorithms to Managing Unicast, Multicast and Broadcast Transmission for Optical Switches. In: Ma, Y., Choi, D., Ata, S. (eds) Challenges for Next Generation Network Operations and Service Management. APNOMS 2008. Lecture Notes in Computer Science, vol 5297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88623-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-88623-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88622-8
Online ISBN: 978-3-540-88623-5
eBook Packages: Computer ScienceComputer Science (R0)