2nd International ICST Conference on Communications and Networking in China

Research Article

The Selection of Logical Rings for Packet Transmissions in WDM Optical Star Networks

  • @INPROCEEDINGS{10.1109/CHINACOM.2007.4469428,
        author={JungChun Liu and Hann-Jang Ho and SingLing Lee},
        title={The Selection of Logical Rings for Packet Transmissions in WDM Optical Star Networks},
        proceedings={2nd International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2008},
        month={3},
        keywords={Broadcasting  Computer science  Delay  Optical buffering  Optical fiber networks  Optical transmitters  Optimal scheduling  Scheduling algorithm  WDM networks  Wavelength division multiplexing},
        doi={10.1109/CHINACOM.2007.4469428}
    }
    
  • JungChun Liu
    Hann-Jang Ho
    SingLing Lee
    Year: 2008
    The Selection of Logical Rings for Packet Transmissions in WDM Optical Star Networks
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2007.4469428
JungChun Liu1,*, Hann-Jang Ho2,*, SingLing Lee1,*
  • 1: Department of Computer Science and Information Engineering National Chung Cheng University Chiayi, Taiwan
  • 2: Department of Computer Science and Information Engineering Wufeng Institute of Technology Chiayi, Taiwan
*Contact email: jcliu@cc.feu.edu.tw, hjho@cs.ccu.edu.tw, singling@ccu.edu.tw

Abstract

In this paper, we present a multi-hop scheduling algorithm for the AU-to-AU broadcast (AAB) problem in wavelength division multiplexed (WDM) optical star networks with N nodes. To decrease the packet delay in packet transmissions, our scheduling algorithm will limit the hop distance to a constant rho. We transfer the rho-hop AAB problem to the Hamiltonian cycles problem and then generate the logical rings for physical packet transmissions. In order to minimize the scheduling length, the problem of selection of logical rings is to minimize the number of tuning operations to reduce the influence of tuning latency delta for the AAB problem. We propose a 2-approximation algorithm that needs only 2[(N-1)/rho] tuning operations in an AAB scheduling. When rho < (delta+radic(delta2-8delta))/2 the schedule length of our algorithm w ill be shorter than that of the optimal single-hop scheduling algorithm.