Maximization of Single Hop Traffic with Greedy Heuristics

E. Hyytiä (Finland)


WDM, RWA, logical topology design, single hop traffic


Maximization of the single hop traffic has been proposed as an computationally feasible approximation to the logical topology design problem in wavelength routed networks. In this paper we consider a class of greedy heuristic algo rithms for solving the maximization of the single hop traf fic problem. The considered heuristics configure one light path at a time onto the network. Two new variations of the previously proposed heuristic algorithm are presented and shown to be superior to the earlier heuristic algorithm by numerical simulations.

Important Links:

Go Back