Reduction of blocking in arbitrary meshed WDM networks through a biased routing approach

Summary form only given. We have shown that for an arbitrary meshed network biasing the traffic towards a static optimized routing pattern reduces blocking and yields a practical method for dynamic traffic routing in real-world meshed WDM networks. Furthermore, evolutionary scenarios can be incorporated by recalculating the optimal routing pattern to which the dynamic traffic is biased, reducing blocking at any time.