Advertisement

Discovery of BGP MPLS VPNs

  • Sarit Mukherjee
  • Tejas Naik
  • Sampath Rangarajan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3775)

Abstract

BGP/MPLS VPN is a mechanism defined in IETF RFC 2547 that allows service providers to use their IP backbone to provide VPN services. This mechanism is based on using BGP to distribute VPN routing information to the routers in the backbone network and using MPLS to forward VPN traffic. MPLS tunnels are created dynamically when needed, which relieves service providers of pre-provisioning tens of thousands of tunnels. BGP/MPLS VPNs allow service providers to define any arbitrary topology with any number of nodes in a VPN. The service provider can create multiple VPNs using the same core network. Currently most of the service providers track 2547 VPNs either manually or by using a provisioning database. Algorithms described in this paper aims at automating this VPN discovery procedure. Using our algorithms service providers can automatically discover VPNs that have already been configured using the current network configuration information.

Keywords

BGP MPLS VPN Discovery 2547 Route Target VRF Topology 

References

  1. 1.
    Rosen, E., Rekhter, Y.: BGP/MPLS VPNs. Internet RFC-2547 (March 1999), available at http://www.ietf.org/rfc.html
  2. 2.
    Tomsu, P., Wieser, G.: MPLS-Based VPNs Designing Advanced Virtual Networks. Pearson Education (December 2001)Google Scholar
  3. 3.
    Semeria, C.: RFC 2547bis: BGP MPLS VPN Fundamentals, available at http://www.juniper.net/solutions/literature/white_papers/200012.pdf
  4. 4.
    HP Openview Network Services Management Solution for MPLS Networks, Available at http://www.hp.com
  5. 5.
    Kim, Y., Choi, H.-W., Kim, H.-S.: A QoS-guaranteed DiffServ-aware-MPLS VPN and its Network Management System. SNPD (2003)Google Scholar
  6. 6.
    Ould-Brahim, H., Rosen, E.C., Rekhter, Y.: Using BGP as an Auto-Discovery Mechanism for Layer-3 and Layer-2 VPNs. IETF draft (June 2005)Google Scholar
  7. 7.
    Hopcroft, A.J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Inc., Amsterdam (1978)zbMATHGoogle Scholar
  8. 8.
    Harary, F.: Graph Theory. Addison Wesley Publishing Company, Reading (1995)zbMATHGoogle Scholar
  9. 9.
    Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)zbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2005

Authors and Affiliations

  • Sarit Mukherjee
    • 1
  • Tejas Naik
    • 1
  • Sampath Rangarajan
    • 1
  1. 1.Center for Networking ResearchBell LabsHolmdel

Personalised recommendations