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

  • Dawid Zydek
  • Leszek Koszalka
  • Iwona Pozniak-Koszalka
  • Keith J. Burnham
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5297)


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.


Network transmission algorithm experimentation system 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    Towles, B., Dally, W.J.: Guaranteed Scheduling for Switches with Configuration Overhead. IEEE/ACM Trans. on Net 11, 835–847 (2003)CrossRefGoogle Scholar
  3. 3.
    Inukai, T.: An Efficient SS/TDMA Time Slot Assignment Algorithm. IEEE Trans. Commun. 27, 1449–1455 (1979)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Neukermans, A., Ramaswami, R.R.: MEMS Technology for Optical Networking Applications. IEEE Commun. Mag. 39, 62–69 (2001)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Crescenzi, P., Deng, X., Papadimitriou, C.: On Approximating a Scheduling Problem. Journal of Combinatorial Optimization 5, 287–297 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    International Engineering Consortium,
  9. 9.
    Kasprzak, A.: Packet Switching Wide Area Networks, WPWR, Wroclaw /in Polish/ (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dawid Zydek
    • 1
  • Leszek Koszalka
    • 2
  • Iwona Pozniak-Koszalka
    • 2
  • Keith J. Burnham
    • 3
  1. 1.Dept. of Electrical and Computer EngineeringUniversity of NevadaLas VegasUSA
  2. 2.Chair of Systems and Computer NetworksWroclaw University of TechnologyWroclawPoland
  3. 3.Control Theory and Applications CentreCoventry UniversityCoventryUnited Kingdom

Personalised recommendations