研究目的
Investigating the performance of a new heuristic called snake-one for routing and wavelength assignment in WDM networks under dynamic traffic conditions.
研究成果
The snake-one heuristic demonstrates a good performance in satisfying demand with lower Blocking Probability up to 130 Erlangs compared to other heuristics. However, it does not improve Network Utilization, suggesting the need for modifications to the algorithm to enhance both performance indicators.
研究不足
The snake-one heuristic shows improved performance in terms of Blocking Probability up to 130 Erlangs but does not effectively reduce Network Utilization, indicating a need for further optimization to balance both indicators.
1：Experimental Design and Method Selection:
The study involves the simulation of the snake-one heuristic in the NSFNET network under dynamic traffic conditions, comparing its performance with other heuristics like Simulated Annealing, Genetic Algorithms, and Tabu Search. The indicators used for comparison are Blocking Probability and Network Utilization.
2：Sample Selection and Data Sources:
The NSFNET network with 16 nodes and 25 optical fiber links was used for simulation. The traffic load varied from 0 to 180 Erlangs in increments of 10 Erlangs.
3：List of Experimental Equipment and Materials:
Simulation software capable of modeling WDM networks and dynamic traffic conditions.
4：Experimental Procedures and Operational Workflow:
The snake-one heuristic was applied to find lightpaths in the network, with comparisons made against other heuristics based on Blocking Probability and Network Utilization metrics.
5：Data Analysis Methods:
The performance of the snake-one heuristic was analyzed in terms of Blocking Probability and Network Utilization, with comparisons made to other heuristics.
独家科研数据包，助您复现前沿成果，加速创新突破
获取完整内容
