PROVISIONING RESTORABLE VIRTUAL PRIVATE NETWORKS USING BARABASI AND WAXMAN TOPOLOGY GENERATION MODEL
Journal Title: ICTACT Journal on Communication Technology - Year 2010, Vol 1, Issue 4
Abstract
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. Our proposed Provisioning Restorable Virtual Private Networks Algorithm (PRA) is used to combine the provisioning and restoration algorithms to achieve better results than the ones obtained by independent restoration and provisioning. In order to ensure service quality and availability in Virtual Private Networks, seamless recovery from failures is essential. The quality of service of the Virtual Private Networks is also improved due to the combination of provisioning and restoration. The bandwidth sharing concept is also applied in link to improve the quality of service in the Virtual Private Network. The performance analysis of the proposed algorithm is carried out in terms of cost, the number of nodes, the number of VPN nodes, delay, asymmetric ratio and delay with constraints with Disjoint Path Algorithm and Approximation Restoration Virtual Private Networks Algorithm. The Provisioning Restorable Virtual Private Networks Algorithm performs better than the Disjoint Path Algorithm.
Authors and Affiliations
Ravi R
Keywords
Related Articles
- EP ID EP200161
- DOI 10.21917/ijct.2010.0028
- Views 82
- Downloads 0
DESIGN AND ANALYSIS OF COMB SHAPE MICROSTRIP PATCH ARRAY ANTENNA FOR WLAN APPLICATIONS
A comb shape rectangular slotted 1 X 4 microstrip patch array antenna is proposed and designed for wireless local area network applications. The functional parameters of the antenna namely, return loss, VSWR, radiation p...
SOFTWARE DEFINED ANTENNA TESTING
Micro strip patch directional antennas are an attractive solution for modern wireless systems due to their high gain and directivity. Being an attractive solution creates the need to design such devices for various appli...
DSP IMPLEMENTATION OF THE FAST FOURIER TRANSFORM USING THE CORDIC ALGORITHM
Fourier transform is a tool enabling the understanding and implementation of a large number of numerical methods for signal and image processing. This tool has many applications in domains such as vocal recognition, imag...
S-SPRAY ROUTING PROTOCOL FOR INTERMITTENTLY CONNECTED MOBILE NETWORKS
The Intermittently Connected Mobile Networks (ICMN) is a disconnected mobile network where a complete connectivity never exists. The intermittent connectivity is due to the dense nature of the network. The dense nature i...
A TLBO-BASED ENERGY EFFICIENT BASE STATION SWITCH OFF AND USER SUBCARRIER ALLOCATION ALGORITHM FOR OFDMA CELLULAR NETWORKS
Downlink of a cellular network with orthogonal frequency-division multiple access (OFDMA) is considered. Joint base station switch OFF and user subcarrier-allocation with guaranteed user quality of service, is shown to b...