Performance of scheduling algorithms in optical packet switches equipped with limited-range wavelength converters

The performance of an optical packet- switching architecture that uses the wavelength conversion technique to solve the packet contention problem is evaluated. The architecture, referred to as shared per node (SPN), is equipped with limited- range wavelength converters shared per node. We evaluate for this architecture the optimum scheduling performance by resolving an integer linear programming problem. We propose some scheduling algorithms allowing the optimum scheduling performance to be reached in low computation time. In particular an algorithm, based on heuristic rules, is proposed. It is able to reach good performance at a complexity O(M), M being the number of wavelengths used. (c) 2005 Optical Society of America.