Simulation on Layered Graph-based Dynamic RWA Agorithm
Hui Wang
Abstract
Hui Wang
Abstract
RWA problem is an important issue for optical network. With the reduction of RWA optimized algorithm solution,the computational efficiency of the algorithm is improved at the expense of optimized performance. How to keep both optimized efficiency and time efficiency is the key point for the design of RWA algorithm in the optical network. This paper tells of the RWA problem in dynamic optical network. And the dynamic RWA algorithm based on layered graph is simulated,the simulation result proves that the algorithm could significantly reduce the network congestion,and it is fairly good in stability and high in utilization rate of resources.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
RWA problem is an important issue for optical network. With the reduction of RWA optimized algorithm solution,the computational efficiency of the algorithm is improved at the expense of optimized performance. How to keep both optimized efficiency and time efficiency is the key point for the design of RWA algorithm in the optical network. This paper tells of the RWA problem in dynamic optical network. And the dynamic RWA algorithm based on layered graph is simulated,the simulation result proves that the algorithm could significantly reduce the network congestion,and it is fairly good in stability and high in utilization rate of resources.
Key concepts: Computer science, Graph, Key (lock), Reduction (mathematics), Algorithm, Distributed computing, Theoretical computer science, Computer security