Algorithm with Linear Computational Complexity for Batch Scheduling in OBS Networks

This paper introduces a batch scheduling algorithm for OBS networks which has linear computational complexity. A transformation of the problem formulation is applied to allow the modeling of the problem as a job scheduling with identical machine type of problem. The proposed algorithm was compared to several other heuristic. Results show that it produces a lower bound to the blocking probability of those given by heuristics and it is only 3% slower than the fastest one.