Bandwidth Allocation for Virtual Paths (BAVP): Investigation of performance of classical constrained and genetic algorithm based optimization techniques
Ημερομηνία
2000Συγγραφέας
![ORCID logo](https://orcid.org/sites/default/files/images/orcid_16x16.png)
Stylianou, Georgios
![ORCID logo](https://orcid.org/sites/default/files/images/orcid_16x16.png)
Sekercioglu, Y. Ahmet
Vasilakos, Athanasios V.
Source
Proceedings - IEEE INFOCOM19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications'
Volume
3Pages
1501-1510Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
We investigate the performance of a classical constrained optimization (CCO) algorithm and a constrained optimization Genetic Algorithm (GA) for solving the Bandwidth Allocation for Virtual Paths (BAVP) problem. We compare throughput, fairness and time complexity of GA-BAVP and CCO-BAVP for several node topologies. The results on maximizing the throughput obtained with GA-BAVP and CCO-BAVP are in close agreement, however when considering fairness GA-BAVP outperforms CCO-BAVP, especially for more complex topologies, like the 7-node network, without abundant link capacity. Convergence of the two algorithms appears similar, with GA-BAVP outperforming CCO-BAVP in initial stages, and vice-versa for longer time scales. However as the problem complexity increases the solution time for the Genetic Algorithm does not increase as fast as the classical constrained optimization algorithm. A hybrid scheme is also introduced, combining the benefits of both algorithms. It exhibited better overall convergence rate but the same solution as CCO-BAVP.