A heuristic scheduling algorithm in a core optical router with hot spots

In this paper we present a heuristic scheduling algorithm for core optical routers with heterogeneous traffic. We contrast two versions of the algorithm, the ´frozen algorithm´ and the ´nonfrozen algorithm.´ The nonfrozen algorithm deals effectively with the hot spot scenarios by allowing more flexibility in the wave slot assignments. Performance evaluation results indicate that the nonfrozen algorithm produces a ´higher valued´ schedule than the frozen algorithm at a marginal incremental increase cost in computation time.