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.
This work is partially supported by the ETICS-project, funded by the European Commission. Grant agreement no.: FP7-248567 Contract Number: INFSO-ICT-248567.
Chapter PDF
References
Bocci, M., Bryant, S.: RFC5659 - An Architecture for Multi-Segment Pseudowire Emulation Edge-to-Edge (2009)
Bryant, S., Pate, P.: RFC3985 - Pseudo Wire Emulation Edge-to-Edge (PWE3) Architecture (2005)
Cho, H., Ryoo, J., King, D.: Stitching dynamically and statically provisioned segments to construct end-to-end multi-segment pseudowires (2011), http://www.ietf.org/id/draft-cho-pwe3-mpls-tp-mixed-ms-pw-setup-01.txt
Dijkstra, F., Andree, B., Koymans, K., van der Ham, J., Grosso, P., de Laat, C.: A multi-layer network model based on ITU-T G.805. Comput. Netw. (2008)
Farrel, A., Vasseur, J.P., Ash, J.: RFC4655 - A Path Computation Element (PCE)-Based Architecture (2006)
Flajolet, P., Zimmermann, P., Van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science (1994)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Longman Publishing (2006)
Kuipers, F.A., Dijkstra, F.: Path selection in multi-layer networks. Computer Communications (2009)
Lamali, M.L., Pouyllau, H., Barth, D.: Appendices to Path computation in multi-Layer multi-domain Networks (2011), https://www.ict-etics.eu/fileadmin/documents/publications/scientific_papers/report.pdf
Lamali, M.L., Pouyllau, H., Barth, D.: End-to-End Quality of Service in Pseudo-Wire Networks. In: ACM CoNEXT Student Workshop (2011)
Liebehenschel, J.: Lexicographical Generation of a Generalized Dyck Language. SIAM J. Comput. (2003)
Martini, L., Rosen, E., El-Aawar, N., Heron, G.: RFC4448 - Encapsulation Methods for Transport of Ethernet over MPLS Networks (2008)
Shiomoto, K., Papadimitriou, D., Le Roux, J., Vigoureux, M., Brungard, D.: RFC5212 - Requirements for GMPLS-based multi-region and multi-layer networks, MRN/MLN (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lamali, M.L., Pouyllau, H., Barth, D. (2012). Path Computation in Multi-layer Multi-domain Networks. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30045-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-30045-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30044-8
Online ISBN: 978-3-642-30045-5
eBook Packages: Computer ScienceComputer Science (R0)