A Dynamic Managed VPN Service: Architecture And Algorithms

VPN as a managed service enables the service provider to offer more demanding and revenue generating services. In this paper we try to tackle an important problem of service providers providing bandwidth service on demand on an IP/MPLS core network. We propose a managed VPN architecture for such a service highlighting the novelty in our architecture. We concentrate on an important aspect of service definition called the topology abstraction service and define a new problem called the VPN core capacity sharing problem that arises in this context. We propose three schemes to solve this problem borrowing from results from graph theory. As part of our simulation study, we evaluate each of these strategies with different call arrival scenarios and present the results.

[1]  F. Palmieri.  VPN scalability over high performance backbones evaluating MPLS VPN against traditional approaches , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[2]  Paul Knight,et al.  Layer 2 and 3 virtual private networks: taxonomy, technology, and standardization efforts , 2004, IEEE Communications Magazine.

[3]  Wataru Kishimoto,et al.  On M-route flows in a network , 1992, [Proceedings] Singapore ICCS/ISITA `92.

[4]  Hong Zhang,et al.  Multiple abstraction schemes for generalized virtual private switched networks , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[5]  Rahul Garg,et al.  Fair bandwidth sharing among virtual networks: a capacity resizing approach , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Ibrahim Khalil,et al.  Edge Provisioning and Fairness in VPN-DiffServ Networks , 2004, Journal of Network and Systems Management.

[7]  Changcheng Huang,et al.  Topology abstraction as VPN service , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[8]  R. Isaacs,et al.  Lightweight, dynamic and programmable virtual private networks , 2000, 2000 IEEE Third Conference on Open Architectures and Network Programming. Proceedings (Cat. No.00EX401).

[9]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[10]  Marwan Krunz,et al.  Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks , 2000, TOMC.

[11]  Chun Tung Chou.  Traffic engineering for MPLS-based virtual private networks , 2004, Comput. Networks.

[12]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[13]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.