Adaptive routing for lightwave shufflenet under unbalanced loads

The authors consider the ideal case of complete and up-to-date knowledge of the traffic flow matrix and find the optimal probabilities of a node using a certain route so as to optimize a certain performance criterion. In one version, the criterion is equalizing the usage of all wavelengths in a mean square sense, and in another the criterion is the number of hops that a typical route traverses. A weighted version of the two criteria is also considered and compared with recent contributions dealing with distributed local state information. The combined analysis simulation routine is finally repeated in the case where a few link faults take place in conjunction with load unbalance