Grooming Connectivity Intents in IP-Optical Networks Using Directed Acyclic Graphs.
Filippos ChristouAndreas KirstädterPublished in: CoRR (2023)
Keyphrases
- directed acyclic graph
- optical networks
- wdm networks
- wavelength division multiplexing
- routing and wavelength assignment
- service differentiation
- equivalence class
- random variables
- structural learning
- conditional independence
- equivalence classes
- connected components
- undirected graph
- directed graph
- dynamic reconfiguration
- structural equation models
- wireless networks
- general purpose
- real time
- causal models
- network technologies
- markov property
- random walk
- state space