{'fraction_non_alphanumeric': 0.017163048965169108, 'fraction_numerical': 0.0, 'mean_word_length': 5.136222910216718, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
ENHANCED PROVISIONING ALGORITHM FOR VIRTUAL PRIVATE NETWORK IN HOSE MODEL WITH QUALITY OF SERVICE SUPPORT USING WAXMAN MODEL

As Internet usage grows exponentially, network security issues become increasingly important. Network security measures are needed to protect data during transmission. Various security controls are used to prevent the access of hackers in networks. They are firewall, virtual private networks and encryption algorithms. Out of these, the virtual private network plays a vital role in preventing hackers from accessing the networks. A Virtual Private Network (VPN) provides end users with a way to privately access information on their network over a public network infrastructure such as the internet. Using a technique called “Tunneling”, data packets are transmitted across a public routed network, such as the internet that simulates a point-to-point connection. Virtual private networks provide customers with a secure and low-cost communication environment. The basic structure of the virtual circuit is to create a logical path from the source port to the destination port. This path may incorporate many hops between routers for the formation of the circuit. The final, logical path or virtual circuit acts in the same way as a direct connection between the two ports. The K-Cost Optimized Delay Satisfied Virtual Private Networks Tree Provisioning Algorithm connects VPN nodes using a tree structure and attempts to optimize the total bandwidth reserved on the edges of the VPN tree that satisfies the delay requirement. It also allows sharing the bandwidth on the links to improve the performance. The proposed KCDVT algorithm computes the optimal VPN Tree. The performance analysis of the proposed algorithm is carried out in terms of cost, the number of nodes, and the number of VPN nodes, delay, asymmetric ratio and delay with constraints with Breadth First Search Algorithm. The KCDVT performs better than the Breadth First Search Algorithm.