On the isochronous and asynchronous traffic scheduling problem for single-star WDM networks

[[abstract]]The problem of scheduling isochronous and asynchronous traffic for single-star WDM networks is investigated. Given a set of scheduled isochronous switching matrices of already established connections, an isochronous traffic demand matrix of new coming requests, and an asynchronous traffic demand matrix, the goal is to find an optimal schedule for the isochronous and asynchronous traffic such that the total duration and the number of switching modes of the schedule are minimized. The isochronous and asynchronous traffic scheduling problem has been proved to be NP-complete [1]. In this paper, the lower bounds on the total switching duration and the number of switching modes for the isochronous and asynchronous traffic scheduling problem are derived. A heuristic algorithm for scheduling isochronous and asynchronous traffic on the single-star WDM networks is proposed. Simulation results show that the average switching duration and the average number of switching modes obtained by the proposed algorithm are quite close to the lower bounds.[[fileno]]2030210030034[[department]]資訊工程學