• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A scalable approach for computing distance-bounded node-disjoint paths in optical networks.

Alejandro ArbelaezDeepak MehtaBarry O'SullivanCemalettin OzturkLuis 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