Login / Signup
A scalable approach for computing distance-bounded node-disjoint paths in optical networks.
Alejandro Arbelaez
Deepak Mehta
Barry O'Sullivan
Cemalettin Ozturk
Luis Quesada
Published in:
ICTON (2015)
Keyphrases
</>
disjoint paths
optical networks
wavelength division multiplexing
directed graph
approximation algorithms
undirected graph
link failure
general purpose
random walk
tree structure
wdm networks