Reachability matrix-based path computation using matrix self-multiplication

Optical Communication(2013)

Cited 0|Views4
No score
Abstract
We present a novel all-optical reachability matrix-based path computation procedure that calculates end-to-end reachable paths with either minimum or specified number of regenerators using simple matrix multiplications, as well as satisfying constraints such as latency/cost. We demonstrate practical computation times for real-world networks.
More
Translated text
Key words
matrix multiplication,optical communication,reachability analysis,telecommunication network management,all-optical reachability matrix-based path computation procedure,computation times,cost,end-to-end reachable path calculation,latency,matrix self-multiplication,optical network control tools,optical network design tools,optical network management tools,real-world networks
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined