Path finding using the multi-layer network description language

Research networks are providing their users with dedicated network connections. Users want these connects to go through different domains, so the research networks are challenged to find valid network connections through multiple domains.
The challenge arises if the different network domains use different technologies, and we have a multi-layer path finding problem.
We will show that there are situations where algorithms as used in single layer networks, such as BGP, SS7 and OSPF-TE, can not find the shortest path, because they can not deal with the complexity of multi-layer networks.
To solve this problem, both a multi-layer network representation as well as new path finding algorithms need to be developed. An additional challenge is to make a generic path finding algorithm that is technology-independent, and does not need to be modified as new technologies emerge.
We show that it possible to create solutions for all three problems. Using RDF-based techniques, we model multi-layer networks and describe incompatibilities for the path finding algorithm in technology-independent way. We also present a path finding algorithm that is able to use this information to find valid paths.