Performance Analysis of Rejection Ratio in Cost Optimized Virtual Private Networks Provisioning Algorithm (COVPA) Using Waxman and Barabasi Model in Cyber Space
Ramanathan Rajasekar, Ramaraj Ravi and Beulah Shekhar
DOI : 10.3844/jcssp.2012.239.242
Journal of Computer Science
Volume 8, Issue 2
Problem statement: Virtual private networks have provided customers with a secure and low-cost communication environment. Approach: The COVPA, the provisioning algorithm for a Virtual Private Network service, which built and managed VPNs on demand. Results: The COVPA allowed each VPN to have guaranteed resources and customized control and supported a highly dynamic VPN service where creation and modification operations took place on fast timescales at reduced cost. Also, it allowed the sharing of bandwidth on the links to reduce the cost. A design process is described, that attempts to satisfy the goals of both the customer and the VPN Service Provider (VSP). Conclusion/Recommendations: The performance of the proposed algorithm is analyzed in terms of cost, the number of nodes, the number of VPN nodes, asymmetric ratio and rejection ratio with the breadth first search, steiner tree and primal dual algorithms. With the enhancement on the design process, the COVPA performs better than the breadth first search, steiner tree and primal dual algorithms
© 2012 Ramanathan Rajasekar, Ramaraj Ravi and Beulah Shekhar. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.