会议专题

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 resuits for LS algorithm are described.

Network transmission algorithm experimentation system.

Dawid Zydek Leszek Koszalka Iwona Pozniak-Koszalka Keith J.Burnham

Dept.of Electrical and Computer Engineering,University of Nevada,Las Vegas,USA Chair of Systems and Computer Networks,Wroclaw University of Technology,50-370 Wroclaw,Poland Control Theory and Applications Centre,Coventry University,CV1 5FB Coventry,United Kingdom

国际会议

11th Asia-Pacific Network Operations and Management Symposium(APNOMS 2008)(第十一届亚太网络运行和管理国际研讨会)

北京

英文

21-30

2008-10-22(万方平台首次上网日期,不代表论文的发表时间)