Algorithm for scheduling variable-length messages in WDM networks

In this paper, we develop and analyze a simple algorithm for scheduling var iable length messages in WDM networks with a passive star coupler We base o ur schemes on a star topology with centralized control and use a scheduling algorithm similar to the process management in UNIX system. Every node and message have a scheduling priority associated with them. By comparing our algorithm with random select algorithm, we find that significant improvemen t in performance can be achieved with very little extra cost.