Performance Analysis of Rejection Ratio in Cost Optimized Virtual Private Networks Provisioning Algorithm (COVPA) Using Waxman and Barabasi Model in Cyber Space | Science Publications

Journal of Computer Science

Ramanathan Rajasekar¹  Ramaraj Ravi¹  Beulah Shekhar¹ 

关键词: Virtual private network;    service provider;    provisioning algorithm;    rejection ratio;    QoS guarantees;    VPN nodes;    symmetric case;    Waxman model;    primal dual algorithms;    random topology;   

DOI  :  10.3844/jcssp.2012.239.242

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

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

【 授权许可】

Unknown