2009Communications technologyRequires access

Simulation on Layered Graph-based Dynamic RWA Agorithm

Hui Wang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Graph, Key (lock), Reduction (mathematics), Algorithm, Distributed computing, Theoretical computer science, Computer security

Related papers

Back to paper searchBrowse research topicsOriginal source
Simulation on Layered Graph-based Dynamic RWA Agorithm — Research Paper | ScholarLens