Path Computation in Multi-layer Multi-domain Networks

  • Mohamed Lamine Lamali
  • Hélia Pouyllau
  • Dominique Barth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7289)

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.

Keywords

Multi-layer networks Pseudo-Wire Push-Down Automata 

References

  1. 1.
    Bocci, M., Bryant, S.: RFC5659 - An Architecture for Multi-Segment Pseudowire Emulation Edge-to-Edge (2009)Google Scholar
  2. 2.
    Bryant, S., Pate, P.: RFC3985 - Pseudo Wire Emulation Edge-to-Edge (PWE3) Architecture (2005)Google Scholar
  3. 3.
    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
  4. 4.
    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)Google Scholar
  5. 5.
    Farrel, A., Vasseur, J.P., Ash, J.: RFC4655 - A Path Computation Element (PCE)-Based Architecture (2006)Google Scholar
  6. 6.
    Flajolet, P., Zimmermann, P., Van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science (1994)Google Scholar
  7. 7.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Longman Publishing (2006)Google Scholar
  8. 8.
    Kuipers, F.A., Dijkstra, F.: Path selection in multi-layer networks. Computer Communications (2009)Google Scholar
  9. 9.
    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
  10. 10.
    Lamali, M.L., Pouyllau, H., Barth, D.: End-to-End Quality of Service in Pseudo-Wire Networks. In: ACM CoNEXT Student Workshop (2011)Google Scholar
  11. 11.
    Liebehenschel, J.: Lexicographical Generation of a Generalized Dyck Language. SIAM J. Comput. (2003)Google Scholar
  12. 12.
    Martini, L., Rosen, E., El-Aawar, N., Heron, G.: RFC4448 - Encapsulation Methods for Transport of Ethernet over MPLS Networks (2008)Google Scholar
  13. 13.
    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)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Mohamed Lamine Lamali
    • 1
  • Hélia Pouyllau
    • 1
  • Dominique Barth
    • 2
  1. 1.Alcatel-Lucent Bell Labs FranceNozayFrance
  2. 2.Lab. PRiSM, UMR8144Université de VersaillesVersailles CedexFrance

Personalised recommendations