Virtual private networks: joint resource allocation and routing design

We consider the resource allocation problem in the design of intranets or virtual private networks (VPNs) that is faced by a service provider, which has service level agreements with various customers to carry their multiservice traffic. The design allocates bandwidth on each link to the VPNs such that, when the traffic of a customer is optimally routed over its VPN, a weighted aggregate measure of carried bandwidth over the service provider's infrastructure is maximized, subject to constraints that each VPN carries a specified minimum. Multiplexing is across services and routes within each VPN, but not across VPNs. The traffic modelling is at the flow or call level, with random arrivals and holding times of calls and each call requiring (effective) bandwidth, which is characteristic of the call's service type, on all links in its route. The network is modelled as a multirate loss network. Scalability of the design process, i.e., the ability to handle OC3 and higher rates, is an important contribution, and this is achieved by the systematic use of a refined uniform asymptotic approximation. Our software package VPN DESIGNER incorporates these results. We report on numerical results for problems with up to 8 VPNs on a network with 8 nodes, 24 OC3 links, 5 services and up to 640 routes.

[1]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[2]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[3]  F. Kelly Fixed point models of loss networks , 1989, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[4]  G Kjaergaard [In a class by itself]. , 1990, Sygeplejersken.

[5]  K. G. Ramakrishnan,et al.  Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources , 1998, SIAM J. Appl. Math..

[6]  Debasis Mitra,et al.  Erlang capacity and uniform approximations for shared unbuffered resources , 1994, TNET.

[7]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 2001 .

[8]  K. G. Ramakrishnan,et al.  ATM network design and optimization: a multirate loss network framework , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  K. G. Ramakrishnan,et al.  VPN DESIGNER: A tool for design of multiservice virtual private networks , 1998, Bell Labs Technical Journal.

[10]  Yakov Rekhter,et al.  A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE) , 1998, RFC.

[11]  Debasis Mitra,et al.  Hierarchical virtual partitioning — Algorithms for virtual private networking , 1997, Bell Labs Technical Journal.

[12]  Tamás Henk,et al.  A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration , 1995, IEEE J. Sel. Areas Commun..

[13]  Gustavo de Veciana,et al.  Hierarchical source routing through clouds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  F. Kelly Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[15]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[16]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[17]  Mischa Schwartz,et al.  Broadband integrated networks , 1996 .