Skip to Main content Skip to Navigation
Conference papers

Path Computation in Multi-layer Multi-domain Networks

Abstract : Carrier-grade networks have often multiple layers of protocols. To tackle this heterogeneity, the Pseudo-Wire architecture provides encapsulation and decapsulation functions of protocols over Packet-Switched Networks. At the scale of multi-domain networks, computing a path to support an end-to-end service requires various encapsulations and decapsulations that can be nested but for which manual configurations are needed. Graph models are not expressive enough for this problem. In this paper, we propose an approach using graphs and Push-Down Automata (PDA) to capture the compatibility among encapsulations and decapsulations along an inter-domain path. They are respectively modeled as pushes and pops on a PDA’s stacks. We provide polynomial algorithms that compute either the shortest path in hops, or in the number of encapsulations and decapsulations to optimize interfaces’ configuration.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, June 1, 2017 - 11:34:49 AM
Last modification on : Wednesday, October 20, 2021 - 12:24:14 AM
Long-term archiving on: : Wednesday, September 6, 2017 - 6:22:46 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Mohamed Lamine Lamali, Hélia Pouyllau, Dominique Barth. Path Computation in Multi-layer Multi-domain Networks. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.421-433, ⟨10.1007/978-3-642-30045-5_32⟩. ⟨hal-01531112⟩



Record views


Files downloads