dc.contributor.author | Pitsillides, Andreas | en |
dc.contributor.author | Stylianou, Georgios | en |
dc.contributor.author | Pattichis, Constantinos S. | en |
dc.contributor.author | Sekercioglu, Y. Ahmet | en |
dc.contributor.author | Vasilakos, Athanasios V. | en |
dc.creator | Pitsillides, Andreas | en |
dc.creator | Stylianou, Georgios | en |
dc.creator | Pattichis, Constantinos S. | en |
dc.creator | Sekercioglu, Y. Ahmet | en |
dc.creator | Vasilakos, Athanasios V. | en |
dc.date.accessioned | 2019-11-13T10:42:03Z | |
dc.date.available | 2019-11-13T10:42:03Z | |
dc.date.issued | 2000 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54874 | |
dc.description.abstract | 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. | en |
dc.source | Proceedings - IEEE INFOCOM | en |
dc.source | 19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications' | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0033872562&partnerID=40&md5=c404791057f4a1230e4ee4b95a3c04c6 | |
dc.subject | Optimization | en |
dc.subject | Genetic algorithms | en |
dc.subject | Bandwidth | en |
dc.subject | Computational complexity | en |
dc.subject | Convergence of numerical methods | en |
dc.subject | Frequency allocation | en |
dc.subject | Voice/data communication systems | en |
dc.subject | Bandwidth allocation for virtual paths (BAVP) | en |
dc.subject | Classical constrained optimization (CCO) algorithm | en |
dc.subject | Constrained optimization genetic algorithm | en |
dc.title | Bandwidth Allocation for Virtual Paths (BAVP): Investigation of performance of classical constrained and genetic algorithm based optimization techniques | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.description.volume | 3 | |
dc.description.startingpage | 1501 | |
dc.description.endingpage | 1510 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Conference Object | en |
dc.description.notes | <p>Sponsors: IEEE | en |
dc.description.notes | Conference code: 56703 | en |
dc.description.notes | Cited By :24</p> | en |
dc.contributor.orcid | Pitsillides, Andreas [0000-0001-5072-2851] | |
dc.contributor.orcid | Pattichis, Constantinos S. [0000-0003-1271-8151] | |
dc.gnosis.orcid | 0000-0001-5072-2851 | |
dc.gnosis.orcid | 0000-0003-1271-8151 | |