研究目的
To overcome the network bottleneck when a failure occurs by establishing a capacity expansion based recovery model and solving it with genetic algorithm under link recovery and path recovery strategies to achieve minimal network expansion cost.
研究成果
The paper concludes that both the methods based on link recovery and path recovery can completely recover the fault with the performance of algorithm based on path recovery being superior. Larger population and greater mutation probability make the algorithm based on path recovery more efficient.
研究不足
The study focuses on the expansion of existing optical connection when the network capacity cannot meet the service requirements for failure recovery. It does not address other potential failure scenarios or network architectures.
1：Experimental Design and Method Selection:
The study establishes a capacity expansion based recovery model and solves it using genetic algorithm under link recovery and path recovery strategies.
2：Sample Selection and Data Sources:
The network model has 38 nodes and 179 links, with each link providing 1000 Gbps of bandwidth resources. 1000 random traffic flows are simulated.
3：List of Experimental Equipment and Materials:
Not explicitly mentioned.
4：Experimental Procedures and Operational Workflow:
The process includes releasing network resources, re-planning the recovery path, calculating K sets of recovery paths for each affected service flow through the Dijkstra algorithm, performing initial coding for recovery routing plan set, and evaluating each scheme to obtain the expansion cost.
5：Data Analysis Methods:
The expansion cost is used as the fitness value in the genetic algorithm to measure the fault recovery scheme.
独家科研数据包，助您复现前沿成果，加速创新突破
获取完整内容
