Provisioning algorithm for minimum throughput assurance service in VPNs using nonlinear programming
Masayoshi Shimamura, Katsuyoshi Iida, Hiroyuki Koga, Youki Kadobayashi, Suguru Yamaguchi · 2007
The traditional virtual private network (VPN), which provides best effort or static bandwidth allocation services, does not support bursty Internet traffic well. As a way of supporting bursty traffic, a VPN provider can offer minimum throughput assurance (MTA) service to customers. MTA service provides higher throughput predictability than best effort VPN service. Although there are many proposed network architectures for MTA service, certain parameters should be decided offline as provisioning. The difficulty in such provisioning is to meet the minimum throughput requirements in any active state matrices. We propose a provisioning algorithm that uses nonlinear programming for MTA service. We also quantitatively evaluate our algorithm and its performance.