This page presents an excerpt of the available research material, including the Preliminary Pages, Table of Contents, Abstract, Chapters One to Five, and References. It provides a comprehensive overview of the study, enhancing readability and accessibility for students, and researchers seeking complete material on the topic stated above.
I am profoundly grateful to everyone who contributed to the successful completion of this project. I am especially grateful to my Supervisor (Name), the Head of Department (Name), and the Lecturers in the Department of Electrical / Electronics Engineering (EE) for their invaluable guidance and support. I also acknowledge the contributions of authors and scholars whose works on Comparative Analysis of Dynamic Virtual Private Networks Resource Allocation Schemes provided essential insights. Special thanks go to my study area (and any funding organizations, if applicable) for their financial assistance. I am equally thankful to stakeholders, including mentors, teachers, and colleagues, for their encouragement and support. Finally, I deeply appreciate my family and friends for their patience and unwavering support throughout this journey. Your contributions have been instrumental in making this research a reality.
The need for high performance resource allocation schemes for Virtual Private Networks (VPNs) has led to the proliferation of algorithms for VPN resource allocation. It was found that most works on VPN resource allocation focused either on admission control or link reservation on the network. Also, review of relevant literatures have revealed the need for a resource allocation/scheduling scheme whose algorithm will be able to allocate bandwidth and memory resources to different VPNS sharing the same link to the network service provider. Resources should be allocated in such a manner that utilization is optimal while VPN endpoints or customers receive services that does not undermine the service-level agreement (SLA) with the service provider.
MATLAB Simulink was used to design a simulation model for analysing the VPN access network obtaining and comparing results for the link bandwidth utilization, buffer memory utilization and packet loss rate performances of the RDVNP (Robust Dynamic Virtual Network Provisioning) algorithm against the DWARF-Net (Dynamic bandWidth Allocation and guarantee on Resource Fairness) algorithm.
From the results obtained, DWARF-Net algorithm's performance was better than the RDVNP's algorithm in almost all parameters tested on. On bandwidth utilization, DWARF-Net had an average channel utilization of 61.23% against RDVNP's 48.28%. on buffer utilization 42% for DWARF-Net, 41% for RDVNP and average loss rate average of 1 Packet/second for DWARF-Net against 20 Packets/second for RDVNP. From the simulation analysis and result of this work, DWARF-Net was recommended to researchers as an optimal performing algorithm for VPN resource allocation.
1.0 Introduction
1.1 Background of Study
For long, traditional Private Networks (PNs) were established by connecting Private Network sites (e.g., campuses or branch offices of enterprises) with leased lines over a Wide Area Network (WAN). Since these lines were dedicated lines, Security and bandwidth guarantees were assured[1]. As enterprises and other customer's network sites proliferated and spread globally, the number of endpoints of PN's sites has spread while the endpoints got more geographically dispersed.
The distance between endpoints in a Private Network is directly proportional to the fee or cost of providing the links in the private network. Thus, connecting a large number of dispersed PN sites with dedicated lines became very expensive. As a result, there was a need for a cheaper readily available alternative to the PNs. The remedy was provided by developing the Virtual Private Network (VPN) services which ran over the public network's backbone or over the public Internet. This method has been quite successful in making VPNs ubiquitous in interconnecting Private network sites.
…
