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

Authors:
Dawid Zydek;Leszek Koszalka;Iwona Pozniak-Koszalka;Keith J. Burnham
Affiliations:
Dept. of Electrical and Computer Engineering, University of Nevada, Las Vegas, USA;Chair of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland 50-370;Chair of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland 50-370;Control Theory and Applications Centre, Coventry University, Coventry, United Kingdom CV1 5FB
Venue:
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Year:
2008

Citing 5
Cited 0

Guaranteed scheduling for switches with configuration overhead

IEEE/ACM Transactions on Networking (TON)
Algorithms of Unicast, Multicast and Broadcast Transmission for Optical Switches

ICN '07 Proceedings of the Sixth International Conference on Networking
Comparison of allocation algorithms for mesh structured networks with using multistage simulation

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Static and dynamic allocation algorithms in mesh structured networks

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
MEMS technology for optical networking applications

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.