Valiant load-balanced robust routing algorithm for multi-granularity connection requests in traffic-grooming WDM mesh networks

摘要

The paper considers the problem of establishing robust routes for multi-granularity connection requests in traffic-grooming WDM mesh networks and proposes a novel Valiant load-balanced robust routing scheme for the hose uncertain model. Our objective is to minimize the total network cost when construct the stable virtual topology that assure robust routing for all possible multi-granularity connection requests under the hose model. Since the optimization problem is shown to be NP-complete, two heuristic algorithms are proposed and evaluated. Finally we compare the traffic throughput of the virtual topology by Valiant load-balanced robust routing scheme with that of the traditional traffic-grooming algorithm under the same total network cost by computer simulation.