A game equilibrated rapid dynamic restoration strategy in ASON
A dynamic equilibrated heuristic algorithm based on the D* principle and mixed-strategy game theory is proposed to resolve the restoration problem at the wavelength level in an automatically switched optical network (ASON). The cost of each edge and the wavelength occupancy was taken into account comprehensively. Nash equilibration between wavelength occupancy and path cost is solved and the evaluation function of the D* algorithm is constructed dynamically using game theory with a mixed strategy. Then, the system restores broken connections rapidly through dynamic route and wavelength assignment (RWA) and ensures a more balanced distribution of network resources in the process of dynamic channel restoration. Simulation results show that the blocking probability is reduced and the restoration probability is promoted effectively by this algorithm. In addition, the rapid and intelligent performance behavior of this algorithm can meet the requirements of restoration time.
restoration ason game theory nash equilibrated d* algorithm rwa