Search

We propose a heuristic wavelength routing algorithm for IP datagrams in WDM networks which operates in a distributed manner. We first present an efficient construction method for a loose virtual topology with a required connectivity property, which reserves a few wavelengths to cope with dynamic traffic demands properly. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands and derive the general bounds on average wavelength utilization in distributed wavelength routing algorithms. Finally, through simulation, it is shown that our algorithm is efficient enough to be used in distributed WDM networks in terms of the blocking performance, control traffic overhead, and computational complexity.