%0 Conference Proceedings
%T Path Computation in Multi-layer Multi-domain Networks
%+ Alcatel-Lucent Bell Labs France [Nozay]
%+ Parallélisme, Réseaux, Systèmes, Modélisation (PRISM)
%A Lamali, Mohamed, Lamine
%A Pouyllau, Hélia
%A Barth, Dominique
%Z Part 8: LISP and Multi-domain Routing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7289
%N Part I
%P 421-433
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30045-5_32
%K Multi-layer networks
%K Pseudo-Wire
%K Push-Down Automata
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531112/document
%2 https://inria.hal.science/hal-01531112/file/978-3-642-30045-5_32_Chapter.pdf
%L hal-01531112
%U https://inria.hal.science/hal-01531112
%~ CNRS
%~ PRISM
%~ IFIP-LNCS
%~ IFIP
%~ UVSQ
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7289
%~ IFIP-NETWORKING