Dynamic waveband switching algorithms based on the layered graph

摘要

In this paper, we proposed two waveband switching algorithms: Minimal Hop Routing (MHP) and Maximal Overlapped Routing (MOP). The differences between them are the weight of link in the layered graph at the waveband and wavelength planes. In MHP algorithm, the weight of links at waveband and wavelength planes are the same, but MOP assigns lower weight to them at the waveband plane than that at the wavelength plane. We conducted extensive simulations with dynamic traffic patterns in the mesh network topology. We evaluated the performance of the proposed algorithms in terms of blocking probability and the number of OXCs port with waveband algorithms of MOP, MHP and RWA algorithm of shortest path routing (SPR). Simulation result shows that waveband algorithm has low blocking probability, and less number of ports is used.