Minimizing Cost Grooming Policy for Static Traffic in WDM Networks
WDM网络中静态流量的最少费用疏导策略

To solve the static traffic grooming problem in WDM mesh networks, a minimizing cost grooming policy is proposed based on the transceiver saving auxiliary graph model. The policy considers the costs of both two network resources of transceivers and wavelength links. It searches a least-cost path for each traffic request in order to get the optimized solution with the lease network cost. It assigns different values to edges of the auxiliary graph according to the cost ratio of the two resources. Minimizing the weight of a path means minimizing the resource cost of this path, and then the policy is easily achieved. Simulation results show that the network cost of the policy is always the least despite different cost ratios of the two resources.